An easy guide to the Davies-Bouldin index for unsupervised internal clustering evaluation

This study provides a practical guide to using the Davies-Bouldin Index (DBI), a popular metric for internally evaluating clustering results. While previous studies applied DBI across results on various datasets and generated by several algorithms, no comprehensive guidelines exist for effective use of this coefficient. We systematically analyze DBI’s behavior through experiments on both synthetic and real-world medical datasets, including results obtained through k-means, DBSCAN, and hierarchical clustering. Our results highlight DBI’s strengths and limitations, such as sensitivity to cluster imbalance, non-compact clusters, and high-dimensional data. Based on these findings, we propose actionable recommendations and best practices for unsupervised machine learning researchers, including optimal algorithm choices and parameter settings. This study bridges the gap between theoretical knowledge and practical application, offering a clear manual of use for the Davies-Bouldin Index in diverse clustering tasks.

Authors

Institutions

Publication Details

Journal
Discover Computing
Published
2026-04-17
DOI
https://doi.org/10.1007/s10791-026-10094-0
Primary Topic
Advanced Clustering Algorithms Research
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

An easy guide to the Davies-Bouldin index for unsupervised internal clustering evaluation

Davide Chicco, Alessandro Anfossi
Discover Computing
Advanced Clustering Algorithms Research
article

An easy guide to the Davies-Bouldin index for unsupervised internal clustering evaluation

Davide Chicco, Alessandro Anfossi
article en

Abstract

This study provides a practical guide to using the Davies-Bouldin Index (DBI), a popular metric for internally evaluating clustering results. While previous studies applied DBI across results on various datasets and generated by several algorithms, no comprehensive guidelines exist for effective use of this coefficient. We systematically analyze DBI’s behavior through experiments on both synthetic and real-world medical datasets, including results obtained through k-means, DBSCAN, and hierarchical clustering. Our results highlight DBI’s strengths and limitations, such as sensitivity to cluster imbalance, non-compact clusters, and high-dimensional data. Based on these findings, we propose actionable recommendations and best practices for unsupervised machine learning researchers, including optimal algorithm choices and parameter settings. This study bridges the gap between theoretical knowledge and practical application, offering a clear manual of use for the Davies-Bouldin Index in diverse clustering tasks.

Discover ComputingVol. 29(1)
University of Toronto (CA), University of Milano-Bicocca (IT)
Università degli Studi di Milano, Dipartimenti di Eccellenza, Università degli Studi di Milano-Bicocca, Ministero dell'Università e della Ricerca
Openalex Percentile: Top 20%
Advanced Clustering Algorithms Research
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.