Clustering Educational Digital Library Usage Data: A Comparison of Latent Class Analysis and K-Means Algorithms

##plugins.themes.bootstrap3.article.main##

##plugins.themes.bootstrap3.article.sidebar##

Published Jul 22, 2013
Beijie Xu Mimi Recker Xiaojun Qi Nicholas Flann Lei Ye

Abstract

This article examines clustering as an educational data mining method. In particular, two clustering algorithms, the widely used K-means and the model-based Latent Class Analysis, are compared, using usage data from an educational digital library service, the Instructional Architect (IA.usu.edu). Using a multi-faceted approach and multiple data sources, three types of comparisons of resulting clusters are presented: 1) Davies-Bouldin indices, 2) clustering results validated with user profile data, and 3) cluster evolution. Latent Class Analysis is superior to K-means on all three comparisons. In particular, LCA is more immune to the variance of feature variables, and clustering results turn out well with minimal data transformation. Our research results also show that LCA perform better than K-means in terms of providing the most useful educational interpretation for this dataset.

How to Cite

Xu, B., Recker, M., Qi, X., Flann, N., & Ye, L. (2013). Clustering Educational Digital Library Usage Data: A Comparison of Latent Class Analysis and K-Means Algorithms. JEDM | Journal of Educational Data Mining, 5(2), 38-68. Retrieved from https://jedm.educationaldatamining.org/index.php/JEDM/article/view/21
Abstract 335 | PDF Downloads 418

##plugins.themes.bootstrap3.article.details##

Section
Articles