Adaptive Hierarchical Clustering Based Student Group Exercise Recommendation via Multi-objective Evolutionary Method

被引:0
作者
Wang, Ziang [1 ]
Sun, Yifei [1 ]
Cao, Yifei [1 ]
Yang, Jie [1 ]
Shi, Wenya [1 ]
Zhang, Ao [1 ]
Ju, Jiale [1 ]
Yin, Jihui [1 ]
Yan, Qiaosen [1 ]
Yang, Xinqi [1 ]
机构
[1] Shaanxi Normal Univ, Sch Phys & Informat Technol, Xian 710119, Peoples R China
来源
NEURAL COMPUTING FOR ADVANCED APPLICATIONS, NCAA 2024, PT I | 2025年 / 2181卷
基金
中国国家自然科学基金;
关键词
Intelligent Education; Exercise Recommendation; Multi-Objective Optimization; Hierarchical Clustering; ALGORITHM;
D O I
10.1007/978-981-97-7001-4_14
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
Exercise recommendation is an important research direction in intelligent education. The most advanced exercise recommendation methods focus on the association between each student and each knowledge concept and exercise, and model the exercise recommendation as a Multi-Objective Optimization Problem (MOP). However, this method is based on each individual student to recommend exercises, which will cause the recommendation process to consume too much time when the number of students is large. One approach to solve this problem is to recommend exercises based on student clusters after clustering students with similar characteristics. According to the specific characteristics of the student group, this paper proposes an Adaptive Hierarchical Clustering algorithm with Ward's method. The algorithm can adaptively adjust the within-cluster variance threshold for different student sets to make appropriate clustering for them. After clustering, the exercise recommendation process, which is modeled as a MOP, will be carried out in clusters. The experimental results show that when using different Multi-Objective Evolutionary Algorithms (MOEAs) to solve the exercise recommendation process, the recommendation performance after clustering is improved compared with that before clustering, and the total recommendation time for the student group is greatly reduced.
引用
收藏
页码:186 / 200
页数:15
相关论文
共 25 条
[11]   Statistical Properties of Kendall's Tau Under Contaminated Gaussian Model With Applications in Random Signal Detection [J].
Lai, Huadong ;
Xu, Weichao .
IEEE SIGNAL PROCESSING LETTERS, 2020, 27 :655-659
[12]   An Intelligent Teaching Test Paper Generation System Based on Ant Colony Hybrid Genetic Algorithms [J].
Lou, Zhang .
2021 13TH INTERNATIONAL CONFERENCE ON MEASURING TECHNOLOGY AND MECHATRONICS AUTOMATION (ICMTMA 2021), 2021, :467-470
[13]  
Pazzani M. J., 2007, The Adaptive Web. Methods and Strategies of Web Personalization, P325
[14]  
Schafer J. B., 2007, The Adaptive Web. Methods and Strategies of Web Personalization, P291
[15]  
Sheugh L, 2015, 2015 AI & ROBOTICS (IRANOPEN)
[16]   Density peaks clustering based on k-nearest neighbors and self-recommendation [J].
Sun, Lin ;
Qin, Xiaoying ;
Ding, Weiping ;
Xu, Jiucheng ;
Zhang, Shiguang .
INTERNATIONAL JOURNAL OF MACHINE LEARNING AND CYBERNETICS, 2021, 12 (07) :1913-1938
[17]   A many objective commercial recommendation algorithm via Game-Based core node extraction [J].
Sun, Yifei ;
Cao, Yifei ;
Cheng, Shi ;
Yang, Jie ;
Shi, Wenya ;
Zhang, Ao ;
Ju, Jiale .
EGYPTIAN INFORMATICS JOURNAL, 2023, 24 (04)
[18]   A tutorial on spectral clustering [J].
von Luxburg, Ulrike .
STATISTICS AND COMPUTING, 2007, 17 (04) :395-416
[19]  
Wang F, 2020, AAAI CONF ARTIF INTE, V34, P6153