Reference Hub1
The Construction and Optimization of an AI Education Evaluation Indicator Based on Intelligent Algorithms

The Construction and Optimization of an AI Education Evaluation Indicator Based on Intelligent Algorithms

Yu Zeng, Xing Xu
Copyright: © 2022 |Volume: 16 |Issue: 1 |Pages: 22
ISSN: 1557-3958|EISSN: 1557-3966|EISBN13: 9781683180197|DOI: 10.4018/IJCINI.315275
Cite Article Cite Article

MLA

Zeng, Yu, and Xing Xu. "The Construction and Optimization of an AI Education Evaluation Indicator Based on Intelligent Algorithms." IJCINI vol.16, no.1 2022: pp.1-22. http://doi.org/10.4018/IJCINI.315275

APA

Zeng, Y. & Xu, X. (2022). The Construction and Optimization of an AI Education Evaluation Indicator Based on Intelligent Algorithms. International Journal of Cognitive Informatics and Natural Intelligence (IJCINI), 16(1), 1-22. http://doi.org/10.4018/IJCINI.315275

Chicago

Zeng, Yu, and Xing Xu. "The Construction and Optimization of an AI Education Evaluation Indicator Based on Intelligent Algorithms," International Journal of Cognitive Informatics and Natural Intelligence (IJCINI) 16, no.1: 1-22. http://doi.org/10.4018/IJCINI.315275

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The basic tool in the analytic hierarchy process (AHP) is the complete judgment matrix. To address the weakness of the AHP in determining weight in the comprehensive evaluation system, the particle swarm optimization (PSO)-AHP model proposed in this paper is based on the PSO in the meta-heuristic algorithm. The model was used to solve the indicator weights in the evaluation system of AI education in primary and secondary schools in Fujian Province and was compared with the genetic algorithm and war strategy optimization algorithm. From the comparison results, the PSO-AHP optimization is more effective among the three algorithms, and the indicator consistency can be improved by about 30%. They are both effective in solving the problem that once the judgment matrix is given in the AHP, the weights and indicator consistency cannot be improved. Finally, the results were tested by Friedman statistics to prove the viability of the proposed algorithm.