Rekomendasi Strategi Sosialisasi Program Studi Melalui Jalur Undangan Menggunakan Algoritma ID3 dan K-Means

Main Article Content

Muhammad Azhar Hairudin Hazriani Zainuddin Yuyun Wabula


Based on data obtained from SPAN-PTKIN registrants in 2018 and 2019, the number of interested people through the invitation path who chose the study program at UIN Alauddin as the first choice was 30523 records. Analysis using the ID3 algorithm found that those who interested in the study of religions were more dominant from vocational students. While analysis using the K-Means shows the regions / regencies from which those interested in study programs of religions are spread in 35 regencies / cities. It can be concluded that the socialization of study programs of religions through the invitation path is recommended to be more focused on SMAs that are located in 33 districts / cities as identified in cluster 3. The study programs of religions are prioritized, because these study programs experienced the lowest number of registrants. It is expected that by implementing this recommended strategy, the number of interested prospective new students will draw a significant increase in the future.


Download data is not yet available.

Article Details

How to Cite
Hairudin, M., Zainuddin, H., & Wabula, Y. (2022, March 31). Rekomendasi Strategi Sosialisasi Program Studi Melalui Jalur Undangan Menggunakan Algoritma ID3 dan K-Means. JITCE (Journal of Information Technology and Computer Engineering), 6(01), 14-18.


[1] H. Muttaqien, M. Lutfi, M. KH, A. Muis, and H. Zainuddin, “Recommendation of Student Admission Priorities Using K-Means Clustering,” in Proceedings of the 1st International Conference on Science and Technology, ICOST 2019, 2-3 May, Makassar, Indonesia, 2019.
[2] N. Bahar, “Tutup Tahun 2018, UIN Alauddin Makassar Raih Akreditasi A - UIN Alauddin Makassar,” UIN Alauddin, 21-Dec-2018. [Online]. Available: [Accessed: 29-May-2020].
[3] “KBBI Daring.” [Online]. Available: [Accessed: 30-May-2020].
[4] I. H. Witten, E. Frank, and M. A. Hall, Data Mining (Fourth Edition). 2017.
[5] A. Berson and S. J. Smith, Data warehousing, data mining, and OLAP. McGraw-Hill, Inc., 1997.
[6] D. T. Larose and C. D. Larose, Discovering knowledge in data: an introduction to data mining, vol. 4. John Wiley & Sons, 2014.
[7] S. Yang, J.-Z. Guo, and J.-W. Jin, “An improved Id3 algorithm for medical data classification,” Comput. Electr. Eng., vol. 65, Aug. 2017.
[8] H. He and Y. Tan, “Neurocomputing A two-stage genetic algorithm for automatic clustering,” Neurocomputing, vol. 81, pp. 49–59, 2012.
[9] W. Xiang, N. Zhu, S. Ma, X. Meng, and M. An, “A dynamic shuffled differential evolution algorithm for data clustering,” Neurocomputing, vol. 158, pp. 144–154, 2015.
[10] J. Han and M. Kamber, “Data Mining: Concepts and Techniques 2nd Edition, Second Edi.” San Francisco: Elsevier, 2006.