The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
The Challenges of Clustering High Dimensional Data
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
Fast algorithms for mining association rules
Agrawal, R., & Srikant, R. (1998) · Cited by 11,307
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Finding Groups in Data: An Introduction to Cluster Analysis
Kaufman, L., & Rousseeuw, P. J. (1990) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316801 · Cited by 7,344
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
Cluster Analysis for Applications
(1973) · Elsevier eBooks · doi:10.1016/c2013-0-06161-0 · Cited by 5,080
Adaptive Control Processes: A Guided Tour
Bellman, R. E. (1961) · doi:10.1515/9781400874668 · Cited by 2,802
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
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
When Is ''Nearest Neighbor'' Meaningful?
Beyer, K., Goldstein, J., Ramakrishnan, R., & Shaft, U. (1999) · Lecture Notes in Computer Science · doi:10.1007/3-540-49257-7_15 · Cited by 2,403 · cited 2×
“In [ BGRS99 ], it is shown, for certain data distributions, that the relative difference of the distances of the closest and farthest data points of an independently selected point goes to 0 as the dimensionality increases, i.e.,”
BackgroundAdaptive Control Processes: A Guided Tour.
Page, E. S., & Bellman, R. (1962) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2343225 · Cited by 2,185
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
Self-citationRock: A robust clustering algorithm for categorical attributes
Guha, S., Rastogi, R., & Shim, K. (2000) · Information Systems · doi:10.1016/s0306-4379(00)00022-3 · Cited by 1,472
Concept Decompositions for Large Sparse Text Data Using Clustering
Dhillon, I. S., & Modha, D. S. (2001) · Machine Learning · doi:10.1023/a:1007612920971 · Cited by 1,293
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
Clustering Using a Similarity Measure Based on Shared Near Neighbors
Jarvis, R. A., & Patrick, E. A. (1973) · IEEE Transactions on Computers · doi:10.1109/t-c.1973.223640 · Cited by 955
Fuzzy Cluster Analysis: Methods for Classification, Data Analysis and Image Recognition
Rayward-Smith, V. J., Höppner, F., Klawonn, F., Kruse, R., & Runkler, T. A. (2000) · Journal of the Operational Research Society · doi:10.2307/254022 · Cited by 922
Fast algorithms for projected clustering
Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999) · ACM SIGMOD Record · doi:10.1145/304181.304188 · Cited by 900
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Sheikholeslami, G., Chatterjee, S., & Zhang, A. (1998) · Cited by 756
Near Neighbor Search in Large Metric Spaces
Brin, S. (1995) · Cited by 556
What Is the Nearest Neighbor in High Dimensional Spaces
Hinneburg, A., Aggarwal, C. C., & Keim, D. A. (2000) · KOPS (University of Konstanz) · Cited by 505
Fast algorithms for projected clustering
Aggarwal, C. C., Wolf, J. L., Yu, P. S., Procopiuc, C., & Park, J. S. (1999) · Proceedings of the 1999 ACM SIGMOD international conference on Management of data · doi:10.1145/304182.304188 · Cited by 484
Proceedings of the 26th International Conference on Data Engineering, ICDE 2010
Li, F., Moro, M. M., Ghandeharizadeh, S., Haritsa, J. R., Weikum, G., Carey, M. J., Casati, F., Chang, E. Y., Manolescu, I., Mehrotra, S., et al. (2010) · Max Planck Institute for Plasma Physics · Cited by 452
Agglomerative clustering using the concept of mutual nearest neighbourhood
Chidananda Gowda, K., & Krishna, G. (1978) · Pattern Recognition · doi:10.1016/0031-3203(78)90018-3 · Cited by 405
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Hinneburg, A., & Keim, D. A. (1999) · KOPS (University of Konstanz) · Cited by 339
On the performance of bisecting K-means and PDDP
Savaresi, S. M., & Boley, D. L. (2001) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972719.5 · Cited by 126
Finding Topics in Collections of Documents: A Shared Nearest Neighbor Approach
Ertöz, L., Steinbach, M. S., & Kumar, V. (2004) · Network theory and applications · doi:10.1007/978-1-4613-0227-8_3 · Cited by 123
Self-citationClustering in a High-Dimensional Space Using Hypergraph Models
Han, E.-H. S., Karypis, G., Kumar, V., & Mobasher, B. (1997) · Cited by 56
Self-citation
Cited by
Unsupervised deep embedding for clustering analysis
Xie, J., Girshick, R., & Farhadi, A. (2015) · arXiv · doi:10.48550/arxiv.1511.06335 · Cited by 2,476
Hotho, A., Nürnberger, A., & Paaß, G. (2005) · Journal for Language Technology and Computational Linguistics · doi:10.21248/jlcl.20.2005.68 · Cited by 893
Mitra, P., & Bokil, H. (2007) · doi:10.1093/acprof:oso/9780195178081.001.0001 · Cited by 842
An Entropy Weighting k-Means Algorithm for Subspace Clustering of High-Dimensional Sparse Data
Jing, L., Ng, M. K., & Huang, J. Z. (2007) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.1048 · Cited by 625
K-means properties on six clustering benchmark datasets
Fränti, P., & Sieranoja, S. (2018) · Applied Intelligence · doi:10.1007/s10489-018-1238-7 · Cited by 518
Metadata
- Authors
- Steinbach, M., Ertöz, L., & Kumar, V.
- Venue
- New Directions in Statistical Physics
- Publisher
- Springer Berlin Heidelberg
- Published
- 2004
- Pages
- 273-309
- OpenAlex
- W1507901999
- Cited by
- 508
- References
- 31
- FWCI
- 16.61
- Type
- book chapter
- 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.