Browse Code
GroupAL.KOM offers an algorithmic approach to match items (usually meant to represent people) into groups of a pre-defined size.
Citing an abstract:
"(..) 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 different 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.", p. 1 in
Konert, J., Burlak, D., Steinmetz, R., 2014. The Group Formation Problem: An Algorithmic Approach to Learning Group Formation. In: Rensing, C., Freitas, S. de, Ley, T., Muñoz-Merino, P.J. (Eds.), Proceedings of the 9th European Conference on Technology Enhanced Learning (EC-TEL). Springer Berlin, Graz, Austria, pp. 221–23.
Features
- group formation optimization
- fixed group size support
- weighted criteria either to be matched homogeneously or heterogeneously
- different strategies (participant-centric or group-centric) matchers
- includes optional optimization cycles
- provides a normalized group formation quality metric (GPI) for comparison
- provides a normalized cohort formation quality metric (CPI) for comparison
- comes with a random participant data generator (for evaluations)
