A revised Girvan–Newman Clustering Algorithm for Cooperative Groups Detection in Programming Learning

5Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Chang, W. C. (2024). A revised Girvan–Newman Clustering Algorithm for Cooperative Groups Detection in Programming Learning. Computer Science and Information Systems, 21(2), 491–505. https://doi.org/10.2298/CSIS220830069C

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free