Back to Search
Start Over
Clustering of online learning resources via minimum spanning tree
- Source :
- AAOU Journal, Vol 11, Iss 2, Pp 197-215 (2016)
- Publication Year :
- 2016
- Publisher :
- Emerald, 2016.
-
Abstract
- PurposeThe quick growth of web-based and mobile e-learning applications such as massive open online courses have created a large volume of online learning resources. Confronting such a large amount of learning data, it is important to develop effective clustering approaches for user group modeling and intelligent tutoring. The paper aims to discuss these issues.Design/methodology/approachIn this paper, a minimum spanning tree based approach is proposed for clustering of online learning resources. The novel clustering approach has two main stages, namely, elimination stage and construction stage. During the elimination stage, the Euclidean distance is adopted as a metrics formula to measure density of learning resources. Resources with quite low densities are identified as outliers and therefore removed. During the construction stage, a minimum spanning tree is built by initializing the centroids according to the degree of freedom of the resources. Online learning resources are subsequently partitioned into clusters by exploiting the structure of minimum spanning tree.FindingsConventional clustering algorithms have a number of shortcomings such that they cannot handle online learning resources effectively. On the one hand, extant partitional clustering methods use a randomly assigned centroid for each cluster, which usually cause the problem of ineffective clustering results. On the other hand, classical density-based clustering methods are very computationally expensive and time-consuming. Experimental results indicate that the algorithm proposed outperforms the traditional clustering algorithms for online learning resources.Originality/valueThe effectiveness of the proposed algorithms has been validated by using several data sets. Moreover, the proposed clustering algorithm has great potential in e-learning applications. It has been demonstrated how the novel technique can be integrated in various e-learning systems. For example, the clustering technique can classify learners into groups so that homogeneous grouping can improve the effectiveness of learning. Moreover, clustering of online learning resources is valuable to decision making in terms of tutorial strategies and instructional design for intelligent tutoring. Lastly, a number of directions for future research have been identified in the study.
- Subjects :
- Fuzzy clustering
Computer science
Correlation clustering
Conceptual clustering
02 engineering and technology
minimum spanning tree
online learning resources
Machine learning
computer.software_genre
density based
lcsh:LB5-3640
CURE data clustering algorithm
0202 electrical engineering, electronic engineering, information engineering
Cluster analysis
e-learning
business.industry
05 social sciences
Constrained clustering
050301 education
lcsh:Theory and practice of education
Data stream clustering
Canopy clustering algorithm
020201 artificial intelligence & image processing
Artificial intelligence
Data mining
business
0503 education
computer
clustering
Subjects
Details
- ISSN :
- 18583431
- Volume :
- 11
- Database :
- OpenAIRE
- Journal :
- Asian Association of Open Universities Journal
- Accession number :
- edsair.doi.dedup.....8c954cd53ee407d930697fd3d93cc801
- Full Text :
- https://doi.org/10.1108/aaouj-09-2016-0036