Manhattan Metric Technique in K-Means Clustering for Data Grouping

Authors

Pages Icon

DOI:

https://doi.org/10.51519/journalisi.v6i3.841

Keywords:

K-Means, Manhattan Distance, Elbow Method, Davies Bouldin Index

Abstract

Clustering can be defined as a method commonly applied in data mining to group objects into clusters. Clusters consist of data objects that are similar to each other in a group but different from objects in other clusters. In this study, the data used is the data of KIP scholarship recipients for the 2016-2023 period. Various clustering metric measurement techniques have been frequently used by researchers, especially those focusing on distance and similarity metrics, such as Euclidean Distance, Manhattan, and Minkowski. In general, K-Means is an unsupervised learning method used in the clustering process to group data based on similarity. The elbow method is used to determine the optimal number of clusters, so that the clustering results obtained can be maximized to achieve better results. This study aims to analyze the use of Manhattan technique in K-Means clustering for data grouping. The research problem is how to analyze the Manhattan metric technique in K-Means clustering for effective data grouping. Applying the K-Means method shows that the existing data is successfully divided into four specified clusters. After determining the correct number of clusters, the K-Means method is used to sort the data in the dataset. From 3172 data, the final results obtained cluster 0 as many as 774 data, cluster 1 as many as 417 data, cluster 2 as many as 1244 data, and cluster 3 as many as 737 data. The results of the clustering process obtained a davies-bouldin index value of 1.4568.

Downloads

Download data is not yet available.

References

M.J. Nurul Rohmawati and S. Defiyanti, "Implementation of K-Means Algorithm in Clustering Scholarship Applicants," Jitter, vol. 1, no. 2, pp. 62–68, 2015.

Y. Heryadi and E. Irwansyah, Deep Learning: Its Application in Geospatial Field, PT. Artifisia Wahana Informa Teknologi, 2020.

M.A. Hakim and I. N. Alam, "A Comparative Study of Clustering Techniques in Data Mining: K-Means, DBSCAN, and Hierarchical Clustering," Int. J. Adv. Comput. Sci. Appl., vol. 9, no. 12, pp. 275–283, 2018, doi: 10.14569/IJACSA.2018.091236.

S.A. Rahmah and J. Antares, "Clusterization of Student Selection Candidates for Scholarship Recipients from the Foundation Using K-Means Clustering," INFORM., vol. 13, no. 2, p. 25, 2022, doi: 10.36723/juri.v13i2.282.

M.S. Pangestu and M.A. Fitriani, "Comparison of Euclidean Distance, Manhattan Distance, and Cosine Similarity Calculations in Rice Seed Data Clustering Using the K-Means Algorithm," Sainteks, vol. 19, no. 2, p. 141, 2022, doi: 10.30595/sainteks.v19i2.14495.

M. Nishom, "Comparison of Accuracy of Euclidean Distance, Minkowski Distance, and Manhattan Distance on Chi-Square Based K-Means Clustering Algorithm," J. Inform.: J. Pengemb. IT, vol. 4, no. 1, pp. 20–24, 2019, doi: 10.30591/jpit.v4i1.1253.

N. Syahfitri, E. Budianita, A. Nazir, and I. Afrianty, "Product Grouping Based on Inventory Data Using the Elbow and K-Medoid Methods," KLIK Kajian Ilm. Inform. Komput., vol. 4, no. 3, pp. 1668–1675, 2023, doi: 10.30865/klik.v4i3.1525.

R.F.N. Alifah and A.C. Fauzan, "Implementation of K-Means Clustering Algorithm Based on Manhattan Distance for Clustering of Student Field Concentration," Ilk. J. Comput. Sci. Appl. Inform., vol. 5, no. 1, pp. 31–41, 2023, doi: 10.28926/ilkomnika.v5i1.542.

W. Wahyu Pribadi, A. Yunus, and A.S. Wiguna, "Comparison of K-Means Euclidean Distance and Manhattan Distance Methods in Determining Covid-19 Zoning in Malang Regency," JATI, vol. 6, no. 2, pp. 493–500, 2022, doi: 10.36040/jati.v6i2.4808.

N. Puspitasari, H. Haviluddin, and F.U.J. Helmi Puadi, "Clusterization of Pepper Plant Producing Areas Using the K-Means Algorithm," Indones. J. Comput. Sci., vol. 11, no. 3, pp. 1001–1013, 2022, doi: 10.33022/ijcs.v11i3.3104.

R. Syahputra and E. Bu'ulolo, "Determination of Students Receiving Single Tuition Assistance with K-NN," J. Eksplora Inform., vol. 13, no. 1, pp. 46–54, 2023, doi: 10.30864/eksplora.v13i1.797.

Downloads

Published

2024-09-24

Issue

Vol. 6 No. 3 (2024): September

Section

Articles

License

Authors Declaration

  1. The Authors certify that they have read, understood, and agreed to the Journal of Information Systems and Informatics (JournalISI) submission guidelines, policies, and submission declaration. The submission has been prepared using the provided template.
  2. The Authors certify that all authors have approved the publication of this manuscript and that there is no conflict of interest.
  3. The Authors confirm that the manuscript is their original work, has not received prior publication, is not under consideration for publication elsewhere, and has not been previously published.
  4. The Authors confirm that all authors listed on the title page have contributed significantly to the work, have read the manuscript, attest to the validity and legitimacy of the data and its interpretation, and agree to its submission.
  5. The Authors confirm that the manuscript is not copied from or plagiarized from any other published work.
  6. The Authors declare that the manuscript will not be submitted for publication in any other journal or magazine until a decision is made by the journal editors.
  7. If the manuscript is finally accepted for publication, the Authors confirm that they will either proceed with publication immediately or withdraw the manuscript in accordance with the journal’s withdrawal policies.
  8. The Authors agree that, upon publication of the manuscript in this journal, they transfer copyright or assign exclusive rights to the publisher, including commercial rights

How to Cite

[1]
M. Sari and A. Armansyah, “Manhattan Metric Technique in K-Means Clustering for Data Grouping”, journalisi, vol. 6, no. 3, pp. 1945–1961, Sep. 2024, doi: 10.51519/journalisi.v6i3.841.