Penerapan Algoritma K-Medoids Untuk Clustering Prioritas Penerima Beasiswa


  • Agus Iskandar * Mail Universitas Nasional, Jakarta, Indonesia
  • (*) Corresponding Author
Keywords: Data Mining; Clustering; Priority; Receiver; Scholarship; K-Medoids

Abstract

Scholarships are a form of appreciation given to students. In college scholarships that are usually given are scholarships from foundations. The limited number of foundation scholarships provided by tertiary institutions is certainly a separate problem for elements of leadership or management. The problems encountered must be resolved as well as possible. Therefore, it is necessary to group students who are prioritized to get foundation scholarships. The process of determining priority levels for students receiving foundation scholarships has become a new problem for the management team. The process of solving the problem can be done by processing the data. Data mining is a data processing process for extracting information stored in datasets. In data mining, the process of grouping data for the priority determination process is included in the clustering technique. K-Medoids is part of clustering data mining. K-Medoids is used in data mining for the grouping process in forming clustering. The K-Medoids algorithm can help simplify the process of forming priority clusters. In this case there are 5 alternatives included in Cluster 1 and 5 alternatives included in Cluster 2. With the formation of clusters from the K-Medoids algorithm process it can be easily in the decision making process.

Downloads

Download data is not yet available.

References

R. N. H. Hutasuhut, H. Okprana, and B. E. Damanik, “Penerapan Data Mining Untuk Menentukan Penerima Program Bidikmisi Menggunakan Algoritma K-Medoids,” TIN Terap. Inform. Nusant., vol. 2, no. 11, pp. 667–672, 2022, doi: 10.47065/tin.v2i11.1516.

W. Susanto and A. Mulyani, “Analisa Algoritma C4. 5 Terhadap Penentuan Rekomendasi Penerima Beasiswa,” OKTAL J. Ilmu Komput. dan Sci., vol. 99, no. 99, pp. 1607–1613, 2022, [Online]. Available: https://journal.mediapublikasi.id/index.php/oktal/article/view/1034%0Ahttps://journal.mediapublikasi.id/index.php/oktal/article/download/1034/495.

S. Chodijah and M. Iqbal, “ENENTUAN PENERIMA BEASISWA DI STMIK BANI SALEH DENGAN PERBANDINGAN METODE ALGORITMA C4.5 DAN KNEAREST NEIGHBORS,” J. Inf. dan Komput. Vol, vol. 10, no. 1, 2022.

D. J. Lubis and M. B. Tamam, “Penerapan K-Means Untuk Pengelompokkan Beasiswa Santri di Pondok Pesantren Miftahul Huda Bogor,” Teknois J. Ilm. Teknol. Inf. dan Sains, vol. 12, no. 1, pp. 7–20, 2022, doi: 10.36350/jbs.v12i1.125.

S. A. Rahmah and J. Antares, “Klasterisasi Seleksi Mahasiswa Calon Penerima Beasiswa Yayasan Menggunakan K-Means Clustering,” I N F O R M a T I K a, vol. 13, no. 2, p. 25, 2022, doi: 10.36723/juri.v13i2.282.

Gagan Suganda, Marsani Asfi, Ridho Taufiq Subagio, and Ricky Perdana Kusuma, “Penentuan Penerima Bantuan Beasiswa Kartu Indonesia Pintar (Kip) Kuliah Menggunakan Naïve Bayes Classifier,” JSiI (Jurnal Sist. Informasi), vol. 9, no. 2, pp. 193–199, 2022, doi: 10.30656/jsii.v9i2.4376.

U. R. Amanda and D. P. Utomo, “Penerapan Data Mining Algoritma Hash Based Pada Data Pemesanan Buah Impor Cv. Green Uni Fruit,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 5, no. 1, 2021.

D. P. Indini, S. R. Siburian, and D. P. Utomo, “Implementasi Algoritma DBSCAN untuk Clustering Seleksi Penentuan Mahasiswa yang Berhak Menerima Beasiswa Yayasan,” in Prosiding Seminar Nasional Sosial, Humaniora, dan Teknologi, 2022, pp. 325–331.

D. P. Utomo and S. Aripin, “Penerapan Algoritma C5 . 0 Untuk Mengetahui Pola Kepuasan Mahasiswa di Masa Pembelajaran Daring,” in Seminar Nasional Riset Dan Information Science (SENARIS), 2021, vol. 3, pp. 7–12.

Dwita Elisa Sinaga, Agus Perdana Windarto, and Rizki Alfadillah Nasution, “Analisis Data Mining Algoritma Decision Tree Pada Prediksi Persediaan Obat (Studi Kasus : Apotek Franch Farma),” KLIK Kaji. Ilm. Inform. dan Komput., vol. 2, no. 4, pp. 123–131, 2022, doi: 10.30865/klik.v2i4.328.

M. Y. Putra and D. I. Putri, “Pemanfaatan Algoritma Naïve Bayes dan K-Nearest Neighbor Untuk Klasifikasi Jurusan Siswa Kelas XI,” J. Tekno Kompak, vol. 16, no. 2, pp. 176–187, 2022.

I. Zuhdi, “Data Mining menggunakan Metode Rough Set dalam Memprediksi Tingkat Penjualan Peralatan Komputer,” J. Inform. Ekon. Bisnis, vol. 4, pp. 142–147, 2022, doi: 10.37034/infeb.v4i4.159.

A. Anggraini and L. Sianturi, “Implementasi Data Mining Algoritma Hash-Based Untuk Mengetahui Frekuensi Itemset Penjualan Alat-Alat Listrik ( Studi Kasus : PT . Asia Sinar Inti Abadi ),” Inf. dan Teknol. Ilm., vol. 9, no. 2, pp. 36–40, 2022.

L. S. Nasution, W. R. Maya, and F. Sonata, “Data Mining Untuk Menganalisa Pola Pembelian Perak Dengan Menggunakan Algoritma Fp-Growth Pada Toko Emas Dan Perak Adi Saputra Tanjung,” pp. 1–12, 2020.

Y. Andini, J. T. Hardinata, and Y. P. Purba, “Penerapan Data Mining pada Tata Letak Buku Di Perpustakaan Sintong Bingei Pematangsiantar dengan Metode Apriori,” Jurasik (Jurnal Ris. Sist. Inf. dan Tek. Inform., vol. 7, no. 1, p. 13, 2022, doi: 10.30645/jurasik.v7i1.410.

S. D. Nirwana, M. I. Jambak, and A. Bardadi, “Perbandingan Algoritma K-Means Dan K-Medoids Dalam Clustering Rata-Rata Penambahan Kasus Covid-19 Berdasarkan Kota/Kabupaten Di Provinsi Sumatera Selatan,” JSiI (Jurnal Sist. Informasi), vol. 9, no. 2, pp. 126–131, 2022, doi: 10.30656/jsii.v9i2.5127.

F. Faisal, L. A. Giopani, M. Fitriah, Z. C. Dwynne, and S. Syahidatul, “Comparison of K-Means and K-Medoids Algorithms for Temperature Grouping in Riau Province Perbandingan Algoritma K-Means dan K-Medoids Untuk Pengelompokan Suhu di Provinsi Riau,” IJIRSE Indones. J. Inform. Res. Softw. Eng., vol. 2, no. 2, pp. 128–134, 2022.

R. K. Purba and E. Bu’ulolo, “Implementasi Algoritma K-Medoids dalam Pengelompokan Mahasiswa yang Layak Mendapat Bantuan Uang Kuliah Tunggal,” INSOLOGI J. Sains dan Teknol., vol. 1, no. 2, pp. 79–86, 2022, doi: 10.55123/insologi.v1i2.195.

D. R. Agustian and B. A. Darmawan, “Analisis Clustering Demam Berdarah Dengue Dengan Algoritma K-Medoids (Studi Kasus Kabupaten Karawang),” JIKO (Jurnal Inform. dan Komputer), vol. 6, no. 1, p. 18, 2022, doi: 10.26798/jiko.v6i1.504.

F. Y. Rahman, I. I. Purnomo, and N. Hijriana, “PENERAPAN ALGORITMA DATA MINING UNTUK KLASIFIKASI KUALITAS AIR,” Technologia, vol. 13, no. 3, pp. 228–232, 2022.

S. Ucha Putri, E. Irawan, and F. Rizky, “Implementasi Data Mining Untuk Prediksi Penyakit Diabetes Dengan Algoritma C4.5,” Januari, vol. 2, no. 1, pp. 39–46, 2021.


Bila bermanfaat silahkan share artikel ini

Berikan Komentar Anda terhadap artikel Penerapan Algoritma K-Medoids Untuk Clustering Prioritas Penerima Beasiswa

Dimensions Badge
Article History
Submitted: 2023-01-15
Published: 2023-01-29
Abstract View: 1163 times
PDF Download: 702 times
How to Cite
Iskandar, A. (2023). Penerapan Algoritma K-Medoids Untuk Clustering Prioritas Penerima Beasiswa. Journal of Information System Research (JOSH), 4(2), 508-514. https://doi.org/10.47065/josh.v4i2.2927
Section
Articles

Most read articles by the same author(s)

1 2 3 > >>