The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Determining the number of clusters/segments in hierarchical clustering/segmentation algorithms
Abstract
Many clustering and segmentation algorithms both suffer from the limitation that the number of clusters/segments is specified by a human user. It is often impractical to expect a human with sufficient domain knowledge to be available to select the number of clusters/segments to return. We investigate techniques to determine the number of clusters or segments to return from hierarchical clustering and segmentation algorithms. We propose an efficient algorithm, the L method that finds the "knee" in a '# of clusters vs. clustering evaluation metric' graph. Using the knee is well-known, but is not a particularly well-understood method to determine the number of clusters. We explore the feasibility of this method, and attempt to determine in which situations it will and will not work. We also compare the L method to existing methods based on the accuracy of the number of clusters that are determined and efficiency. Our results show favorable performance for these criteria compared to the existing methods that were evaluated.
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
Estimating the Number of Clusters in a Data Set Via the Gap Statistic
Tibshirani, R., Walther, G., & Hastie, T. (2001) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/1467-9868.00293 · Cited by 6,205
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
How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis
Fraley, C. (1998) · The Computer Journal · doi:10.1093/comjnl/41.8.578 · Cited by 2,549
Monti, S., Tamayo, P., Mesirov, J., & Golub, T. (2003) · Machine Learning · doi:10.1023/a:1023949509487 · Cited by 2,116
BIRCH: an efficient data clustering method for very large databases
Zhang, T., Ramakrishnan, R., & Livny, M. (1996) · ACM SIGMOD Record · doi:10.1145/235968.233324 · Cited by 2,097
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
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
An online algorithm for segmenting time series
Keogh, E., Chu, S., Hart, D., & Pazzani, M. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989531 · Cited by 1,149
Model Selection and the Principle of Minimum Description Length
Hansen, M. H., & Yu, B. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753168398 · Cited by 788
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Sheikholeslami, G., Chatterjee, S., & Zhang, A. (1998) · Cited by 756
A robust and scalable clustering algorithm for mixed type attributes in large database environment
Chiu, T., Fang, D., Chen, J., Wang, Y., & Jeris, C. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502549 · Cited by 724
Cluster Validation by Prediction Strength
Tibshirani, R., & Walther, G. (2005) · Journal of Computational and Graphical Statistics · doi:10.1198/106186005x59243 · Cited by 646
An Efficient Data Clustering Method for Very Large Databases
Zhang, T. (1996) · Medical Entomology and Zoology · Cited by 494
Clustering using Monte Carlo cross-validation
Smyth, P. (1996) · Knowledge Discovery and Data Mining · Cited by 207
An Objective Analysis of the Pressure-Volume Curve in the Acute Respiratory Distress Syndrome
SCOTT HARRIS, R., HESS, D. R., & VENEGAS, J. G. (2000) · American Journal of Respiratory and Critical Care Medicine · doi:10.1164/ajrccm.161.2.9901061 · Cited by 204
Learning States and Rules for Detecting Anomalies in Time Series
Salvador, S., & Chan, P. K. (2005) · Applied Intelligence · doi:10.1007/s10489-005-4610-3 · Cited by 117
Self-citationSubspace Information Criterion for Model Selection
Sugiyama, M., & Ogawa, H. (2001) · Neural Computation · doi:10.1162/08997660152469387 · Cited by 89
Learning States and Rules for Time Series Anomaly Detection.
Salvador, S., Chan, P. K., & Brodie, J. (2004) · Cited by 77
Self-citationEstimating the number of segments in time series data using permutation tests
Vasko, K., & Toivonen, H. T. T. (2003) · Proceedings · doi:10.1109/icdm.2002.1183990 · Cited by 62
A parameterless method for efficiently discovering clusters of arbitrary shape in large datasets
Foss, A., & Zai͏̈ane, O. R. (2003) · Proceedings · doi:10.1109/icdm.2002.1183901 · Cited by 43
Cited by
Finding a "Kneedle" in a Haystack: Detecting Knee Points in System Behavior
Satopaa, V., Albrecht, J., Irwin, D., & Raghavan, B. (2011) · 2011 31st International Conference on Distributed Computing Systems Workshops · doi:10.1109/icdcsw.2011.20 · Cited by 1,274
A framework for delineating biogeographical regions based on species distributions
Kreft, H., & Jetz, W. (2010) · Journal of Biogeography · doi:10.1111/j.1365-2699.2010.02375.x · Cited by 743
Structural Minimax Probability Machine
Gu, B., Sun, X., & Sheng, V. S. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2544779 · Cited by 338
Unsupervised Clickstream Clustering for User Behavior Analysis
Wang, G., Zhang, X., Tang, S., Zheng, H., & Zhao, B. Y. (2016) · Proceedings of the 2016 CHI Conference on Human Factors in Computing Systems · doi:10.1145/2858036.2858107 · Cited by 269
A network approach for identifying and delimiting biogeographical regions
Vilhena, D. A., & Antonelli, A. (2015) · Nature Communications · doi:10.1038/ncomms7848 · Cited by 257
Metadata
- Authors
- Salvador, S., & Chan, P.
- Venue
- 16th IEEE International Conference on Tools with Artificial Intelligence
- Publisher
- IEEE Comput. Soc
- Published
- 2005-02-22
- Pages
- 576-584
- ISSN
- 1082-3409 (ISSN-L)
- OpenAlex
- W2098515641
- Cited by
- 683
- References
- 22
- FWCI
- 15.50
- 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.