Online Personalized Learning Path Recommendation Based on Saltatory Evolution Ant Colony Optimization Algorithm

Shugang Li, Hui Chen, Xin Liu, Jiayi Li, Kexin Peng () and Ziming Wang ()
Additional contact information
Shugang Li: School of Management, Shanghai University, Shanghai 200444, China
Hui Chen: School of Management, Shanghai University, Shanghai 200444, China
Xin Liu: School of Management, Shanghai University, Shanghai 200444, China
Jiayi Li: Songjiang No. 2 Middle School, Shanghai 201600, China
Kexin Peng: School of Management, Shanghai University, Shanghai 200444, China
Ziming Wang: School of Management, Shanghai University, Shanghai 200444, China

Mathematics, 2023, vol. 11, issue 13, 1-19

Abstract: To solve the problems of slow convergence and low accuracy when the traditional ant colony optimization (ACO) algorithm is applied to online learning path recommendation problems, this study proposes an online personalized learning path recommendation model (OPLPRM) based on the saltatory evolution ant colony optimization (SEACO) algorithm to achieve fast, accurate, real-time interactive and high-quality learning path recommendations. Consequently, an online personalized learning path optimization model with a time window was constructed first. This model not only considers the learning order of the recommended learning resources, but also further takes the review behavior pattern of learners into consideration, which improves the quality of the learning path recommendation. Then, this study constructed a SEACO algorithm suitable for online personalized learning path recommendation, from the perspective of optimal learning path prediction, which predicts path pheromone evolution by mining historical data, injecting the domain knowledge of learning path prediction that can achieve best learning effects extracted from domain experts and reducing invalid search, thus improving the speed and accuracy of learning path optimization. A simulation experiment was carried out on the proposed online personalized learning path recommendation model by using the real leaner learning behavior data set from the British “Open University” platform. The results illustrate that the performance of the proposed online personalized learning path recommendation model, based on the SEACO algorithm for improving the optimization speed and accuracy of the learning path, is better than traditional ACO algorithm, and it can quickly and accurately recommend the most suitable learning path according to the changing needs of learners in a limited time.

Keywords: saltatory evolution ant colony optimization algorithm; personalized learning; learning path recommendation; domain knowledge mining (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/11/13/2792/pdf (application/pdf)
https://www.mdpi.com/2227-7390/11/13/2792/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:11:y:2023:i:13:p:2792-:d:1176001

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().