The week's pick
Random Articles
Reseach Article
An Evaluation of Educational Process with K-Means Clustering for Students Grouping
| International Journal of Computer Applications |
| Foundation of Computer Science (FCS), NY, USA |
| Volume 181 - Number 18 |
| Year of Publication: 2018 |
| Authors: Muhammad Syaeful Fajar, Kusworo Adi, Catur Edi Widodo |
10.5120/ijca2018917858
|
Muhammad Syaeful Fajar, Kusworo Adi, Catur Edi Widodo . An Evaluation of Educational Process with K-Means Clustering for Students Grouping. International Journal of Computer Applications. 181, 18 ( Sep 2018), 15-19. DOI=10.5120/ijca2018917858
Abstract
K-means clustering is a method of grouping data by looking for similarities between attributes possessed by data points and can overcome high data dimensions because of the simplicity of the algorithms it has. The disadvantage of the k-means method is that the initial centroid initialization will affect the end result of clustering and is very susceptible to outliner data because it will affect computational time. This study combines the huffman tree initialization and k-means to overcome the weaknesses of data grouping in k-means. This study uses 120 students data results taken from the results of try out activities conducted at one of the vocational high schools in Semarang City. The experiment aims to classify data based on the similarity of attributes possessed by the same data. Testing is done by measuring the level of accuracy of the expected results with the results of clustering. The results of this study indicate the highest accuracy value in cluster 1 with a value of 92% with an average value of 67% accuracy in all clusters.
References
- I. Mistrik, Software Architecture for Big Data and the Cloud. 2013.
- J. Han and M. Kamber, Data Mining: Concepts and Techniques, vol. 54, no. Second Edition. 2006.
- S. S. Yu, S. W. Chu, C. M. Wang, Y. K. Chan, and T. C. Chang, “Two improved k-means algorithms,” Applied Soft Computing Journal, 2017.
- W. Shunye, “An improved k-means clustering algorithm based on dissimilarity,” Proc. 2013 Int. Conf. Mechatron. Sci. Electr. Eng. Comput., vol. 133, pp. 2629–2633, 2013.
- M. E. Celebi, H. A. Kingravi, and P. A. Vela, “A comparative study of efficient initialization methods for the k-means clustering algorithm,” Expert Syst. Appl., vol. 40, no. 1, pp. 200–210, 2013.
- N. Delavari, M. R. Beikzadeh, and S. Phon-Amnuaisuk, “Application of enhanced analysis model for data mining processes in higher educational system,” in ITHET 2005: 6th International Conference on Information Technology Based Higher Education and Training, 2005, 2005, vol. 2005.
- R. S. J. D. Baker, “Data mining for education,” Int. Encycl. Educ., vol. 7, pp. 112–118, 2010.
- D. Kabakchieva and K. Stefanova, “Data mining approach for analyzing student profiles to improve the university marketing policy,” in 17th European Concurrent Engineering Conference 2011, ECEC 2011 - 7th Future Business Technology Conference, FUBUTEC 2011, 2011, pp. 17–21.
- M. A. Rahman and M. Z. Islam, “A hybrid clustering technique combining a novel genetic algorithm with K-Means,” Knowledge-Based Syst., vol. 71, pp. 345–365, 2014.
- A. K. Jain, “Data clustering: 50 years beyond K-means,” Pattern Recognit. Lett., vol. 31, no. 8, pp. 651–666, 2010.
- H. Jiawei, K. Micheline, and P. Jian, DATA MINING (Concept and Techniques), vol. 3, no. 13. 2012.
- S. J. Redmond and C. Heneghan, “A method for initialising the K-means clustering algorithm using kd-trees,” Pattern Recognit. Lett., vol. 28, no. 8, pp. 965–973, 2007.
Index Terms
Keywords