Educational Information System Optimization for Artificial Intelligence Teaching Strategies

Under the background of the information age, scientific research and engineering practice have developed vigorously, resulting in many complex optimization problems that are difficult to solve. How to design more effective optimization methods has become the focus of urgent solutions in many academi...

Full description

Bibliographic Details
Main Authors: Taotang Liu, Zhongxin Gao, Honghai Guan
Format: Article
Language:English
Published: Hindawi-Wiley 2021-01-01
Series:Complexity
Online Access:http://dx.doi.org/10.1155/2021/5588650
Description
Summary:Under the background of the information age, scientific research and engineering practice have developed vigorously, resulting in many complex optimization problems that are difficult to solve. How to design more effective optimization methods has become the focus of urgent solutions in many academic fields. Under the guidance of such demand, intelligent optimization algorithms have emerged. This article analyzes and optimizes the modern artificial intelligence teaching information system in detail. On the basis of determining the network architecture, a detailed demand analysis was carried out, and the overall structure optimization of the network was given; the business process and data flow of the main modules of the website (resource center module and collaborative learning module) were optimized. In order to further enhance the local search ability of the algorithm, a multiclass interactive optimization algorithm is proposed in combination with the Euclidean distance-based clustering method, which changes the teaching mode from “one-person teaching” to “multiperson teaching.” This clustering method has lower complexity and is beneficial to enhance the utilization of neighborhood information. At the same time, in order to enhance the diversity of the population and strengthen the connection between the subgroups, after the teaching phase, the worst students in each subgroup are allowed to learn from the best teachers of the population, and after the learning phase, individuals in a random subgroup are allowed to learn from other subgroups. The algorithm was tested in the experimental environment of unconstrained, constrained, and an engineering problem. From the test results, it can be seen that the algorithm is not easy to fall into the local optimum. Compared with other algorithms, the solution accuracy is higher and the stability is better. And it performed well in engineering optimization problems, thus verifying the effectiveness of the strategy.
ISSN:1099-0526