Pemetaan Karakteristik Sekolah Sasaran Promosi pada UNKRISWINA SUMBA menggunakan K-Means

Authors

  • Murry Albert Agustin Lobo Universitas Kristen Satya Wacana, Salatiga
  • Sri Yulianto J Prasetyo Universitas Kristen Satya Wacana, Salatiga
  • Kristoko D Hartomo Universitas Kristen Satya Wacana, Salatiga

DOI:

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

Keywords:

Data Mining, K-Means, Clustering, Elbow Method, Promotion

Abstract

The rapid development of technology has an impact on how data is collected. A high level of data productivity will be in vain if it is not followed by the ability to process data that can produce information that helps the development of the organization. This study aims to help the Promotion Section of UNKRISWINA SUMBA in mapping the characteristics of the target schools and then provide alternative promotion strategies as input in formulating forms of institutional promotion. The data used is in the form of student data who have registered at UNKRISWINA SUMBA since 2016 – 2020. Data processing uses the concept of data mining by applying the K-Means algorithm. K-Means algorithm is used for clustering promotion target schools as many as 4 clusters. Cluster determination is carried out using the elbow method to determine the optimal value of k to perform calculations. Based on the results of processing based on the K-Means algorithm, it is known that as many as 8 schools in cluster 0 are the schools with the most students enrolling in UNKRISWINA SUMBA, 76 schools in cluster 1 are schools with the fewest students enrolling in UNKRISWINA SUMBA, 21 schools those in cluster 2 are schools with quite a lot of students enrolling in UNKRISWINA SUMBA, and 1 school in cluster 3 is a school with quite a number of students enrolling in UNKRISWINA SUMBA but focusing on the Economic Development and Management study program.

References

H. Kusumo, E. Sediyono, and M. Marwata, “Analisis Algoritma Apriori untuk Mendukung Strategi Promosi Perguruan Tinggi,†Walisongo J. Inf. Technol., vol. 1, no. 1, p. 49, 2019.

A. K. Sandhu, “Big Data with Cloud Computing: Discussions and Challenges,†Big Data Min. Anal., vol. 5, no. 1, pp. 32–40, 2022.

K. Kandali, L. Bennis, and H. Bennis, “A New Hybrid Routing Protocol Using a Modified K-Means Clustering Algorithm and Continuous Hopfield Network for VANET,†IEEE Access, vol. 9, pp. 47169–47183, 2021.

Y. Shima, R. A. Kadir, and F. H. Ali, “A Novel Approach to the Optimization of a Public Bus Schedule Using K-Means and a Genetic Algorithm,†IEEE Access, vol. 9, pp. 73365–73376, 2021.

F. Han, T. Pu, M. Li, and G. Taylor, “Short-Term forecasting of individual residential load based on deep learning and K-means clustering,†CSEE J. Power Energy Syst., vol. 7, no. 2, pp. 261–269, 2021.

F. Deng, W. Gu, W. Zeng, Z. Zhang, and F. Wang, “Hazardous chemical accident prevention based on k-means clustering analysis of incident information,†IEEE Access, vol. 8, pp. 180171–180183, 2020.

L. Li, J. Wang, and X. Li, “Efficiency Analysis of Machine Learning Intelligent Investment Based on K-Means Algorithm,†IEEE Access, vol. 8, pp. 147463–147470, 2020.

B. E. Ketherin, A. A. Arifiyanti, and A. Sodik, “ANALISA SEGMENTASI KONSUMEN MENGGUNAKAN ALGORITMA K-MEANS CLUSTERING,†Pros. Semin. Nas. Sains dan Teknol. Terap., pp. 51–58, 2018.

P. Govender and V. Sivakumar, Application of k-means and hierarchical clustering techniques for analysis of air pollution: a review (1980-2019). Turkish National Committee for Air Pollution Research and Control, 2019.

E. B. N. Arias, B. M. G. Nuñez, L. N. Fernández, and M. Jorge, “CRISP-DM and K-means neutrosophic in the analysis of risk factors for hearing loss in children . CRISP-DM y K-means neutrosofía en el análisis de factores de riesgo de pérdida de audición en niños .,†vol. 16, pp. 73–81, 2021.

K. Surya et al., “Model Klasifikasi Analisis Kepuasan Pengguna Perpustakaan Online Menggunakan K-Means dan Decission Tree,†vol. 8, no. 6, pp. 323–329, 2021.

K. Dhalmahapatra, R. Shingade, H. Mahajan, A. Verma, and J. Maiti, “Decision support system for safety improvement: An approach using multiple correspondence analysis, t-SNE algorithm and K-means clustering,†Comput. Ind. Eng., vol. 128, no. December 2018, pp. 277–289, 2019.

M. Y. Santos and C. Costa, Big Data: Concepts, Warehousing, and Analytics. River Publishers, 2020.

B. Balusamy, N. A. R, S. Kadry, and A. H. Gandomi, “Introduction to the World of Big Data,†in Big Data: Concepts, Technology, and Architecture, Wiley Telecom, 2021, pp. 1–29.

K. P. Sinaga and M. S. Yang, “Unsupervised K-means clustering algorithm,†IEEE Access, vol. 8, pp. 80716–80727, 2020.

J. C. Bezdek, Elementary Cluster Analysis: Four Basic Methods that (Usually) Work. River Publishers, 2022.

B. Balusamy, N. A. R, S. Kadry, and A. H. Gandomi, “Cluster Analysis,†in Big Data: Concepts, Technology, and Architecture, Wiley Telecom,pp. 259–292, 2021.

Nurhayati, T. S. Kania, L. K. Wardhani, N. Hakiem, Busman, and H. Maarif, “Big Data Technology for Comparative Study of K-Means and Fuzzy C-Means Algorithms Performance,†Proc. 2018 7th Int. Conf. Comput. Commun. Eng. ICCCE 2018, pp. 202–207, 2018.

M. Nishom, “Perbandingan Akurasi Euclidean Distance, Minkowski Distance, dan Manhattan Distance pada Algoritma K-Means Clustering berbasis Chi-Square,†J. Inform. J. Pengemb. IT, vol. 4, no. 1, pp. 20–24, 2019.

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).