The Group Formation Problem: An Algorithmic Approach to Learning Group Formation
Key: KBS14-1
Author: Johannes Konert, Dmitrij Burlak, Ralf Steinmetz
Date: September 2014
Kind: In proceedings
Publisher: Springer International Switzerland
Book title: Proceedings of the 9th European Conference on Technology Enhanced Learning (EC-TEL)
Keywords: Learning Group Formation; Algorithmic Optimization; Matching; CSCL
Abstract: Fostering knowledge exchange among peers is important for learners' motivation, achievement of learning goals as well as improvement of problem solving competency. Still, the positive e ects of such an exchange depend strongly on the suitability of the selected peers in a group. A comparison of existing algorithmic solutions applicable for E-Learning and CSCL scenarios reveals limited support for requirements derived from related work in pedagogical psychology. Therefore, the GroupAL algorithm is proposed. It supports the use of criteria that are either expected to be matched homogeneous or heterogeneous among participants while aiming for equally good group formation for all groups. A normed metric allows for comparison of di erent group formations and is robust against variations. Finally, the evaluation reveals the advantages and widespread applicability of GroupAL. Compared to existing solutions, it achieves a better group formation quality under the chosen conditions.
View Full paper (PDF) | Download Full paper (PDF)

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a non-commercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, not withstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.