Quality Scheme Assessment in the Clustering Process
The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
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
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
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
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
Unsupervised optimal fuzzy clustering
Gath, I., & Geva, A. B. (1989) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.192473 · Cited by 1,640
An efficient approach to clustering in large multimedia databases with noise
Hinneburg, A., & Keim, D. A. (1998) · KOPS (University of Konstanz) · Cited by 1,181
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Sheikholeslami, G., Chatterjee, S., & Zhang, A. (1998) · Cited by 756
A Fast Clustering Algorithm to Cluster Very Large Categorical Data Sets in Data Mining.
Huang, J. Z. (1997) · Cited by 724
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
“"sdindex" (Halkidi et al. 2000) Minimum value of the index 30.”
BackgroundMethodInfluentialOn Clustering Validation Techniques
Halkidi, M., Batistakis, Y., & Vazirgiannis, M. (2001) · Journal of Intelligent Information Systems · doi:10.1023/a:1012801612483 · Cited by 2,646
Self-citationCluster 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
Why so many clustering algorithms: a position paper
Estivill-Castro, V. (2002) · ACM SIGKDD Explorations Newsletter · doi:10.1145/568574.568575 · Cited by 600
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-citationClustering 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
Self-citationA Survey of Multiobjective Evolutionary Algorithms for Data Mining: Part I
Mukhopadhyay, A., Maulik, U., Bandyopadhyay, S., & Coello, C. A. C. (2014) · IEEE Transactions on Evolutionary Computation · doi:10.1109/tevc.2013.2290086 · Cited by 421
The Level of Marzano Higher Order Thinking Skillsamong Technical Education Students
Heong, Y. M., Othman, W. B., Yunos, J. B. M., Kiong, T. T., Hassan, R. B., & Mohamad, M. M. B. (2011) · International Journal of Social Science and Humanity · doi:10.7763/ijssh.2011.v1.20 · Cited by 355
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
Understanding FinTech start-ups – a taxonomy of consumer-oriented service offerings
Gimpel, H., Rau, D., & Röglinger, M. (2018) · Electronic Markets · doi:10.1007/s12525-017-0275-0 · Cited by 294
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
A Splitting Criteria Based on Similarity in Decision Tree Learning
Zhang, X., & Jiang, S. (2012) · Journal of Software · doi:10.4304/jsw.7.8.1775-1782 · Cited by 25
“Cluster validity indices are adopted to evaluate cluster performance[12][13], the widely used cluster validity indices includes Davies-Bouldin index, Dunn’s index, Calinski-Harabasz index, and index I[14], the bigger the internal similarity of instances in each cluster, the better the cluster…”
Method
Metadata
- Authors
- Halkidi, M., Vazirgiannis, M., & Batistakis, Y.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2000
- Pages
- 265-276
- ISSN
- 0302-9743 (ISSN-L)
- OpenAlex
- W1600820873
- Cited by
- 305
- References
- 15
- FWCI
- 4.51
- 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.