Clustering Educational Digital Library Usage Data: A Comparison of Latent Class Analysis and K-Means Algorithms
Year: 2013
Type: article
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.
Authors: Xu, Beijie, Recker, Mimi, Qi, Xiaojun, Flann, Nicholas, Ye, Lei
Institution: Utah State University
Language: English
Subfield: Computer Science Applications
Field: Computer Science
Domain: Physical Sciences
SDG: Quality education
Open Access status: diamond
Funder: National Science Foundation
OpenAlex ID: W2096243224
