Please use this identifier to cite or link to this item:
Title: A clustering algorithm based on minimum spanning tree with e-learning applications
Author(s): Wang, Philips Fu Lee 
Xie, Haoran 
Author(s): Wang, S.
Tang, Z.
Rao, Y.
Issue Date: 2016
Publisher: Springer
Related Publication(s): Current Developments in Web Based Learning (ICWL 2015 International Workshops) Revised Selected Papers
Start page: 3
End page: 12
The rapid development of web-based learning applications has generated large amounts of learning resources. Faced with this situation, clustering is valuable to group modeling and intelligent tutoring. In traditional clustering algorithms, the initial centroid of each cluster is often assigned randomly. Sometimes it is very difficult to get an effective clustering result. In this paper, we propose a new clustering algorithm based on a minimum spanning tree, which includes the elimination and construction processes. In the elimination phase, the Euclidean distance is used to measure the density. Objects with low densities are considered as noise and eliminated. In the construction phase, a minimum spanning tree is constructed to choose the initial centroid based on the degree of freedom. Extensive evaluations using datasets with different properties validate the effectiveness of the proposed clustering algorithm. Furthermore, we study how to employ the clustering algorithms in three different e-learning applications.
DOI: 10.1007/978-3-319-32865-2_1
CIHE Affiliated Publication: Yes
Appears in Collections:CIS Publication

SFX Query Show full item record

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.