Comparison of K-Means, BIRCH and Hierarchical Clustering Algorithms in Clustering OCD Symptom Data
Public Research Journal of Engineering, Data Technology and Computer Science · 2024
DOI: 10.57152/predatecs.v1i2.1106 ↗Kurz gefasst
Fachartikel in der Zeitschrift Public Research Journal of Engineering, Data Technology and Computer Science, 2024. Verfasst von Alika Rahmarsyarah Rizalde und 3 weiteren Autor:innen. Die Arbeit wurde bisher 6-mal zitiert (Crossref).
Abstract (Originalsprache)
The hallmarks of Obsessive-Compulsive Disorder (OCD) are intrusive, anxiety-inducing thoughts (called obsessions) and associated repeated activities (called compulsions). To understand the patterns and relationships between OCD data that have been obtained, data will be grouped (clustering). In clustering using several clustering algorithms, namely K-Means, BIRCH, In this work, hierarchical clustering was used to identify the optimal cluster value comparison, and the Davies Bouldin Index (DBI) was used to confirm the results. Then the results of the best cluster value in processing OCD data are using the BIRCH algorithm in the K10 experiment which gets a value of 1.3. While the K-Means algorithm obtained the best cluster at K10 with a value obtained of 1.36 and the Hierarchical clustering algorithm also at the K10 value of 2.03. Thus in this study, the comparison results of the application of 3 clustering algorithms obtained results, namely the BIRCH algorithm shows the value of the resulting cluster is the best in clustering OCD data. This means that the BIRCH algorithm can be used to cluster OCD data more accurately and efficiently.
Zitieren
APA
Rizalde, A. R., Mubarak, H. A., Ramadhan, G., & Fatan, M. A. (2024). Comparison of K-Means, BIRCH and Hierarchical Clustering Algorithms in Clustering OCD Symptom Data. Public Research Journal of Engineering, Data Technology and Computer Science. https://doi.org/10.57152/predatecs.v1i2.1106
Vancouver
Rizalde AR, Mubarak HA, Ramadhan G, Fatan MA. Comparison of K-Means, BIRCH and Hierarchical Clustering Algorithms in Clustering OCD Symptom Data. Public Research Journal of Engineering, Data Technology and Computer Science. 2024. doi:10.57152/predatecs.v1i2.1106
BibTeX
@article{Rizalde2024,
author = {Rizalde, Alika Rahmarsyarah and Mubarak, Haykal Alya and Ramadhan, Gilang and Fatan, Mohd. Adzka},
title = {Comparison of K-Means, BIRCH and Hierarchical Clustering Algorithms in Clustering OCD Symptom Data},
journal = {Public Research Journal of Engineering, Data Technology and Computer Science},
year = {2024},
doi = {10.57152/predatecs.v1i2.1106}
}
EUVIMED