The Greedy Approach to Group Students for Cooperative Learning

摘要

For effective cooperative learning organize group is important. Member in the group to the interaction between the group members are to be composed of heterogeneous. However, the average ability of the group needed to solve a given task to a fair evaluation in cooperative learning should be similar to each other between the groups. In this paper, we propose greedy approach to find partitions with high homogeneity in a group and high heterogeneity between groups.