The DOI matches its Crossref record; 175 of the 175 references it cites were found in a registry or an index.
A Survey of Clustering Data Mining Techniques
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Estimating the Dimension of a Model
Schwarz, G. (1978) · The Annals of Statistics · doi:10.1214/aos/1176344136 · Cited by 47,033
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Data mining: concepts and techniques
(2012) · Choice Reviews Online · doi:10.5860/choice.49-3305 · Cited by 28,531
Hierarchical Grouping to Optimize an Objective Function
Ward, J. H. (1963) · Journal of the American Statistical Association · doi:10.1080/01621459.1963.10500845 · Cited by 20,598
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
(1996) · Cited by 20,179
Genetic Algorithms in Search, Optimization and Machine Learning
Goldberg, D. E., & Robson, D. (1988) · Cited by 18,391
Goldberg, D. E., & Shakespeare, W. (2002) · Cited by 16,088
Kohonen, T. (2001) · Springer Series in Information Sciences · doi:10.1007/978-3-642-56927-2 · Cited by 16,019
Algorithm AS 136: A K-Means Clustering Algorithm
Hartigan, J. A., & Wong, M. A. (1979) · Applied Statistics · doi:10.2307/2346830 · Cited by 14,523
Jain, A. K., Murty, M. N., & Flynn, P. J. (1999) · ACM Computing Surveys · doi:10.1145/331499.331504 · Cited by 13,199
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
David, F. N., & Tukey, J. W. (1977) · Biometrics · doi:10.2307/2529486 · Cited by 12,708
Introduction to Statistical Pattern Recognition
(1990) · Elsevier eBooks · doi:10.1016/c2009-0-27872-x · Cited by 11,031
Finding groups in data: an introduction to cluster analysis
(1991) · Choice Reviews Online · doi:10.5860/choice.28-4558 · Cited by 10,474
Pattern Recognition with Fuzzy Objective Function Algorithms
Bezdek, J. C. (1981) · doi:10.1007/978-1-4757-0450-1 · Cited by 9,881
Everitt, B. J., Landau, S., & Leese, M. (1974) · Cited by 9,358
Goodall, C. (1988) · Technometrics · doi:10.1080/00401706.1988.10488412 · Cited by 8,675
On Spectral Clustering: Analysis and an algorithm
Ng, A. Y., Jordan, M. I., & Weiss, Y. (2001) · Cited by 8,159
Algorithms for Clustering Data
Sarle, W. S. (1990) · Technometrics · doi:10.1080/00401706.1990.10484648 · Cited by 7,865
Vector Quantization and Signal Compression
Gersho, A., & Gray, R. M. (1992) · Springer eBooks · doi:10.1007/978-1-4615-3626-0 · Cited by 7,003
R-trees: a dynamic index structure for spatial searching
Guttman, A. (1984) · Proceedings of the 1984 ACM SIGMOD international conference on Management of data - SIGMOD '84 · doi:10.1145/602259.602266 · Cited by 6,580
Objective Criteria for the Evaluation of Clustering Methods
Rand, W. M. (1971) · Journal of the American Statistical Association · doi:10.1080/01621459.1971.10482356 · Cited by 6,566
Modeling by shortest data description
Rissanen, J. (1978) · Automatica · doi:10.1016/0005-1098(78)90005-5 · Cited by 6,011
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs
Karypis, G., & Kumar, V. (1998) · SIAM Journal on Scientific Computing · doi:10.1137/s1064827595287997 · Cited by 5,762
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
An Efficient Heuristic Procedure for Partitioning Graphs
Kernighan, B. W., & Lin, S. (1970) · Bell System Technical Journal · doi:10.1002/j.1538-7305.1970.tb01770.x · Cited by 5,305
LOF: identifying density-based local outliers
Breunig, M. M., Kriegel, H.-P., Ng, R. T., & Sander, J. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335388 · Cited by 5,207
Motwani, R., & Raghavan, P. (1995) · Cambridge University Press eBooks · doi:10.1017/cbo9780511814075 · Cited by 5,123
Artificial neural networks: a tutorial
Jain, A. K., Mao, J., & Mohiuddin, K. M. (1996) · Computer · doi:10.1109/2.485891 · Cited by 4,946
Data mining and knowledge discovery: making sense out of data
Feyyad, U. M. (1996) · IEEE Expert · doi:10.1109/64.539013 · Cited by 4,612
Laplacian Eigenmaps and Spectral Techniques for Embedding and Clustering
Belkin, M., & Niyogi, P. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0080 · Cited by 4,412
The R*-tree: an efficient and robust access method for points and rectangles
Beckmann, N., Kriegel, H.-P., Schneider, R., & Seeger, B. (1990) · Proceedings of the 1990 ACM SIGMOD international conference on Management of data · doi:10.1145/93597.98741 · Cited by 4,161
Ankerst, M. (1999) · doi:10.1145/304181.304187 · Cited by 3,982
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
An Information-Theoretic Definition of Similarity
Lin, D. (1998) · International Conference on Machine Learning · Cited by 3,790
Multivariate Density Estimation: Theory, Practice, and Visualization
Scott, D. W. (1992) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316849 · Cited by 3,696
Using Information Content to Evaluate Semantic Similarity in a Taxonomy
Resnik, P. (1995) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9511007 · Cited by 3,193
An Algorithm for Finding Best Matches in Logarithmic Expected Time
Friedman, J. H., Bentley, J. L., & Finkel, R. A. (1977) · ACM Transactions on Mathematical Software · doi:10.1145/355744.355745 · Cited by 2,813
The information bottleneck method
Tishby, N., Pereira, F. C., & Bialek, W. (2000) · arXiv · doi:10.48550/arxiv.physics/0004057 · Cited by 2,626 · cited 2×
“In this context the technique was explored under the name information bottleneck method [209].”
Method(2013) · Springer eBooks · Cited by 2,625
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
A Comparison of Document Clustering Techniques
Steinbach, M. S., Karypis, G., & Kumar, V. (2000) · Cited by 2,532
Extensions to the k-Means Algorithm for Clustering Large Data Sets with Categorical Values
Huang, Z. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009769707641 · Cited by 2,505
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×
“Mathematically, nearest neighbor query becomes unstable: the distance to the nearest neighbor becomes indistinguishable from the distance to the majority of points [Beyer et al. 1999].”
BackgroundModel-Based Gaussian and Non-Gaussian Clustering
Banfield, J. D., & Raftery, A. E. (1993) · Biometrics · doi:10.2307/2532201 · Cited by 2,395
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Chameleon: hierarchical clustering using dynamic modeling
Karypis, G., Han, E.-H., & Kumar, V. (1999) · Computer · doi:10.1109/2.781637 · Cited by 2,097
Mixture models : inference and applications to clustering
McLachlan, G. J., & Basford, K. E. (1988) · M. Dekker eBooks · Cited by 2,094
Cluster analysis of multivariate data : efficiency versus interpretability of classifications
Forgy, E. W. (1965) · Biometrics · Cited by 2,093
On the Surprising Behavior of Distance Metrics in High Dimensional Space
Aggarwal, C. C., Hinneburg, A., & Keim, D. A. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_27 · Cited by 2,083
Knowledge acquisition via incremental conceptual clustering
Fisher, D. H. (1987) · Machine Learning · doi:10.1007/bf00114265 · Cited by 1,991
Efficient similarity search in sequence databases
Agrawal, R., Faloutsos, C., & Swami, A. (1993) · Lecture Notes in Computer Science · doi:10.1007/3-540-57301-1_5 · Cited by 1,979
Kohonen, T. (1998) · Neurocomputing · doi:10.1016/s0925-2312(98)00030-7 · Cited by 1,968
Computing Bayes Factors by Combining Simulation and Asymptotic Approximations
Diciccio, T. J., Kass, R. E., Raftery, A., & Wasserman, L. (1997) · Journal of the American Statistical Association · doi:10.1080/01621459.1997.10474045 · Cited by 1,943
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 algorithms for mining outliers from large data sets
Ramaswamy, S., Rastogi, R., & Shim, K. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335437 · Cited by 1,860
Efficient and Effective Clustering Methods for Spatial Data Mining
Ng, R. T., & Han, J. (1994) · Cited by 1,778
Mining time-changing data streams
Hulten, G., Spencer, L., & Domingos, P. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502529 · Cited by 1,748
Clustering to minimize the maximum intercluster distance
Gonzalez, T. F. (1985) · Theoretical Computer Science · doi:10.1016/0304-3975(85)90224-5 · Cited by 1,717
Fast subsequence matching in time-series databases
Faloutsos, C., Ranganathan, M., & Manolopoulos, Y. (1994) · Proceedings of the 1994 ACM SIGMOD international conference on Management of data · doi:10.1145/191839.191925 · Cited by 1,709
Co-clustering documents and words using bipartite spectral graph partitioning
Dhillon, I. S. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502550 · Cited by 1,697
A General Theory of Classificatory Sorting Strategies: 1. Hierarchical Systems
Lance, G. N., & Williams, W. T. (1967) · The Computer Journal · doi:10.1093/comjnl/9.4.373 · Cited by 1,696
Carpenter, G. A., Grossberg, S., & Rosen, D. B. (1991) · Neural Networks · doi:10.1016/0893-6080(91)90056-b · Cited by 1,665
Dimensionality Reduction for Fast Similarity Search in Large Time Series Databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · Knowledge and Information Systems · doi:10.1007/pl00011669 · Cited by 1,573
Algorithms for Mining Distance-Based Outliers in Large Datasets
Knorr, E. M., & Ng, R. T. (1998) · Cited by 1,544
Stochastic Complexity in Statistical Inquiry
Rissanen, J. (1998) · WORLD SCIENTIFIC eBooks · doi:10.1142/0822 · Cited by 1,539
Density-Based Clustering in Spatial Databases: The Algorithm GDBSCAN and Its Applications
Sander, J., Ester, M., Kriegel, H.-P., & Xu, X. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009745219419 · Cited by 1,495
Toward optimal feature selection
Koller, D., & Sahami, M. (1996) · Cited by 1,482
Using Linear Algebra for Intelligent Information Retrieval
Berry, M. W., Dumais, S. T., & O’Brien, G. W. (1995) · SIAM Review · doi:10.1137/1037127 · Cited by 1,481
Rock: 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
Data Preparation for Mining World Wide Web Browsing Patterns
Cooley, R., Mobasher, B., & Srivastava, J. (1999) · Knowledge and Information Systems · doi:10.1007/bf03325089 · Cited by 1,455
Scatter/Gather: A Cluster-based Approach to Browsing Large Document Collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130362 · Cited by 1,419
New spectral methods for ratio cut partitioning and clustering
Hagen, L., & Kahng, A. B. (1992) · IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems · doi:10.1109/43.159993 · Cited by 1,288
SLINK: An optimally efficient algorithm for the single-link cluster method
Sibson, R. (1973) · The Computer Journal · doi:10.1093/comjnl/16.1.30 · Cited by 1,203
Clustering Gene Expression Patterns
Ben-Dor, A., Shamir, R., & Yakhini, Z. (1999) · Journal of Computational Biology · doi:10.1089/106652799318274 · Cited by 1,203
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
Data Mining Approaches for Intrusion Detection
Lee, W., & Stolfo, S. J. (2000) · doi:10.21236/ada401496 · Cited by 1,179
Efficient clustering of high-dimensional data sets with application to reference matching
McCallum, A., Nigam, K., & Ungar, L. H. (2000) · Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/347090.347123 · Cited by 1,096
A Survey of Recent Advances in Hierarchical Clustering Algorithms
Murtagh, F. (1983) · The Computer Journal · doi:10.1093/comjnl/26.4.354 · Cited by 1,058
A property of eigenvectors of nonnegative symmetric matrices and its application to graph theory
Fiedler, M. (1975) · Czechoslovak Mathematical Journal · doi:10.21136/cmj.1975.101357 · Cited by 1,042
On Bias, Variance, 0/1—Loss, and the Curse-of-Dimensionality
Friedman, J. H. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009778005914 · Cited by 1,040
Refining Initial Points for K-Means Clustering
Bradley, P. S., & Fayyad, U. M. (1998) · Cited by 1,031
Bayesian classification (AutoClass): theory and results
Cheeseman, P. C., & Stutz, J. (1996) · Cited by 975
Efficient algorithms for agglomerative hierarchical clustering methods
Day, W. H. E., & Edelsbrunner, H. (1984) · Journal of Classification · doi:10.1007/bf01890115 · Cited by 971
Pattern Recognition: Statistical, Structural and Neural Approaches
Schalkoff, R. J. (1991) · Medical Entomology and Zoology · Cited by 964
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
ISODATA, A NOVEL METHOD OF DATA ANALYSIS AND PATTERN CLASSIFICATION
Ball, G. H., & Hall, D. J. (1965) · Defense Technical Information Center (DTIC) · Cited by 919
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
Faloutsos, C., & Lin, K.-I. (1995) · Proceedings of the 1995 ACM SIGMOD international conference on Management of data - SIGMOD '95 · doi:10.1145/223784.223812 · Cited by 897
BIRCH: A New Data Clustering Algorithm and Its Applications
Zhang, T., Ramakrishnan, R., & Livny, M. (1997) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009783824328 · Cited by 888
Locally adaptive dimensionality reduction for indexing large time series databases
Keogh, E., Chakrabarti, K., Pazzani, M., & Mehrotra, S. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375680 · Cited by 866
Fast and effective text mining using linear-time document clustering
Larsen, B., & Aone, C. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312186 · Cited by 857
Forrest, S., Hofmeyr, S. A., & Somayaji, A. (1997) · Communications of the ACM · doi:10.1145/262793.262811 · Cited by 848
A min-max cut algorithm for graph partitioning and data clustering
Ding, C. H. Q., He, X., Zha, H., Gu, M., & Simon, H. D. (2002) · Proceedings 2001 IEEE International Conference on Data Mining · doi:10.1109/icdm.2001.989507 · Cited by 829
The Interpretation of Analytical Chemical Data by the Use of Cluster Analysis
Massart, D. L., & Kaufman, L. (1983) · VUBIR (Vrije Universiteit Brussel) · Cited by 823
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Leighton, T., & Rao, S. (1999) · Journal of the ACM · doi:10.1145/331524.331526 · Cited by 820
WaveCluster: A Multi-Resolution Clustering Approach for Very Large Spatial Databases
Sheikholeslami, G., Chatterjee, S., & Zhang, A. (1998) · Cited by 756
An efficient algorithm for a complete link method
Defays, D. (1977) · The Computer Journal · doi:10.1093/comjnl/20.4.364 · Cited by 752
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
Scaling clustering algorithms to large databases
Bradley, P., Fayyad, U. M., & Reina, C. (1998) · Cited by 716
Finding Clusters of Different Sizes, Shapes, and Densities in Noisy, High Dimensional Data
Ertöz, L., Steinbach, M., & Kumar, V. (2003) · Proceedings of the 2003 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972733.5 · Cited by 703
What makes patterns interesting in knowledge discovery systems
Silberschatz, A., & Tuzhilin, A. (1996) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/69.553165 · Cited by 679
Distributional clustering of words for text classification
Baker, L. D., & McCallum, A. K. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290970 · Cited by 676
A probabilistic approach to feature selection - a filter solution
Liu, H., & Setiono, R. (1996) · Cited by 665
Criterion Functions for Document Clustering: Experiments and Analysis
Zhao, Y., & Karypis, G. (2001) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 581
Mathematical Classification and Clustering
Mirkin, B. (1997) · Journal of the Operational Research Society · doi:10.1038/sj.jors.2600836 · Cited by 563
Entropy-based subspace clustering for mining numerical data
Cheng, C.-H., Fu, A. W., & Zhang, Y. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312199 · Cited by 543
Finding generalized projected clusters in high dimensional spaces
Aggarwal, C. C., & Yu, P. S. (2000) · ACM SIGMOD Record · doi:10.1145/335191.335383 · Cited by 530
Models of Incremental Concept Formation
Gennari, J. H., Langley, P., & Fisher, D. (1988) · doi:10.21236/ada191597 · Cited by 525
Estimation and Inference by Compact Coding
Wallace, C. S., & Freeman, P. R. (1987) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1987.tb01695.x · Cited by 523
A fast algorithm to determine fractal dimensions by box counting
Liebovitch, L. S., & Toth, T. (1989) · Physics Letters A · doi:10.1016/0375-9601(89)90854-2 · Cited by 514
Document clustering using word clusters via the information bottleneck method
Slonim, N., & Tishby, N. (2000) · Proceedings of the 23rd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/345508.345578 · Cited by 474
CACTUS—clustering categorical data using summaries
Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312201 · Cited by 469
Analysis of Categorical Data: Dual Scaling and Its Applications
Gokhale, D. V. (1983) · Technometrics · doi:10.1080/00401706.1983.10487834 · Cited by 414
Clustering with a genetically optimized approach
Hall, L. O., Ozyurt, I. B., & Bezdek, J. C. (1999) · IEEE Transactions on Evolutionary Computation · doi:10.1109/4235.771164 · Cited by 409
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
Parallel algorithms for hierarchical clustering
Olson, C. F. (1995) · Parallel Computing · doi:10.1016/0167-8191(95)00017-i · Cited by 404
Berchtold, S., Böhm, C., & Kriegal, H.-P. (1998) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/276304.276318 · Cited by 402
Convergence Properties of the K-Means Algorithms
Bottou, L., & Bengio, Y. (1994) · Cited by 398
Learning Program Behavior Profiles for Intrusion Detection
Ghosh, A. K., Schwartzbard, A., & Schatz, M. X. (1999) · Cited by 394
Kohberger, R. C. (1994) · Technometrics · doi:10.1080/00401706.1994.10485770 · Cited by 389
Data Mining: New Challenges for Statisticians
Hand, D. J. (2000) · Social Science Computer Review · doi:10.1177/089443930001800407 · Cited by 389
A Data-Clustering Algorithm on Distributed Memory Multiprocessors
Dhillon, I. S., & Modha, D. S. (2002) · Lecture Notes in Computer Science · doi:10.1007/3-540-46502-2_13 · Cited by 386
Multidimensional clustering algorithms
Murtagh, F. D. (1985) · Cited by 386
Spatial clustering methods in data mining : A survey
Han, J. (2001) · Cited by 385
Feature Weighting in k-Means Clustering
Modha, D. S., & Spangler, W. S. (2003) · Machine Learning · doi:10.1023/a:1024016609528 · Cited by 382
Accelerating exact k-means algorithms with geometric reasoning
Pelleg, D., & Moore, A. (1999) · Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/312129.312248 · Cited by 377
On clusterings-good, bad and spectral
Kannan, R., Vempala, S., & Veta, A. (2002) · Proceedings 41st Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.2000.892125 · Cited by 372
A distribution-based clustering algorithm for mining in large spatial databases
Xu, X., Ester, M., Kriegel, H.-P., & Sander, J. (2002) · Proceedings 14th International Conference on Data Engineering · doi:10.1109/icde.1998.655795 · Cited by 352
A cluster algorithm for graphs
van Dongen, S. (2000) · Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands · Cited by 348
Constrained K-Means Clustering
Bennett, K. P., Bradley, P., & Demiriz, A. (2000) · Cited by 339
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
A Tabu search approach to the clustering problem
Al‐Sultan, K. S. (1995) · Pattern Recognition · doi:10.1016/0031-3203(95)00022-r · Cited by 304
Model selection for probabilistic clustering using cross-validated likelihood
Smyth, P. (2000) · Statistics and Computing · doi:10.1023/a:1008940618127 · Cited by 285
A self-organizing network for hyperellipsoidal clustering (HEC)
Mao, J., & Jain, A. K. (1996) · IEEE Transactions on Neural Networks · doi:10.1109/72.478389 · Cited by 281
Visualizing multi-dimensional clusters, trends, and outliers using star coordinates
Kandogan, E. (2001) · Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/502512.502530 · Cited by 264
The interestingness of deviations
Piatetsky-Shapiro, G., & Matheus, C. J. (1994) · Cited by 249
Fitting Equations to Data: Computer Analysis of Multifactor Data
Lucas, J. M., Daniel, C., & Wood, F. S. (1981) · Technometrics · doi:10.2307/1268046 · Cited by 225
Clustering through decision tree construction
Liu, B., Xia, Y., & Yu, P. S. (2000) · Proceedings of the ninth international conference on Information and knowledge management · doi:10.1145/354756.354775 · Cited by 225
Explaining basic categories: Feature predictability and information.
Corter, J. E., & Gluck, M. A. (1992) · Psychological Bulletin · doi:10.1037//0033-2909.111.2.291 · Cited by 223
Iterative Optimization and Simplification of Hierarchical Clusterings
Fisher, D. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.276 · Cited by 195
Unexpectedness as a measure of interestingness in knowledge discovery
Padmanabhan, B., & Tuzhilin, A. (1999) · Decision Support Systems · doi:10.1016/s0167-9236(99)00053-6 · Cited by 185
Bozdogan, H. (1994) · Proceedings of the First US/Japan Conference on the Frontiers of Statistical Modeling: An Informational Approach · doi:10.1007/978-94-011-0800-3_3 · Cited by 182
Clustering Based on Association Rule Hypergraphs
Han, E.-H. S., Karypis, G., Kumar, V., & Mobasher, B. (1997) · University of Minnesota Digital Conservancy (University of Minnesota) · Cited by 178
Spatial clustering in the presence of obstacles
Tung, A. K. H., Hou, J., & Han, J. (2002) · Proceedings 17th International Conference on Data Engineering · doi:10.1109/icde.2001.914848 · Cited by 162
Grid-clustering: an efficient hierarchical clustering method for very large data sets
Schikuta, E. (1996) · Proceedings - International Conference on Pattern Recognition/Proceedings/International Conference on Pattern Recognition · doi:10.1109/icpr.1996.546732 · Cited by 159
The Power of Word Clusters for Text Classification
Slonim, N., & Tishby, N. (2006) · Cited by 156
Small is beautiful: discovering the minimal set of unexpected patterns
Padmanabhan, B., & Tuzhilin, A. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347103 · Cited by 154
Clustering large datasets in arbitrary metric spaces
Ganti, V., Ramakrishnan, R., Gehrke, J. E., Powell, A. L., & French, J. C. (1999) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1999.754966 · Cited by 153
Very Fast EM-Based Mixture Model Clustering Using Multiresolution Kd-Trees
Moore, A. (1998) · Cited by 153
DuMouchel, W., Volinsky, C. T., Johnson, T. J., Cortes, C., & Pregibon, D. (1999) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/312129.312184 · Cited by 148
Using the fractal dimension to cluster datasets
Barbará, D., & Chen, P. (2000) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/347090.347145 · Cited by 147
Constraint-Based Clustering in Large Databases
Tung, A. K. H., Han, J., Lakshmanan, L. V. S., et al. (2001) · Lecture notes in computer science · doi:10.1007/3-540-44503-x_26 · Cited by 145
Percentage Points of a Test for Clusters
Engelman, L., & Hartigan, J. A. (1969) · Journal of the American Statistical Association · doi:10.1080/01621459.1969.10501084 · Cited by 145
A database interface for clustering in large spatial databases
Ester, M., Kriegel, H., & Xu, X. (1995) · Cited by 127
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
AN OVERVIEW OF COMBINATORIAL DATA ANALYSIS
Arabie, P., & Hubert, L. J. (1996) · WORLD SCIENTIFIC eBooks · doi:10.1142/9789812832153_0002 · Cited by 122
McCullagh, P. J., & Yang, J. (2008) · Bayesian Analysis · doi:10.1214/08-ba304 · Cited by 96
Data bubbles: quality preserving performance boosting for hierarchical clustering
Breunig, M. M., Kriegel, H., Kröger, P., & Sander, J. (2001) · ACM SIGMOD International Conference on Management of Data (SIGMOD) · doi:10.1145/375663.375672 · Cited by 82
Clustering spatial data using random walks
Harel, D., & Koren, Y. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502552 · Cited by 76
The BANG-clustering system: Grid-based data analysis
Schikuta, E., & Erhart, M. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052867 · Cited by 75
Feature Selection and Dualities in Maximum Entropy DiscriminationPreprint
Jebara, T., & Jaakkola, T. (2013) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.3865 · Cited by 74
Cadez, I. V., Smyth, P., & Mannila, H. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502523 · Cited by 66
STING+: an approach to active spatial data mining
Wang, W., Yang, J., & Muntz, R. R. (1999) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.1999.754914 · Cited by 63
Generalized K-Harmonic Means – Dynamic Weighting of Data in Unsupervised Learning
Zhang, B. (2001) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972719.6 · Cited by 53
Robust space transformations for distance-based operations
Knorr, E. M., Ng, R. T., & Zamar, R. H. (2001) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/502512.502532 · Cited by 50
Dignet: an unsupervised-learning clustering algorithm for clustering and data fusion
Thomopoulos, S. C. A., Bougoulias, D. K., & Wann, C.-D. D. (1995) · IEEE Transactions on Aerospace and Electronic Systems · doi:10.1109/7.366289 · Cited by 31
A Comparative Study of Self-organizing Clustering Algorithms Dignet and ART2
Wann, C.-D. D., & Thomopoulos, S. C. A. (1997) · Neural Networks · doi:10.1016/s0893-6080(96)00084-6 · Cited by 29
Learning Simple Relations: Theory and Applications
Berkhin, P., & Becher, J. D. (2002) · SIAM International Conference on Data Mining · doi:10.1137/1.9781611972726.25 · Cited by 28
Self-citationEfficient Algorithms For Normalized Edit Distance
Arslan, A. N., & Eğeci̇oğlu, Ö. (2000) · Cited by 27
Cited by
(2007) · doi:10.5555/1283383.1283494 · Cited by 7,364
Survey of Clustering Algorithms
Xu, R., & WunschII, D. (2005) · IEEE Transactions on Neural Networks · doi:10.1109/tnn.2005.845141 · Cited by 6,197
Subspace clustering for high dimensional data: a review
Parsons, L., Haque, E., & Liu, H. (2004) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1007730.1007731 · Cited by 1,346
Grey wolf optimizer: a review of recent variants and applications
Faris, H., Aljarah, I., Al-Betar, M. A., & Mirjalili, S. (2018) · Neural Computing and Applications · doi:10.1007/s00521-017-3272-5 · Cited by 1,180
A global averaging method for dynamic time warping, with applications to clustering
Petitjean, F., Ketterlin, A., & Gançarski, P. (2011) · Pattern Recognition · doi:10.1016/j.patcog.2010.09.013 · Cited by 1,138
Metadata
- Authors
- Berkhin, P.
- Venue
- Grouping Multidimensional Data
- Publisher
- Springer-Verlag
- Published
- 2006-02-01
- Pages
- 25-71
- OpenAlex
- W1501500081
- Cited by
- 2,804
- References
- 175
- FWCI
- 199.58
- 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.