Dynamic Re-Composition of Learning Groups Using PSO-Based Algorithms.

作者: Niels Pinkwart , Zhilin Zheng

DOI:

关键词: Sample (statistics)Computational learning theoryComputer scienceGroup (mathematics)Machine learningArtificial intelligenceComposition (combinatorics)Dropout (neural networks)AlgorithmClass (computer programming)Learning classifier systemCollaborative learning

摘要: In collaborative learning contexts, the problem of automatically forming effective groups gets considerably complex with larger class sizes, e.g. in MOOCs. Additionally, group dynamics caused by high dropout rates currently observable on online open course platforms poses challenges to formation strategies. To address these problems, this paper presents PSO-based algorithms dynamically re-compose groups. addition static grouping criteria (such as MBTI personality types), take into account factors success rate and satisfaction during re-composition. We carried out simulations based randomly generated sample data. The experimental results show that proposed approach performs better than traditional exhaustive or random methods.

参考文章(4)
Richard M. Felder, Barbara Oakley, Rebecca Brent, Imad Elhajj, Turning Student Groups into Effective Teams ,(2004)
Qingyun Yang, Changsheng Zhang, Jigui Sun, Yan Wang, An Improved Discrete Particle Swarm Optimization Algorithm for TSP web intelligence. pp. 35- 38 ,(2007) , 10.5555/1339264.1339653
Luiz Airton Consalter, Orlando Durán, Nibaldo Rodriguez, A PSO-based clustering algorithm for manufacturing cell design workshop on knowledge discovery and data mining. pp. 72- 75 ,(2008) , 10.5555/1363217.1363282
Doug Clow, MOOCs and the funnel of participation learning analytics and knowledge. pp. 185- 189 ,(2013) , 10.1145/2460296.2460332