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 条
[1]   Toward the next generation of recommender systems: A survey of the state-of-the-art and possible extensions [J].
Adomavicius, G ;
Tuzhilin, A .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (06) :734-749
[2]   Implementing a Commercial-Strength Parallel Hybrid Movie Recommendation Engine [J].
Amolochitis, Emmanouil ;
Christou, Ioannis T. ;
Tan, Zheng-Hua .
IEEE INTELLIGENT SYSTEMS, 2014, 29 (02) :92-96
[3]   Analysis of K-Means and K-Medoids Algorithm For Big Data [J].
Arora, Preeti ;
Deepali ;
Varshney, Shipra .
1ST INTERNATIONAL CONFERENCE ON INFORMATION SECURITY & PRIVACY 2015, 2016, 78 :507-512
[4]  
Bian Kun, 2021, Neural Computing for Advanced Applications: Second International Conference, NCAA 2021. Communications in Computer and Information Science (1449), P458, DOI 10.1007/978-981-16-5188-5_33
[5]   A Novel Test Case Generation Approach for Adaptive Random Testing of Object-Oriented Software Using K-Means Clustering Technique [J].
Chen, Jinfu ;
Chen, Haibo ;
Guo, Yuchi ;
Zhou, Minmin ;
Huang, Rubing ;
Mao, Chengying .
IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2022, 6 (04) :969-981
[6]   A Hybrid Recommendation Method with Reduced Data for Large-Scale Application [J].
Choi, Sang Hyun ;
Jeong, Young-Seon ;
Jeong, Myong K. .
IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART C-APPLICATIONS AND REVIEWS, 2010, 40 (05) :557-566
[7]   Influence functions of the Spearman and Kendall correlation measures [J].
Croux, Christophe ;
Dehon, Catherine .
STATISTICAL METHODS AND APPLICATIONS, 2010, 19 (04) :497-515
[8]   A fast and elitist multiobjective genetic algorithm: NSGA-II [J].
Deb, K ;
Pratap, A ;
Agarwal, S ;
Meyarivan, T .
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, 2002, 6 (02) :182-197
[9]  
Dunn J. C., 1973, Journal of Cybernetics, V3, P32, DOI 10.1080/01969727308546046
[10]  
Kotas PM, 2002, INTERNATIONAL CONFERENCE ON COMPUTERS IN EDUCATION, VOLS I AND II, PROCEEDINGS, P1068, DOI 10.1109/CIE.2002.1186152