The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
Clustering validity assessment: finding the optimal partitioning of a data set
Abstract
Clustering is a mostly unsupervised procedure and the majority of clustering algorithms depend on certain assumptions in order to define the subgroups present in a data set. As a consequence, in most applications the resulting clustering scheme requires some sort of evaluation regarding its validity. In this paper we present a clustering validity procedure, which evaluates the results of clustering algorithms on data sets. We define a validity index, S Dbw, based on well-defined clustering criteria enabling the selection of optimal input parameter values for a clustering algorithm that result in the best partitioning of a data set. We evaluate the reliability of our index both theoretically and experimentally, considering three representative clustering algorithms run on synthetic and real data sets. We also carried out an evaluation study to compare S Dbw performance with other known validity indices. Our approach performed favorably in all cases, even those in which other indices failed to indicate the correct partitions in a data set.
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
(1996) · Cited by 20,179
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · Proceedings of the 1996 ACM SIGMOD international conference on Management of data - SIGMOD '96 · doi:10.1145/233269.233324 · Cited by 3,935
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
A validity measure for fuzzy clustering
Xie, X. L., & Beni, G. (1991) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.85677 · Cited by 3,385
Well-Separated Clusters and Optimal Fuzzy Partitions
Dunn†, J. C. (1974) · Journal of Cybernetics · doi:10.1080/01969727408546059 · Cited by 2,510
Automatic subspace clustering of high dimensional data for data mining applications
Agrawal, R., Gehrke, J., Gunopulos, D., & Raghavan, P. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276314 · Cited by 2,412
CURE: an efficient clustering algorithm for large databases
Guha, S., Rastogi, R., & Shim, K. (1998) · Proceedings of the 1998 ACM SIGMOD international conference on Management of data · doi:10.1145/276304.276312 · Cited by 1,907
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Data Mining Techniques: For Marketing, Sales, and Customer Support
Berry, M. J., & Linoff, G. S. (1997) · University of Maribor digital library (University of Maribor) · Cited by 1,736
Cited by
NbClust : An R Package for Determining the Relevant Number of Clusters in a Data Set
Charrad, M., Ghazzali, N., Boiteau, V., & Niknafs, A. (2014) · Journal of Statistical Software · doi:10.18637/jss.v061.i06 · Cited by 3,396
“2000), and SDbw index which is based on the criteria of compactness and separation between clusters (Halkidi and Vazirgiannis 2001).”
BackgroundMethodInfluentialAn extensive comparative study of cluster validity indices
Arbelaitz, O., Gurrutxaga, I., Muguerza, J., Pérez, J. M., & Perona, I. (2013) · Pattern Recognition · doi:10.1016/j.patcog.2012.07.021 · Cited by 1,383
Cluster analysis for gene expression data: a survey
Jiang, D., Tang, C., & Zhang, A. (2004) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2004.68 · Cited by 1,235
Understanding of Internal Clustering Validation Measures
Liu, Y., Li, Z., Xiong, H., Gao, X., & Wu, J. (2010) · 2010 IEEE International Conference on Data Mining · doi:10.1109/icdm.2010.35 · Cited by 973
Automatic Clustering Using an Improved Differential Evolution Algorithm
Das, S., Abraham, A., & Konar, A. (2008) · IEEE Transactions on Systems, Man, and Cybernetics - Part A: Systems and Humans · doi:10.1109/tsmca.2007.909595 · Cited by 726
Clustering validity checking methods: part II
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2002) · ACM SIGMOD Record · doi:10.1145/601858.601862 · Cited by 466
Self-citationAn overview of clustering methods
Omran, M. G. H., Engelbrecht, A. P., & Salman, A. (2007) · Intelligent Data Analysis · doi:10.3233/ida-2007-11602 · Cited by 424
A Framework for Automatic and Unsupervised Detection of Multiple Changes in Multitemporal Images
Bovolo, F., Marchesi, S., & Bruzzone, L. (2012) · IEEE Transactions on Geoscience and Remote Sensing · doi:10.1109/tgrs.2011.2171493 · Cited by 328
Understanding and Enhancement of Internal Clustering Validation Measures
Liu, Y., Li, Z., Xiong, H., Gao, X., Wu, J., & Wu, S. (2013) · IEEE Transactions on Cybernetics · doi:10.1109/tsmcb.2012.2220543 · Cited by 315
Dynamic clustering using particle swarm optimization with application in image segmentation
Omran, M. G. H., Salman, A., & Engelbrecht, A. P. (2006) · Pattern Analysis and Applications · doi:10.1007/s10044-005-0015-5 · Cited by 292
Density-Based Clustering Validation
Moulavi, D., Jaskowiak, P. A., Campello, R. J. G. B., Zimek, A., & Sander, J. (2014) · Proceedings of the 2014 SIAM International Conference on Data Mining · doi:10.1137/1.9781611973440.96 · Cited by 275
New indices for cluster validity assessment
Kim, M., & Ramakrishna, R. S. (2005) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.04.007 · Cited by 270
Jian, J., Zhang, M., Xu, Y., Tang, W., & He, S. (2024) · IEEE Transactions on Sustainable Energy · doi:10.1109/tste.2023.3275566 · Cited by 56
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
“Based on previous studies on multiple cluster-validity metrics [37], [38], we take DBCV as the main evaluation metric for the underlying algorithms benchmarked in HUMAN, while briefly exploring CDbw .”
MethodResearch on gesture recognition method based on PSO optimized LSTM for surface muscle signals
Dai, J., Lu, G., Qin, Z., Guo, X., Liu, X., & Yin, Q. (2024) · 2024 6th Asia Symposium on Image Processing (ASIP) · doi:10.1109/asip63198.2024.00022 · Cited by 1
Metadata
- Authors
- Halkidi, M., & Vazirgiannis, M.
- Venue
- Proceedings 2001 IEEE International Conference on Data Mining
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-14
- Pages
- 187-194
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W1697154133
- Cited by
- 426
- References
- 23
- FWCI
- 5.44
- 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.