Clustering of Screw Press Machine Conditions using the K-Medoids Method
Downloads
The screw press plays an important role in the oil extraction process; thus, monitoring its condition is essential to maintain performance and prevent failures. This study aims to cluster screw press machine conditions using the K-Medoids method. The dataset consisted of 23,002 records from PT. XYZ was collected in April–May 2024 with two attributes: temperature and pressure. The data was processed through selection, pre-processing, and transformation stages using z-score normalization before clustering. Model evaluation employed the Silhouette Coefficient and the Davies-Bouldin Index (DBI). The results show that the best configuration was at K = 7, with a Silhouette value of 0.5494 and a DBI of 0.5521, indicating a reasonable structure and good separation. Thus, the K-Medoids method has been proven effective in clustering screw press machine conditions and useful in supporting machine maintenance decision-making.
В. М. Корендій and В. Б. Гавран, “Analysis of the oil extraction process and prospects of automation of screw press operation,” Sci. Bull. UNFU, vol. 34, no. 1, pp. 85–90, 2024, doi: 10.36930/40340112.
F. Pohan, I. Saputra, and R. Tua, “Scheduling Preventive Maintenance to Determine Maintenance Actions on Screw Press Machine,” J. Ris. Ilmu Tek., vol. 1, no. 1, pp. 1–12, 2023,
doi: 10.59976/jurit.v1i1.4.
S. Yasir and A. Saputra, “Analisa Reliability Dan Availability Mesin Screw Press Kelapa Sawit (Studi Kasus di PT. Ujong Neubok Dalam),” Unistek, vol. 9, no. 2, pp. 83–94, 2022, [Online]. Available: http://ejournal.unis.ac.id/index.php/UNISTEK
I. Anwar, A. Afdal, D. Denur, and D. Dermawan, “Analisis Penyebab Kerusakan Hub Screw Press dan Optimasi Teknik Pemeliharaan Terhadap Mesin Pabrik Pengolahan Kelapa Sawit,” J. Surya Tek., vol. 10, no. 1, pp. 733–737, 2023,
doi: 10.37859/jst.v10i1.5003.
C. Tortora and F. Palumbo, “Clustering mixed-type data using a probabilistic distance algorithm[Formula presented],” Appl. Soft Comput., vol. 130, p. 109704, 2022,
doi: 10.1016/j.asoc.2022.109704.
S. Elkateb, A. Métwalli, A. Shendy, and A. E. B. Abu-Elanien, “Machine learning and IoT – Based predictive maintenance approach for industrial applications,” Alexandria Eng. J., vol. 88, no. January, pp. 298–309, 2024,
doi: 10.1016/j.aej.2023.12.065.
M. R. Karim et al., “Deep learning-based clustering approaches for bioinformatics,” Brief. Bioinform., vol. 22, no. 1, pp. 393–415, Jan. 2021,
doi: 10.1093/bib/bbz170.
J. Jasril, M. F. Al Fiqri, S. Sanjaya, L. Handayani, and F. Insani, “Pengelompokan Data Kondisi Mesin Screw Press Menggunakan Algoritma Fuzzy C-Means,” Inf. Syst. J., vol. 8, no. 01, pp. 60–70, 2025, doi: 10.24076/infosjournal.2025v8i01.2133.
F. K. Rahman, J. S. Sanjaya, L. Handayani, and F. Insani, “Penerapan Algoritma K-Means Clustering pada Kinerja Mesin Screw press,” Bull. Inf. Technol., vol. 6, no. 2, pp. 59–70, 2025,
doi: 10.47065/bit.v5i2.1783.
N. Sureja, B. Chawda, and A. Vasant, “An improved K-medoids clustering approach based on the crow search algorithm,” J. Comput. Math. Data Sci., vol. 3, no. July 2021, p. 100034, 2022,
doi: 10.1016/j.jcmds.2022.100034.
A. Sobrinho Campolina Martins, L. Ramos de Araujo, and D. Rosana Ribeiro Penido, “K-Medoids clustering applications for high-dimensionality multiphase probabilistic power flow,” Int. J. Electr. Power Energy Syst., vol. 157, no. February, 2024, doi: 10.1016/j.ijepes.2024.109861.
Alfia Nurlaili Tahiyat, Bima Maulana, Ade Eka Saputra, Lusiana Efrizoni, and Rahmaddeni Rahmaddeni, “Klasterisasi Lagu Populer dan Eksplorasi Subgenre Spotify 2024 dengan K-Medoids,” J. Inform. Dan Tekonologi Komput., vol. 5, no. 1, pp. 34–48, 2025,
doi: 10.55606/jitek.v5i1.5699.
J. Inayah, A. Fanani, and W. D. Utami, “Klasterisasi Data Kejadian Gempa Bumi di Indonesia Menggunakan Metode K-Medoids,” J. Sist. dan Teknol. Inf., vol. 12, no. 2, p. 271, 2024,
doi: 10.26418/justin.v12i2.73594.
M. Minarni, M. Mahendra, A. Anisya, D. W. T. Putra, G. Y. Swara, and I. Warman, “Klasterisasi Wilayah Rawan Kekerasan Anak Menggunakan Algoritma k-Medoids di Kota Padang,” J. Minfo Polgan, vol. 13, no. 2, pp. 2309–2319, 2025,
doi: 10.33395/jmp.v13i2.14447.
D. Sitanggang, M. Kom, and A. Apriori, Buku Monograf Algoritma Apriori. 2023.
S. E. Saqila, I. P. Ferina, and A. Iskandar, “Analisis Perbandingan Kinerja Clustering Data Mining Untuk Normalisasi Dataset,” J. Sist. Komput. dan Inform., vol. 5, no. 2, p. 356, 2023,
doi: 10.30865/json.v5i2.6919.
E. Herman, K. E. Zsido, and V. Fenyves, “Cluster Analysis with K-Mean versus K-Medoid in Financial Performance Evaluation,” Appl. Sci., vol. 12, no. 16, 2022, doi: 10.3390/app12167985.
U. Linarti, A. Rahmawati, A. Hendri Soleliza Jones, L. Zahrotun, and U. Ahmad Dahlan, “Penerapan Metode K-Medoids Guna Pengelompokan Data Usaha Mikro, Kecil dan Menengah (UMKM) Bidang Kuliner Di Kota Yogyakarta,” J. Ilmu Komput. dan Sist. Inf., vol. 7, no. 1, pp. 37–45, 2024.
K. Dbscan and Y. Hasan, “Pengukuran Silhouette Score dan Davies-Bouldin Index pada Hasil Cluster K-Means dan DBSCAN,” vol. 06, no. 01, pp. 60–74, 2024.
H. Henderi et al., “Optimization of Davies-Bouldin Index with k-medoids algorithm,” AIP Conf. Proc., vol. 3065, no. 1, 2024, doi: 10.1063/5.0225220.
M. D. Kartikasari, “Self-Organizing Map Menggunakan Davies-Bouldin Index dalam Pengelompokan Wilayah Indonesia Berdasarkan Konsumsi Pangan,” Jambura J. Math., vol. 3, no. 2, pp. 187–196, 2021, doi: 10.34312/jjom.v3i2.10942.
