The DOI matches its Crossref record; 32 of the 32 references it cites were found in a registry or an index.
Density-Based Clustering Validation
Abstract
One of the most challenging aspects of clustering is validation, which is the objective and quantitative assessment of clustering results. A number of different relative validity criteria have been proposed for the validation of globular, clusters. Not all data, however, are composed of globular clusters. Density-based clustering algorithms seek partitions with high density areas of points (clusters, not necessarily globular) separated by low density areas, possibly containing noise objects. In these cases relative validity indices proposed for globular cluster validation may fail. In this paper we propose a relative validation index for density-based, arbitrarily shaped clusters. The index assesses clustering quality based on the relative density connection between pairs of objects. Our index is formulated on the basis of a new kernel density function, which is used to compute the density of objects and to evaluate the within- and between-cluster density connectedness of clustering results. Experiments on synthetic and real world data show the effectiveness of our approach for the evaluation and selection of clustering algorithms and their respective appropriate parameters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
UCI Machine Learning Repository
Asuncion, A. (2007) · Medical Entomology and Zoology · Cited by 25,410
Silhouettes: A graphical aid to the interpretation and validation of cluster analysis
Rousseeuw, P. J. (1987) · Journal of Computational and Applied Mathematics · doi:10.1016/0377-0427(87)90125-7 · Cited by 21,392
(1996) · Cited by 20,179
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,358
Davies, D. L., & Bouldin, D. W. (1979) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1979.4766909 · Cited by 9,145
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Algorithms for clustering data
Flury, B. (1989) · Journal of Statistical Planning and Inference · doi:10.1016/0378-3758(89)90033-5 · Cited by 6,432
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
A dendrite method for cluster analysis
Caliński, T., & Harabasz, J. (1974) · Communications in Statistics · doi:10.1080/03610927408827101 · Cited by 4,480
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
An Examination of Procedures for Determining the Number of Clusters in a Data Set
Milligan, G. W., & Cooper, M. C. (1985) · Psychometrika · doi:10.1007/bf02294245 · Cited by 3,868
Density-Based Clustering Based on Hierarchical Density Estimates
Campello, R. J. G. B., Moulavi, D., & Sander, J. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-37456-2_14 · Cited by 2,680 · cited 2×
“RJGBC thanks CNPq (grant #301241 2010-4) and FAPESP (grants#2010/20032−6 and#2013/18698-4).”
ResultSelf-citationGordon, A. D., & Hartigan, J. A. (1976) · Journal of the American Statistical Association · doi:10.2307/2286880 · Cited by 2,569
Well-Separated Clusters and Optimal Fuzzy Partitions
Dunn†, J. C. (1974) · Journal of Cybernetics · doi:10.1080/01969727408546059 · Cited by 2,510
Performance evaluation of some clustering algorithms and validity indices
Maulik, U., & Bandyopadhyay, S. (2002) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2002.1114856 · Cited by 1,396 · cited 1×
“1 Relative Measures We compare our measure against five well-known relative measures from the literature, namely, Silhouette Width Criterion (SWC) [27], Variance Ratio Criterion (VRC) [4], Dunn [10], and Maulik-Bandyopadhyay (MB) [23].”
MethodKriegel, H., Kröger, P., Sander, J., & Zimek, A. (2011) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.30 · Cited by 900
Self-citationModel-based clustering and data transformations for gene expression data
Yeung, K. Y., Fraley, C., Murua, A., Raftery, A. E., & Ruzzo, W. L. (2001) · Bioinformatics · doi:10.1093/bioinformatics/17.10.977 · Cited by 869
Clustering validity assessment: finding the optimal partitioning of a data set
Halkidi, M., & Vazirgiannis, M. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989517 · Cited by 426
A new cluster validity measure and its application to image compression
Chou, C.-H., Su, M.-C., & Lai, E. (2004) · Pattern Analysis and Applications · doi:10.1007/s10044-004-0218-1 · Cited by 326
Relative clustering validity criteria: A comparative overview
Vendramin, L., Campello, R. J. G. B., & Hruschka, E. R. (2010) · Statistical Analysis and Data Mining: The ASA Data Science Journal · doi:10.1002/sam.10080 · Cited by 325
Self-citationQuality Scheme Assessment in the Clustering Process
Halkidi, M., Vazirgiannis, M., & Batistakis, Y. (2000) · Lecture Notes in Computer Science · doi:10.1007/3-540-45372-5_26 · Cited by 305
Clustering gene-expression data with repeated measurements
Yeung, K. Y., Medvedovic, M., & Bumgarner, R. E. (2003) · Genome Biology · doi:10.1186/gb-2003-4-5-r34 · Cited by 225
Wu, S., & Chow, T. W. S. (2003) · Pattern Recognition · doi:10.1016/s0031-3203(03)00237-1 · Cited by 153
Validity index for clusters of different sizes and densities
Žalik, K. R., & Žalik, B. (2010) · Pattern Recognition Letters · doi:10.1016/j.patrec.2010.08.007 · Cited by 137
Finding Salient Regions in Images
Pauwels, E., & Frederix, G. (1999) · Computer Vision and Image Understanding · doi:10.1006/cviu.1999.0763 · Cited by 125
A density-based cluster validity approach using multi-representatives
Halkidi, M., & Vazirgiannis, M. (2008) · Pattern Recognition Letters · doi:10.1016/j.patrec.2007.12.011 · Cited by 121
Semi-supervised Density-Based Clustering
Lelis, L. H. S., & Sander, J. (2009) · Proceedings · doi:10.1109/icdm.2009.143 · Cited by 113
Self-citationAutomatic Extraction of Clusters from Hierarchical Clustering Representations
Sander, J., Qin, X., Lu, Z., Niu, N., & Kovarsky, A. (2003) · Lecture notes in computer science · doi:10.1007/3-540-36175-8_8 · Cited by 111
Self-citationOn Using Class-Labels in Evaluation of Clusterings
Färber, I., Günnemann, S., Kriegel, H., Kröger, P., Müller, E., Schubert, E., Seidl, T., Zimek, A., & München, L.-M.-U. (2010) · Cited by 100
Self-citationA framework for semi-supervised and unsupervised optimal extraction of clusters from hierarchies
Campello, R. J. G. B., Moulavi, D., Zimek, A., & Sander, J. (2013) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-013-0311-4 · Cited by 98
Self-citationHow Many Clusters: A Validation Index for Arbitrary-Shaped Clusters
Bayá, A. E., & Granitto, P. M. (2013) · IEEE Transactions on Computational Biology and Bioinformatics · doi:10.1109/tcbb.2013.32 · Cited by 34
On the combination of relative clustering validity criteria
Vendramin, L., Jaskowiak, P. A., & Campello, R. J. G. B. (2013) · International Conference on Scientific and Statistical Database Management · doi:10.1145/2484838.2484844 · Cited by 32
Self-citation
Cited by
Ensembles for unsupervised outlier detection: challenges and research questions a position paper
Zimek, A., Campello, R. J. G. B., & Sander, J. (2014) · ACM SIGKDD Explorations Newsletter · doi:10.1145/2594473.2594476 · Cited by 278
Self-citationRNN-DBSCAN: A Density-Based Clustering Algorithm Using Reverse Nearest Neighbor Density Estimates
Bryant, A., & Cios, K. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2017.2787640 · Cited by 273
Do We Run How We Say We Run? Formalization and Practice of Governance in OSS Communities
Chakraborti, M., Atkisson, C., Stănciulescu, Ş., Filkov, V., & Frey, S. (2024) · Proceedings of the CHI Conference on Human Factors in Computing Systems · doi:10.1145/3613904.3641980 · Cited by 7
HUMAN - Hierarchical Clustering for Unsupervised Anomaly Detection & Interpretation
Mulinka, P., Casas, P., Fukuda, K., & Kencl, L. (2020) · 2020 11th International Conference on Network of the Future (NoF) · doi:10.1109/nof50125.2020.9249194 · Cited by 5
“According to [35], CDbw is the most used measure specific to density based validation.”
BackgroundMethodInfluential
Metadata
- Authors
- Moulavi, D., Jaskowiak, P. A., Campello, R. J. G. B., Zimek, A., & Sander, J.
- Venue
- Proceedings of the 2014 SIAM International Conference on Data Mining
- Published
- 2014-04-28
- Pages
- 839-847
- OpenAlex
- W2408186052
- Cited by
- 275
- References
- 32
- FWCI
- 5.14
- Type
- conference paper
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.