OPTIMIZATION OF THE NUMBER OF CLUSTERS ON K-MEDOIDS USING CHEBYCHEV AND MANHATTAN ON GOLD SELLING GROUPING

Article Sidebar

PDF
Published: Jun 22, 2022
Keywords:
Chebychev Distance, Clustering, Data mining, K-Medoids, Manhattan Distance
Issue
Vol. 5 No. 3 (2021): November: Manajemen, Teknologi Informatika dan Komunikasi (Mantik)
Section
Computer Science
Statistics Article
Article View : 52 Times

Main Article Content

Dedi Triyanto
Universitas Bina Sarana Informatika
Deny Kurniawan
Universitas Bina Sarana Informatika
Mochamad Wahyudi
Universitas Bina Sarana Informatika

Abstract

Gold is a type of precious metal that can maintain value and can be used for exchange. Gold has attractive properties, so many people like to buy gold for jewelry and also for investments that can be resold when they need money quickly. During the COVID-19 pandemic, some sales sectors experienced a decline but gold was still selling well. M. Siregar Gold Shop serves gold jewelry sales. Gold jewelery sales transactions at the M. Siregar gold shop are stored in the database. Every day the transaction data is increasing, so the data is getting more and more. From the mountains of data we can dig up information or generate knowledge. M. Siregar's gold shop has difficulty in knowing the type of gold that is selling well, making it difficult for gold shop owners to determine the right gold supply. This study aims to classify gold sales at the M. Sisregar gold shop so that it is known which types of gold are selling well. This grouping uses the K-Medoids method with the calculation of the distance between the Chebychec distance and the Manhanttan distance. The data is taken from the sales of gold at the M. Siregar store from November 2021 to March 2022. To produce an optimal grouping, this grouping is tested with several number of clusters by calculating the distance between Chebycev distance and Manhattan distance by calculating the DBI value of each number of clusters. . The result of the optimal grouping of gold sales is the K-Medoids method with the calculation of the Chebycev distance with the number of clusters = 2 with DBI value = 0.024.ns.

Downloads

Download data is not yet available.

Article Details

How to Cite
Triyanto, D., Kurniawan, D. . and Wahyudi, . M. . (2022) “OPTIMIZATION OF THE NUMBER OF CLUSTERS ON K-MEDOIDS USING CHEBYCHEV AND MANHATTAN ON GOLD SELLING GROUPING ”, Jurnal Mantik, 5(3), pp. 2128-2136. Available at: https://iocscience.org/ejournal/index.php/mantik/article/view/2476 (Accessed: 2May2026).
References
[1] E. Schubert and PJ Rousseeuw, Fast and eager k-medoids clustering: O(k) runtime improvement of the PAM, CLARA, and CLARANS algorithms, vol. 101, no. 124020371. 2021. [2] D. Marlina, N. Lina, A. Fernando, and A. Ramadhan, "Implementation of K-Medoids and K-Means Algorithms for Grouping Distributed Areas of Disability in Children," J. CoreIT J. Has. researcher. Computer Science. and Technol. Inf., vol. 4, no. 2, p. 64, 2018. [3] Y. Effective, P. Pt, and A. Mine, “No Title,” vol. 4, no. 3, pp. 236–249, 2017. [4] RA Nisyah, N. Hidayat, and AA Supianto, "Forecasting Gold Jewelery Sales Results Using Exponential Smoothing Method (Case Study: Sumenep Gold Shop Rejeki Baru)," vol. 3, no. 7, pp. 7268–7274, 2019. [5] A. Lasisi, R. Ghazali, and T. Herawan, “Comparative Performance Analysis of Negative Selection Algorithm with Immune and Classification Algorithms,” Adv. Intell. syst. Comput., vol. 287, pp. 441–452, 2014. [6] RD Ramadhani and DJ Ak, “K-Means and K-Medoids Evaluation on Small Datasets,” Semin. Nas. information. and App., no. September, pp. 20–24, 2017. [7] D. Ayu, “Puskesmas Clustering in Kudus District Using the K-Means Method with a Comparison of Euclidean and Chebyshev Distances,” vol. 5, pp. 787–798, 2022. [8] W. Gie and D. Jollyta, "Comparison of Euclidean and Manhattan for Cluster Optimization Using the Davies Bouldin Index: Covid-19 Status in Riau Region," Pros. Semin. Nas. Ris. Dan Inf. science. 2020, vol. 2, no. April, pp. 187–191, 202

Copyright and Licensing
Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.