Pendekatan Clustering untuk Menganalisis Efisiensi dan Kinerja Mahasiswa Berdasarkan Data Menerapkan Metode K-Means

Authors

  • Amelia Rahmadhani Politeknik Caltex Riau, Pekanbaru

DOI:

https://doi.org/10.30865/mib.v6i4.4922

Keywords:

K-Means Technique, Elbow Technique, Clustering Technique, Data Mining, Academic Performance

Abstract

The purpose of this study is to cluster the efficiency and performance of students. This is because the academic community is currently faced with several challenges in terms of analyzing and evaluating the progress of a student's academic achievement. In the real world, classifying student performance is a scientifically challenging task. Recently, several studies have applied cluster analysis to evaluate student outcomes and used statistical techniques to divide their scores in relation to student performance. This approach, however, is not efficient. In this study, we combined two techniques, namely k-mean and elbow clustering algorithm to evaluate student performance. Based on this combination, the performance results will be more accurate in analyzing and evaluating the progress of student performance, the application of the Elbow method according to this study gives the best number of clusters to 3, and when the K-Means method is applied, data is generated that the number of students is 73 students, from 4 repetitions. There are 3 clusters, namely the category of "Achievable", "Potential for Achievement", and "Less Achievement", with the results of the "Achievable" cluster as many as 34 students with a percentage of 47.22%, the cluster "Potential for Achievement" as many as 24 students with a percentage of 33.33 %, and the "Less Achievement" cluster as many as 15 students with a percentage of 19.45%.

References

F. A. Syam, “Implementasi Metode Klastering K-Means Untuk Mengelompokan Hasil Evaluasi Mahasiswa,†vol. 8, no. Sunjana 2010, pp. 1857–1864, 2017.

M. Z. Rodriguez et al., Clustering algorithms : A comparative approach. 2019.

Y. Li and H. Wu, “2012 International Conference on Solid State Devices and Materials Science A Clustering Method Based on K-Means Algorithm,†Phys. Procedia, vol. 25, pp. 1104–1109, 2012, doi: 10.1016/j.phpro.2012.03.206.

B. K. Khotimah, F. Irhamni, and T. R. I. Sundarwati, “A GENETIC ALGORITHM FOR OPTIMIZED INITIAL CENTERS K-MEANS CLUSTERING IN SMEs,†vol. 90, no. 1, pp. 23–30, 2016.

B. Chong, “K-means clustering algorithm : a brief review,†vol. 4, no. 5, pp. 37–40, 2021, doi: 10.25236/AJCIS.2021.040506.

M. E. Celebi, H. A. Kingravi, and P. A. Vela, “Expert Systems with Applications A comparative study of efficient initialization methods for the k-means clustering algorithm,†Expert Syst. Appl., vol. 40, no. 1, pp. 200–210, 2013, doi: 10.1016/j.eswa.2012.07.021.

U. R. Raval and C. Jani, “Implementing & Improvisation of K-means Clustering Algorithm,†vol. 5, no. 5, pp. 191–203, 2016.

D. Marutho, S. H. Handaka, and E. Wijaya, “The Determination of Cluster Number at k-mean using Elbow Method and Purity Evaluation on Headline News,†2018 Int. Semin. Appl. Technol. Inf. Commun., pp. 533–538, 2018.

J. Jasser, H. M. B, and M. A. Zohdy, “Situation-Awareness in Action : An Intelligent Online Learning Platform ( IOLP ),†pp. 319–330, 2017, doi: 10.1007/978-3-319-58077-7.

X. Qin, K. M. Ting, and V. C. S. Lee, “Nearest-Neighbour-Induced Isolation Similarity and Its Impact on Density-Based Clustering,†2019.

C. Gao, H. Sun, T. Wang, M. Tang, N. I. Bohnen, and L. T. Martijn, “Model-based and Model-free Machine Learning Techniques for Diagnostic Prediction and Classification of Clinical Outcomes in Parkinson ’ s Disease,†no. January, pp. 1–21, 2018, doi: 10.1038/s41598-018-24783-4.

M. Sharma, G. N. Purohit, and S. Mukherjee, “Information Retrieves from Brain MRI Images for Tumor Detection Using Hybrid Technique K-means and Arti fi cial Neural Network ( KMANN ),†2018.

S. Mahmood, M. S. Rahaman, D. Nandi, and M. Rahman, “A Proposed Modification of K-Means Algorithm,†no. June, 2015, doi: 10.5815/ijmecs.2015.06.06.

R. Vashistha, “Estimation of Inter-Centroid Distance Quality in Data Clustering problem using Hybridized K-Means Algorithmâ€.

T. Omar, A. Alzahrani, and M. Zohdy, “Clustering Approach for Analyzing the Student ’ s Efficiency and Performance Based on Data,†pp. 171–182, 2020, doi: 10.4236/jdaip.2020.83010.

B. Yang, X. Fu, N. D. Sidiropoulos, and M. Hong, “Towards K-means-friendly Spaces : Simultaneous Deep Learning and Clustering,†2017.

G. Wang et al., “Integration K-Means Clustering Method and Elbow Method For Identification of The Best Customer Profile Cluster Integration K-Means Clustering Method and Elbow Method For Identification of The Best Customer Profile Clusterâ€, doi: 10.1088/1757-899X/336/1/012017.

P. Bholowalia, “EBK-Means : A Clustering Technique based on Elbow Method and K-Means in WSN,†vol. 105, no. 9, pp. 17–24, 2014.

G. X. Huang and D. Lin, “Clustering Analysis and Visualization of Terrorist Attack Data,†p. 3369343, 2019.

X. Cheng, Y. Zhang, Y. Chen, Y. Wu, and Y. Yue, “Pest identification via deep residual learning in complex background,†Comput. Electron. Agric., vol. 141, pp. 351–356, 2017, doi: 10.1016/j.compag.2017.08.005.

J. B. Macqueen, “Ws’lSIlirETii’,†no. 89, 1965.

N. A. Jamadi, M. Siraj, M. M. Din, H. K. Mammy, and N. Ithnin, “Privacy Preserving Data Mining Based on Geometrical Data Transformation Method ( GDTM ) and K-Means Clustering Algorithm,†vol. 8, no. 2, pp. 1–7, 2018.

Q. Qiu and Q. Zhang, “Grey Kmeans Algorithm and its Application to the Analysis of Regional Competitive Ability,†no. 2013, pp. 0–4.

M. Yedla, S. R. Pathakota, and T. M. Srinivasa, “Enhancing K-means Clustering Algorithm with Improved Initial Center,†vol. 1, no. 2, pp. 121–125, 2010.

P. Taylor, G. J. A. Amaral, L. H. Dore, R. P. Lessa, and B. Stosic, “Communications in Statistics - Simulation and Computation k-Means Algorithm in Statistical Shape Analysis,†no. November 2014, pp. 37–41, doi: 10.1080/03610911003765777.

K. G. Engineering, “Review on determining number of Cluster in K-Means Clustering,†no. January 2013, 2016.

Sujatha and S. Sona, “New fast k means clustering algorithm using modiï¬ed centroid selection method,†Int. J. Eng. Res. Technol., vol. 2, no. 2, pp. 1–9, 2013.

R. D. Dana et al., “Analysis of the effect early cluster centre points on the combination of k-means algorithms and sum of squared error on k centroidâ€, doi: 10.1088/1757-899X/725/1/012089.

Downloads

Published

2022-10-25

Issue

Vol. 6 No. 4 (2022): Oktober 2022

Section

Articles

License

Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License

Authors who publish with this journal agree to the following terms:

  1. Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under Creative Commons Attribution 4.0 International License that allows others to share the work with an acknowledgment of the work's authorship and initial publication in this journal.
  2. Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  3. Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (Refer to The Effect of Open Access).