A feasibility study on using clustering algorithms in programming education research

  • Authors:
  • Marzieh Ahmadzadeh;Elham Mahmoudabadi

  • Affiliations:
  • Shiraz University of Technology, Shiraz, Iran;Amirkabir University of Technology, Tehran, Iran

  • Venue:
  • Proceedings of the 13th annual conference on Information technology education
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Designing an experiment for programming education research, in which collecting and interpreting a large number of qualitative data about programmers is required, needs careful consideration in order to validate the experiment. When it comes to finding a pattern in the programming behaviour of a specific group of programmers (e,g. novice, intermediate or expert programmers), one of the critical issues is the selection of similar participants who can be placed in one group. In this study we were interested in finding a method that could shorten the path to finding participants. Therefore, the use of clustering algorithms to group similar participants was put to test in order to investigate the effectiveness and feasibility of this approach. The clustering algorithms that were used for this study were K-means and DBSCAN. The results showed that the use of these algorithms, for the mentioned purpose, is feasible and that both algorithms can identify similar participants and place them in the same group while participants who are not similar to others, and therefore are not the correct subject of the study, are recognised.