COMPARISON OF DBSCAN AND K-MEANS CLUSTER ANALYSIS WITH PATH-ANOVA IN CLUSTERING WASTE MANAGEMENT BEHAVIOUR PATTERNS

This study aims to compare the effectiveness of DBSCAN and K-Means cluster analysis methods in clustering waste management behaviour patterns in Batu City. The data used is secondary data from previous research with a total of 395 respondents taken using the quota sampling method. DBSCAN classifies data based on density with the main parameters epsilon and MinPts, while K-Means uses the average centroid to determine the cluster. The analysis results show that DBSCAN produces a silhouette index of 0.664, which is higher than K-Means with a value of 0.574. DBSCAN also successfully identified noise as much as 10 data that did not belong to any cluster, while K-Means did not have a similar mechanism. The results of Path-ANOVA show that DBSCAN is the most optimal clustering with a more significant partition difference value. Further tests were conducted to strengthen the validation of clustering results using Path-ANOVA. Both methods produced two main clusters, with the second cluster showing higher quality in terms of maintenance, quality, and ease of use of environmental hygiene facilities. This research emphasises the importance of choosing an appropriate clustering method to ensure optimal clustering results, especially in data with complex characteristics.

Authors

Publication Details

Journal
Jurnal Teknik Informatika (Jutif)
Published
2025-02-12
DOI
https://doi.org/10.52436/1.jutif.2025.6.1.4183
Primary Topic
Data Mining and Machine Learning Applications
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

COMPARISON OF DBSCAN AND K-MEANS CLUSTER ANALYSIS WITH PATH-ANOVA IN CLUSTERING WASTE MANAGEMENT BEHAVIOUR PATTERNS

Muhammad Rizal Zuhdi, Adji Achmad Rinaldo Fernandes, Ni Wayan Surya Wardhani, Hafizh Syihabuddin Al Jauhar
Jurnal Teknik Informatika (Jutif)
Data Mining and Machine Learning Applications
article

COMPARISON OF DBSCAN AND K-MEANS CLUSTER ANALYSIS WITH PATH-ANOVA IN CLUSTERING WASTE MANAGEMENT BEHAVIOUR PATTERNS

Muhammad Rizal Zuhdi, Adji Achmad Rinaldo Fernandes, Ni Wayan Surya Wardhani, Hafizh Syihabuddin Al Jauhar
article en

Abstract

This study aims to compare the effectiveness of DBSCAN and K-Means cluster analysis methods in clustering waste management behaviour patterns in Batu City. The data used is secondary data from previous research with a total of 395 respondents taken using the quota sampling method. DBSCAN classifies data based on density with the main parameters epsilon and MinPts, while K-Means uses the average centroid to determine the cluster. The analysis results show that DBSCAN produces a silhouette index of 0.664, which is higher than K-Means with a value of 0.574. DBSCAN also successfully identified noise as much as 10 data that did not belong to any cluster, while K-Means did not have a similar mechanism. The results of Path-ANOVA show that DBSCAN is the most optimal clustering with a more significant partition difference value. Further tests were conducted to strengthen the validation of clustering results using Path-ANOVA. Both methods produced two main clusters, with the second cluster showing higher quality in terms of maintenance, quality, and ease of use of environmental hygiene facilities. This research emphasises the importance of choosing an appropriate clustering method to ensure optimal clustering results, especially in data with complex characteristics.

Jurnal Teknik Informatika (Jutif)Vol. 6(1)
Openalex Percentile: Top 85%
Data Mining and Machine Learning Applications
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.