Peningkatan Minat Digital Skill Menggunakan Algoritma K-Medoids Clustering Pada Karyawan
Abstract
General Company for Printing Money of the Republic of Indonesia is one of the state-owned enterprises that prints banknotes and other official documents. Perum Peruri also wishes to gain more insight into the technology implemented in the company. The demand for a workforce skilled in the use of technology in the work environment continues to increase over time. Perum Peruri has 16 Digital Skill categories, each of these categories has a high, medium to the lowest interest. In this problem, the data taken has not been grouped, so there is a lack of information about the number of categories that have the highest to lowest interest. By analyzing the specialization data, it will help determine which categories need improvement. The categories in Digital Skills specialization can then be improved by using this information as a reference for designing improvement strategies. Research was conducted using clustering to determine the number of categories that Perum Peruri personnel are interested in. In this study, sales data in Excel format was analyzed, and clusters based on product sales data were created using the K-Medoids approach. Sales information obtained from secondary data that manages employee specialization. Using RapidMiner, the accuracy for the three clusters designated as highest, middle, and lowest based on the clustering results was ascertained. The first cluster of 16 items analyzed consisted of 7 items with the highest ranking, the second cluster had 5 items categorized as medium, and the third cluster had 4 items classified as the lowest. Based on the results, 4 items were categorized as low, indicating the need for a socialization approach to increase interest in the Digital Skill.
Downloads
References
S. S. Hilabi, “TechnoXplore Jurnal Ilmu Komputer & Teknologi Informasi ISSN: 2503-054X Vol 4 No: 1, April 2019,” J. Ilmu Komput. Teknol. Inf, vol. 4, no. 1, pp. 28–37, 2019.
L. A. Adha, “Digitalisasi Industri Dan Pengaruhnya Terhadap Ketenagakerjaan Dan Hubungan Kerja Di Indonesia,” J. Kompil. Huk., vol. 5, no. 2, pp. 267–298, 2020, doi: 10.29303/jkh.v5i2.49.
D. Gustian and M. S. Al-Farits, “Data Mining Untuk Melihat Minat Belajar Siswa Menerapkan Metode K-Means,” J. Inf. Syst. Res., vol. 4, no. 3, pp. 775–784, 2023, doi: 10.47065/josh.v4i3.3218.
A. I. Rasidi and N. G. Ramadhan, “Perancangan Website Company Profile Perusahaan CV. CUP10INDO Menggunakan Metode Design Thinking,” KLIK Kaji. Ilm. Inform. dan Komput. , vol. 3, no. 5, pp. 457–465, 2023, [Online]. Available: https://djournals.com/klik
Normah, B. Rifai, S. Vambudi, and R. Maulana, “Analisa Sentimen Perkembangan Vtuber Dengan Metode Support Vector Machine Berbasis SMOTE,” J. Tek. Komput. AMIK BSI, vol. 8, no. 2, pp. 174–180, 2022, doi: 10.31294/jtk.v4i2.
S. N. Adila and N. Aziz, “Pengaruh Strategi Promosi terhadap Keputusan Pembelian yang dimediasi oleh minat beli pada konsumen Restoran KFC cabang khatib Sulaiman Padang,” 2019.
A. Z. Kamalia, E. A. Pradana, and N. Surojudin, “Penerapan Algoritma K-Means Dalam Klasterisasi Penjualan Laptop,” J. SIGMA, vol. 1, no. 1, pp. 147–158, 2022, [Online]. Available: https://jurnal.pelitabangsa.ac.id/index.php/sigma/article/view/1440
S. F. Mulaki, N. Setiyawati, and A. F. Wijaya, “Analisis Data Mahasiswa Menggunakan Algoritma K-Means Clustering sebagai Dasar Pelaksana Promosi,” JBASE - J. Bus. Audit Inf. Syst., vol. 1, no. 2, pp. 30–39, 2018, doi: 10.30813/.v1i2.1259.
A. Agneresa, A. L. Hananto, S. S. Hilabi, A. Hananto, and T. Tukino, “Strategi Promosi Penerapan Data Mining Mahasiswa Baru Dengan Metode K-Means Clustering,” Dirgamaya J. Manaj. dan Sist. Inf., vol. 2, no. 2, pp. 25–34, 2022, doi: 10.35969/dirgamaya.v2i2.275.
R. Adrianto and A. Fahmi, “Penerapan Metode Clustering Dengan Algoritma K-Means Untuk Rekomendasi Pemilihan Jalur Peminatan Sesuai Kemampuan Pada Progam Studi Teknik Informatika - S1 Universitas Dian Nuswantoro,” JOINS (Journal Inf. Syst., vol. 1, no. 2, pp. 101–116, 2019, [Online]. Available: http://publikasi.dinus.ac.id/index.php/joins/article/view/1302
A. Lia Hananto et al., “Analysis of Drug Data Mining with Clustering Technique Using K-Means Algorithm,” J. Phys. Conf. Ser., vol. 1908, no. 1, 2021, doi: 10.1088/1742-6596/1908/1/012024.
A. Aditya, I. Jovian, and B. N. Sari, “Implementasi K-Means Clustering Ujian Nasional Sekolah Menengah Pertama di Indonesia Tahun 2018/2019,” J. Media Inform. Budidarma, vol. 4, no. 1, p. 51, 2020, doi: 10.30865/mib.v4i1.1784.
S. Nuraini, I. Gunawan, and W. Saputra, “Utilization of K-Medoids Algorithm for Klustering of Oil Palm Sprouts,” JOMLAI J. Mach. Learn. Artif. Intell., vol. 1, no. 1, pp. 11–22, 2022, doi: 10.55123/jomlai.v1i1.160.
A. E. Wijaya, R. Bani, S. Sukarni, and S. A. Weighting, “Jurnal Teknologi Informasi dan Komunikasi STMIK Subang, Oktober 2019 ISSN: 2252-4517,” no. April, pp. 100–110, 2019.
F. Hardiyanti, H. S. Tambunan, and I. S. Saragih, “Penerapan Metode K-Medoids Clustering Pada Penanganan Kasus Diare Di Indonesia,” KOMIK (Konferensi Nas. Teknol. Inf. dan Komputer), vol. 3, no. 1, pp. 598–603, 2019, doi: 10.30865/komik.v3i1.1666.
D. A. Silitonga, A. P. Windarto, D. Hartama, and Sumarno, “Penerapan Metode K-Medoid pada Pengelompokan Rumah Tangga Dalam Perlakuan Memilah Sampah Menurut Provinsi,” Semin. Nas. Sains Teknol. Inf. SENSASI 2019 ISBN, vol. 2, pp. 313–318, 2019.
S. Nasional, I. Teknologi, F. A. Bramasta, R. Helilintar, T. Informatika, and F. Teknik, “Penerapan Data Mining Untuk Menentukan Strategi Penjualan Toko Sepatu,” pp. 236–241, 2021.
R. Gustrianda and D. I. Mulyana, “Penerapan Data Mining Dalam Pemilihan Produk Unggulan dengan Metode Algoritma K-Means Dan K-Medoids,” J. Media Inform. Budidarma, vol. 6, no. 1, p. 27, 2022, doi: 10.30865/mib.v6i1.3294.
A. Octa Fadilah, B. Huda, and A. Hananto, “Strategi Promosi untuk Meningkatkan Penjualan Kedai Kopi Desimal Menggunakan Algoritma K-Medoids Clustering,” J. Ris. Komputer), vol. 10, no. 1, pp. 2407–389, 2023, doi: 10.30865/jurikom.v10i1.5561.
Didik maulana and S. Sundari, “Penerapan Algoritma K-Medoids Dalam Klasterisasi Penyebaran,” no. 1, pp. 51–59, 2022.
T. Widyanti, S. S. Hilabi, A. Hananto, Tukino, and E. Novalia, “Implementasi K-Means dan K-Nearest Neighborspada Kategori Siswa Berprestasi,” J. Inf. dan Teknol., vol. 5, no. 1, pp. 75–82, 2023, doi: 10.37034/jidt.v5i1.255.
D. Jollyta, W. Ramdhan, and M. Zarlis, Konsep Data Mining Dan Penerapan. Deepublish, 2020.
E. Buulolo, Data Mining Untuk Perguruan Tinggi. Deepublish, 2020.
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.
P. A. Kusuma and A. U. Firmansyah, “Deteksi Penyebaran Penyakit Tuberkulosis dengan Algoritma K-Means Clustering Menggunakan Rapid Miner,” J. Teknol. Inform. dan Komput., vol. 8, no. 2, pp. 41–54, 2022, doi: 10.37012/jtik.v8i2.1173.
C. Nas, “Data Mining Pengelompokan Bidang Keahlian Mahasiswa Menggunakan Algoritma K-Means (Studi Kasus: Universitas Cic Cirebon),” Syntax J. Inform., vol. 9, no. 1, pp. 1–14, 2020.
Bila bermanfaat silahkan share artikel ini
Berikan Komentar Anda terhadap artikel Peningkatan Minat Digital Skill Menggunakan Algoritma K-Medoids Clustering Pada Karyawan
Pages: 811-818
Copyright (c) 2024 Rizka Zulfiana, Shofa Shofiah Hilabi, Fitria Nurapriani, Baenil Huda

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






















