A revised Girvan–Newman Clustering Algorithm for Cooperative Groups Detection in Programming Learning
Computer Science and Information Systems, Tome 21 (2024) no. 2
Cet article a éte moissonné depuis la source Computer Science and Information Systems website
Learning to program is a challenging task for novices. Students vary substantially in their ability to understand complex and abstract topics in computer programming logic, such as loop logic, function recursion, arrays, passing parameters, and program structure design. Cooperative learning is an effective method of learning and teaching programming. In traditional cooperative learning, students group themselves, or teachers group students intuitively. This paper proposes a clustering method based on item response theory (IRT) and the revised Girvan–Newman clustering for clustering students by learning ability. Item response theory calculated the learner’s ability and interpersonal relationship questionnaire generated by the social network analysis. The proposed method was validated by conducting a quasi-experimental test in a freshmen programming course, and the method significantly improved learning outcomes in this course.
Keywords:
Learner ability, Girvan–Newman clustering, Social Network Analysis, Programming
@article{CSIS_2024_21_2_a5,
author = {Wen-Chih Chang},
title = {A revised {Girvan{\textendash}Newman} {Clustering} {Algorithm} for {Cooperative} {Groups} {Detection} in {Programming} {Learning}},
journal = {Computer Science and Information Systems},
year = {2024},
volume = {21},
number = {2},
url = {http://geodesic.mathdoc.fr/item/CSIS_2024_21_2_a5/}
}
Wen-Chih Chang. A revised Girvan–Newman Clustering Algorithm for Cooperative Groups Detection in Programming Learning. Computer Science and Information Systems, Tome 21 (2024) no. 2. http://geodesic.mathdoc.fr/item/CSIS_2024_21_2_a5/