Penerapan Data Mining Untuk Menentukan Penerima Program Bidikmisi Menggunakan Algoritma K-Medoids
-
Riski Nabila Hasanah Hutasuhut
*
STIKOM Tunas Bangsa, Pematangsiantar,
Indonesia
- Harly Okprana STIKOM Tunas Bangsa, Pematangsiantar, Indonesia
- Bahrudi Efendi Damanik AMIK Tunas Bangsa, Pematangsiantar, Indonesia (*) Corresponding Author
Abstract
Bidikmisi scholarship is a program that facilitates prospective students who have good academic achievements but lack in economics to be able to receive quality education by receiving various facilities. The distribution of Bidik Misi scholarships to students who come from underprivileged families must go through a selection involving certain criteria. The criteria are: parents' income, parent's occupation, number of dependents, and home ownership. To make it easier to determine prospective students who receive Bidikmisi, the K-Medoids algorithm is used. The K-Medoids algorithm is one of the algorithms in data mining to group data based on the closest criteria values.
Downloads
References
I. Parlina, A. P. Windarto, A. Wanto, and M. R. Lubis, “MEMANFAATKAN ALGORITMA K-MEANS DALAM MENENTUKAN PEGAWAI YANG LAYAK MENGIKUTI ASESSMENT CENTER UNTUK CLUSTERING PROGRAM SDP,” CESS (Journal Comput. Eng. Syst. Sci., vol. 3, no. 1, pp. 87–93, 2018.
E. Buulolo, Data Mining Untuk Perguruan Tinggi. Deepublish, 2020.
D. Nofriansyah and G. W. Nurcahyo, Algoritma Data Mining Dan Pengujiannya. Yogyakarta: Deepublish, 2017.
D. N. Batubara and A. P. Windarto, “Analisa Klasifikasi Data Mining Pada Tingkat Kepuasan Pengunjung Taman Hewan Pematang Siantar Dengan Algoritma,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 3, no. 1, pp. 588–592, 2019.
S. R. Ningsih, I. S. Damanik, A. P. Windarto, H. S. Tambunan, J. Jalaluddin, and A. Wanto, “Analisis K-Medoids Dalam Pengelompokkan Penduduk Buta Huruf Menurut Provinsi,” Pros. Semin. Nas. Ris. Inf. Sci., vol. 1, no. September, p. 721, 2019.
M. Mesran et al., Sistem Pendukung Keputusan & Data Mining. 2020.
F. Harahap, “Perbandingan Algoritma K Means dan K Medoids Untuk Clustering Kelas Siswa Tunagrahita,” TIN Terap. Inform. Nusant., vol. 2, no. 4, pp. 191–197, 2021.
Z. Mustofa and I. S. Suasana, “Algoritma Clustering K-Medoids pada E-Goverment Bidang Information and Communication Technologi Dalam Penentuan Status Edgi,” J. Teknol. Inf. dan Komun., vol. 9, no. 1, pp. 1–10, 2018.
E. Buulolo, R. Syahputra, and A. Fau, “Algoritma K-Medoids Untuk Menentukan Calon Mahasiswa Yang Layak Mendapatkan Beasiswa Bidikmisi di Universitas Budi Darma,” J. Media Inform. Budidarma, vol. 4, no. 3, p. 797, 2020.
C. Astria, A. P. Windarto, D. Hartama, P. Studi, and S. Informasi, “PENERAPAN K-MEDOID PADA RUMAH TANGGA YANG MEMILIKI SUMBER,” vol. 3, pp. 604–609, 2019.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Penerapan Data Mining Untuk Menentukan Penerima Program Bidikmisi Menggunakan Algoritma K-Medoids
Pages: 667-672
Copyright (c) 2022 Riski Nabila Hasanah Hutasuhut, Harly Okprana, Bahrudi Efendi Damanik
This work is licensed under a Creative Commons Attribution 4.0 International License.
Authors who publish with this journal agree to the following terms:
- 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.
- 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.
- 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).
