Student or educator? Sign up with your school email and get 6 months of Pro free.
CoChat
Sign Up
Cited by 9,368

The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.

Data clustering: 50 years beyond K-means

Jain, Anil K.·2010·Pattern Recognition Letters
DOI 10.1016/j.patrec.2009.09.011
Open this paper in CoChat — free account

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.patrec.2009.09.011

Cites

7 of 7 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 7 references

Research works printed but not linked: 111

  1. Aggarwal, Charu C., Han, Jiawei, Wang, Jianyong, Yu, Philip S., 2003. A framework for clustering evolving data streams. In: Proc. 29th Internat. Conf. on Very Large Data Bases, pp. 81–92. · DOI · Paper page
  2. Agrawal, Rakesh, Gehrke, Johannes, Gunopulos, Dimitrios, Raghavan, Prabhakar, 1998. Automatic subspace clustering of high dimensional data for data mining applications. In: Proc. ACM SIGMOD, pp. 94–105. · DOI · Paper page
  3. Backstrom, L., Huttenlocher, D., Kleinberg, J., Lan, X., 2006. Group formation in large social networks: Membership, growth, and evolution. In: Proc. 12th KDD. · DOI · Paper page
  4. Banerjee, Arindam, Basu, Sugato, Merugu, Srujana, 2007a. Multi-way clustering on relation graphs. In: Proc. 7th SIAM Internat. Conf. on Data Mining. · DOI
  5. Banerjee, S., Ramanathan, K., Gupta, A., 2007b. Clustering short texts using Wikipedia. In: Proc. SIGIR. · DOI · Paper page
  6. Bar-Hillel, Aaron, Hertz, T., Shental, Noam, Weinshall, Daphna, 2003. Learning distance functions using equivalence relations. In: Proc. 20th Internat. Conf. on Machine Learning, pp. 11–18.
  7. Basu, Sugato, Banerjee, Arindam, Mooney, Raymond, 2002. Semi-supervised clustering by seeding. In: Proc. 19th Internat. Conf. on Machine Learning.
  8. Basu, Sugato, Bilenko, Mikhail, Mooney, Raymond J., 2004. A probabilistic framework for semi-supervised clustering. In: Proc. 10th KDD, pp. 59–68. · DOI · Paper page
  9. Basu, Sugato, Davidson, Ian, Wagstaff, Kiri (Eds.), 2008. Constrained Clustering: Advances in Algorithms, Theory and Applications. Data Mining and Knowledge Discovery, vol. 3, Chapman & Hall/CRC.
  10. Bekkerman, Ron, El-Yaniv, Ran, McCallum, Andrew, 2005. Multi-way distributional clustering via pairwise interactions. In: Proc. 22nd Internat. Conf. Machine Learning, pp. 41–48. · DOI
  11. Belkin, Mikhail, Niyogi, Partha, 2002. Laplacian eigenmaps and spectral techniques for embedding and clustering. Advances in Neural Information Processing Systems, vol. 14. pp. 585–591. · DOI · Paper page
  12. Ben-David, S., Ackerman, M., 2008. Measures of clustering quality: A working set of axioms for clustering. Advances in Neural Information Processing Systems.
  13. Bhatia, 1998, Conceputal clustering in information retrieval, IEEE Trans. Systems Man Cybernet., 28, 427, 10.1109/3477.678640 · DOI
  14. Blei, 2003, Latent dirichlet allocation, J. Machine Learn. Res., 3, 993
  15. Bradley, P.S., Fayyad, U., Reina, C., 1998. Scaling clustering algorithms to large databases. In: Proc. 4th KDD.
  16. Buhler, 2001, Efficient large-scale sequence comparison by locality-sensitive hashing, Bioinformatics, 17, 419, 10.1093/bioinformatics/17.5.419 · DOI · Paper page
  17. Busse, Ludwig M., Orbanz, Peter, Buhmann, Joachim M., 2007. Cluster analysis of heterogeneous rank data. In: Proc. 24th Internat. Conf. on Machine Learning, pp. 113–120. · DOI
  18. Cao, F., Ester, M., Qian, W., Zhou, A., 2006. Density-based clustering over an evolving data stream with noise. In: Proc. SIAM Conf. Data Mining. · DOI · Paper page
  19. Cheng, Yizong, Church, George M., 2000. Biclustering of expression data. In: Proc. Eighth Internat. Conf. on Intelligent Systems for Molecular Biology, AAAI Press, pp. 93–103.
  20. Connell, 2002, Writer adaptation for online handwriting recognition, IEEE Trans. Pattern Anal. Machine Intell., 24, 329, 10.1109/34.990135 · doi:10.1109/34.990135
  21. Datta, Ritendra, Joshi, Dhiraj, Li, Jia, Wang, James Z., 2008. Image retrieval: Ideas, influences, and trends of the new age. ACM Computing Surveys 40 (2) (Article 5). · DOI · Paper page
  22. Dhillon, I., Modha, D., 1999. A data-clustering algorithm on distributed memory multiprocessors. In: Proc. KDD’99 Workshop on High Performance Knowledge Discovery, pp. 245–260. · DOI · Paper page
  23. Dhillon, Inderjit S., Mallela, Subramanyam, Guyon, Isabelle, Elisseeff, André, 2003. A divisive information-theoretic feature clustering algorithm for text classification. J. Machine Learn. Res. 3, 2003. · doi:10.1145/956755.956764 · Paper page
  24. Dhillon, Inderjit S., Guan, Yuqiang, Kulis, Brian, 2004. Kernel k-means: Spectral clustering and normalized cuts. In: Proc. 10th KDD, pp. 551–556. · DOI · Paper page
  25. Ding, Chris, He, Xiaofeng, Simon, Horst D., 2005. On the equivalence of nonnegative matrix factorization and spectral clustering. In: Proc. SIAM Internat. Conf. on Data Mining, pp. 606–610. · DOI · Paper page
  26. Drineas, 1999, Clustering large graphs via the singular value decomposition, Machine Learn., 56, 9
  27. Dubes, 1976, Clustering techniques: User’s dilemma, Pattern Recognition, 247, 10.1016/0031-3203(76)90045-5 · doi:10.1016/0031-3203(76)90045-5
  28. Dunn, 1973, A fuzzy relative of the ISODATA process and its use in detecting compact well-separated clusters, J. Cybernet., 3, 32, 10.1080/01969727308546046 · DOI · Paper page
  29. Eschrich, S., Ke, Jingwei, Hall, L.O., Goldgof, D.B., 2003. Fast accurate fuzzy clustering through data reduction. IEEE Trans. Fuzzy Systems 11 (2), 262–270. · DOI
  30. Ester, Martin, Peter Kriegel, Hans, S., Jörg, Xu, Xiaowei, 1996. A density-based algorithm for discovering clusters in large spatial databases with noise. In: Proc. 2nd KDD, AAAI Press.
  31. Ferguson, 1973, A Bayesian analysis of some nonparametric problems, Ann. Statist., 1, 209, 10.1214/aos/1176342360 · DOI · Paper page
  32. Figueiredo, 2002, Unsupervised learning of finite mixture models, IEEE Trans. Pattern Anal. Machine Intell., 24, 381, 10.1109/34.990138 · DOI · Paper page
  33. Figueiredo, M.A.T., Chang, D.S., Murino, V., 2006. Clustering under prior knowledge with application to image segmentation. Adv. Neural Inform. Process. Systems 19, 401–408. · doi:10.7551/mitpress/7503.003.0055
  34. Fisher, 1987, Knowledge acquisition via incremental conceptual clustering, Machine Learn., 139, 10.1007/BF00114265 · DOI · Paper page
  35. Fisher, L., vanNess, J., 1971. Admissible clustering procedures. Biometrika. · doi:10.2307/2334320
  36. Forgy, 1965, Cluster analysis of multivariate data: Efficiency vs. interpretability of classifications, Biometrics, 21, 768
  37. Frank, Ildiko E., Todeschini, Roberto, 1994. Data Analysis Handbook. Elsevier Science Inc., pp. 227–228.
  38. Fred, A., Jain, A.K., 2002. Data clustering using evidence accumulation. In: Proc. Internat. Conf. Pattern Recognition (ICPR).
  39. Frigui, 1999, A robust competitive clustering algorithm with applications in computer vision, IEEE Trans. Pattern Anal. Machine Intell., 21, 450, 10.1109/34.765656 · DOI · Paper page
  40. Google Scholar, 2009 (February). Google Scholar. <http://scholar.google.com>.
  41. Guha, Sudipto, Rastogi, Rajeev, Shim, Kyuseok, 1998. CURE: An efficient clustering algorithm for large databases. In: Proc. ICDM., pp. 73–84. · DOI · Paper page
  42. Guha, 2000, Rock: A robust clustering algorithm for categorical attributes, Inform. Systems, 25, 345, 10.1016/S0306-4379(00)00022-3 · DOI · Paper page
  43. Guha, Sudipto, Meyerson, A., Mishra, Nina, Motwani, Rajeev, O’Callaghan, L., 2003a. Clustering data streams: Theory and practice. Trans. Knowledge Discovery Eng. · DOI · Paper page
  44. Guha, 2003, Clustering data streams, IEEE Trans. Knowledge Data Eng., 15, 515, 10.1109/TKDE.2003.1198387 · DOI · Paper page
  45. Hagen, 1992, New spectral methods for ratio cut partitioning and clustering, IEEE Trans. Comput.-Aid. Des. Integrated Circuits Systems, 11, 1074, 10.1109/43.159993 · DOI · Paper page
  46. Hansen, 2001, Model selection and the principle of minimum description length, J. Amer. Statist. Assoc., 96, 746, 10.1198/016214501753168398 · DOI · Paper page
  47. Har-peled, Sariel, Mazumdar, Soham, 2004. Coresets for k-means and k-median clustering and their applications. In: Proc. 36th Annu. ACM Sympos. Theory Comput., pp. 291–300. · DOI
  48. Hartigan, 1972, Direct clustering of a data matrix, J. Amer. Statist. Assoc., 67, 123, 10.2307/2284710 · DOI
  49. Hofmann, 1997, Pairwise data clustering by deterministic annealing, IEEE Trans. Pattern Anal. Machine Intell., 19, 1, 10.1109/34.566806 · DOI · Paper page
  50. Hore, 2009, A scalable framework for cluster ensembles, Pattern Recognition, 42, 676, 10.1016/j.patcog.2008.09.027 · DOI
  51. Hore, 2009, A scalable framework for segmenting magnetic resonance images, J. Signal Process. Systems, 54, 183, 10.1007/s11265-008-0243-1 · DOI
  52. Hotho, A., Staab, S., Stumme, G., 2003. Ontologies to improve text document clustering. In: Proc. of the ICDM.
  53. Hu, 2007, Statistical methods for automated generation of service engagement staffing plans, IBM J. Res. Dev., 51, 281, 10.1147/rd.513.0281 · doi:10.1147/rd.513.0281
  54. Iwayama, M., Tokunaga, T., 1995. Cluster-based text categorization: A comparison of category search strategies. In: Proc. 18th ACM Internat. Conf. on Research and Development in Information Retrieval, pp. 273–281. · doi:10.1145/215206.215371
  55. Jain, A.K., Topchy, A., Law, M.H.C., Buhmann, J.M., 2004. Landscape of clustering algorithms. In: Proc. Internat. Conf. on Pattern Recognition, vol. 1, pp. 260–263. · doi:10.1109/icpr.2004.1334073
  56. JSTOR, 2009. JSTOR. <http://www.jstor.org>.
  57. Karypis, George, Kumar, Vipin, 1995. A fast and high quality multilevel scheme for partitioning irregular graphs. In: Proc. Internat. Conf. on Parallel Processing, pp. 113–122.
  58. Kashima, H., Tsuda, K., Inokuchi, A., 2003. Marginalized Kernels between labeled graphs. In: Proc. 20th Internat. Conf. on Machine Learning, pp. 321–328.
  59. Kashima, H., Hu, J., Ray, B., Singh, M., 2008. K-means clustering of proportional data using L1 distance. In: Proc. Internat. Conf. on Pattern Recognition, pp. 1–4. · doi:10.1109/icpr.2008.4760982
  60. Kaufman, Leonard, Rousseeuw, Peter J., 2005. Finding groups in data: An introduction to cluster analysis. Wiley series in Probability and Statistics.
  61. Kleinberg, Jon, 2002. An impossibility theorem for clustering. In: NIPS 15. pp. 463–470.
  62. Kollios, 2003, Efficient biased sampling for approximate clustering and outlier detection in large data sets, IEEE Trans. Knowledge Data Eng., 15, 1170, 10.1109/TKDE.2003.1232271 · DOI
  63. Lange, 2004, Stability-based validation of clustering solutions, Neural Comput., 16, 1299, 10.1162/089976604773717621 · DOI · Paper page
  64. Lange, T., Law, M.H., Jain, A.K., Buhmann, J., 2005. Learning with constrained and unlabelled data. IEEE Comput. Soc. Conf. Comput. Vision Pattern Recognition 1, 730–737. · DOI
  65. Law, Martin, Topchy, Alexander, Jain, A.K., 2005. Model-based clustering with probabilistic constraints.In: Proc. SIAM Conf. on Data Mining, pp. 641–645. · DOI
  66. Lee, Jung-Eun, Jain, Anil K., Jin, Rong, 2008. Scars, marks and tattoos (SMT): Soft biometric for suspect and victim identification. In: Proceedings of the Biometric Symposium. · DOI
  67. Li, W., McCallum, A., 2006. Pachinko allocation: Dag-structured mixture models of topic correlations. In: Proc. 23rd Internat. Conf. on Machine Learning, pp. 577–584. · DOI · Paper page
  68. Liu, J., Wang, W., Yang, J., 2004. A framework for ontology-driven subspace clustering. In: Proc. KDD. · DOI
  69. Liu, Yi, Jin, Rong, Jain, A.K., 2007. Boostcluster: Boosting clustering by pairwise constraints. In: Proc. 13th KDD, pp. 450–459. · doi:10.1145/1281192.1281242
  70. Lloyd, 1982, Least squares quantization in PCM, IEEE Trans. Inform. Theory, 28, 129, 10.1109/TIT.1982.1056489 · DOI · Paper page
  71. Lu, 2007, Penalized probabilistic clustering, Neural Comput., 19, 1528, 10.1162/neco.2007.19.6.1528 · DOI
  72. Lukashin, 2003, Topology of gene expression networks as revealed by data mining and modeling, Bioinformatics, 19, 1909, 10.1093/bioinformatics/btg333 · doi:10.1093/bioinformatics/btg333
  73. Mallows, 1957, Non-null ranking models, Biometricka, 44, 114, 10.1093/biomet/44.1-2.114 · DOI · Paper page
  74. Mao, 1996, A self-organizing network for hyper-ellipsoidal clustering (HEC), IEEE Trans. Neural Networks, 7, 16
  75. Meila, Marina, 2003. Comparing clusterings by the variation of information. In: COLT, pp. 173–187. · DOI · Paper page
  76. Meila, Marina, 2006. The uniqueness of a good optimum for k-means. In: Proc. 23rd Internat. Conf. Machine Learning, pp. 625–632. · doi:10.1145/1143844.1143923
  77. Meila, Marina, Shi, Jianbo, 2001. A random walks view of spectral segmentation. In: Proc. AISTATAS.
  78. Moore, Andrew W., 1998. Very fast EM-based mixture model clustering using multiresolution kd-trees. In: NIPS, pp. 543–549.
  79. Motzkin, 1965, Maxima for graphs and a new proof of a theorem of Turan, Canadian J. Math., 17, 533, 10.4153/CJM-1965-053-6 · DOI · Paper page
  80. Muja, M., Lowe, D.G., 2009. Fast approximate nearest neighbors with automatic algorithm configuration. In: Proc. Internat. Conf. on Computer Vision Theory and Applications (VISAPP’09).
  81. Ng, Andrew Y., Jordan, Michael I., Weiss, Yair, 2001. On spectral clustering: Analysis and an algorithm. Adv. Neural Inform. Process. Systems, vol. 14. MIT Press, pp. 849–856.
  82. Pampalk, Elias, Dixon, Simon, Widmer, Gerhard, 2003. On the evaluation of perceptual similarity measures for music. In: Proc. Sixth Internat. Conf. on Digital Audio Effects (DAFx-03). pp. 7–12.
  83. Pavan, Massimilliano, Pelillo, Marcello, 2007. Dominant sets and pairwise clustering. IEEE Trans. Pattern Anal. Machine Intell. 29 (1), 167–172. · DOI
  84. Pelleg Dan, Moore Andrew, 1999. Accelerating exact k-means algorithms with geometric reasoning. In: Chaudhuri Surajit, Madigan David (Eds.), Proc. Fifth Internat. Conf. on Knowledge Discovery in Databases, AAAI Press, pp. 277–281. · DOI · Paper page
  85. Pelleg, Dan, Moore, Andrew, 2000. X-means: Extending k-means with efficient estimation of the number of clusters. In: Proc. Seventeenth Internat. Conf. on Machine Learning. pp. 727–734.
  86. Philbin, J., Chum, O., Isard, M., Sivic, J., Zisserman, A., 2007. Object retrieval with large vocabularies and fast spatial matching. In: Proc. IEEE Conf. on Computer Vision and Pattern Recognition. · DOI · Paper page
  87. Rasmussen, 2000, The infinite gaussian mixture model, Adv. Neural Inform. Process. Systems, 12, 554
  88. Roberts Stephen J., Holmes, Christopher, Denison, Dave, 2001. Minimum-entropy data clustering using reversible jump Markov chain Monte Carlo. In: Proc. Internat. Conf. Artificial Neural Networks. pp. 103–110. · DOI
  89. Sahami, Mehran, 1998. Using Machine Learning to Improve Information Access. Ph.D. Thesis, Computer Science Department, Stanford University.
  90. Sammon, 1969, A nonlinear mapping for data structure analysis, IEEE Trans. Comput., 18, 401, 10.1109/T-C.1969.222678 · DOI · Paper page
  91. Scholkopf, 1998, Nonlinear component analysis as a kernel eigenvalue problem, Neural Comput., 10, 1299, 10.1162/089976698300017467 · DOI · Paper page
  92. Shamir, Ohad, Tishby, Naftali, 2008. Cluster stability for finite samples. Adv. Neural Inform. Process. Systems 20, 1297–1304.
  93. Shi, 2000, Normalized cuts and image segmentation, IEEE Trans. Pattern Anal. Machine Intell., 22, 888, 10.1109/34.868688 · DOI · Paper page
  94. Sindhwani, V., Hu, J., Mojsilovic, A., 2008. Regularized co-clustering with dual supervision. In: Advances in Neural Information Processing Systems.
  95. Smith, 1984, Testing for uniformity in multidimensional data, IEEE Trans. Pattern Anal. Machine Intell., 6, 73, 10.1109/TPAMI.1984.4767477 · doi:10.1109/tpami.1984.4767477
  96. Steinbach, M., Karypis, G., Kumar, V., 2000. A comparison of document clustering techniques. In: KDD Workshop on Text Mining.
  97. Steinbach, Michael, Tan, Pang-Ning, Kumar, Vipin, Klooster, Steve, Potter, Christopher, 2003. Discovery of climate indices using clustering. In: Proc. Ninth ACM SIGKDD Internat. Conf. on Knowledge Discovery and Data Mining. · DOI
  98. Steinhaus, 1956, Sur la division des corp materiels en parties, Bull. Acad. Polon. Sci., IV, 801
  99. Strehl, 2003, Cluster ensembles – A knowledge reuse framework for combining multiple partitions, J. Machine Learn. Res., 3, 583
  100. Tan, Pang-Ning, Steinbach, Michael, Kumar, Vipin, 2005. Introduction to Data Mining, first ed. Addison-Wesley Longman Publishing Co. Inc., Boston, MA, USA.
  101. Taskar, B., Segal, E., Koller, D., 2001. Probabilistic clustering in relational data. In: Proc. Seventeenth Internat. Joint Conf. on Artificial Intelligence (IJCAI), pp. 870–887.
  102. Tishby, Naftali, Pereira, Fernando C., Bialek, William, 1999. The information bottleneck method. In: Proc. 37th Allerton Conf. on Communication, Control and Computing, pp. 368–377.
  103. Tsuda, Koji, Kudo, Taku, 2006. Clustering graphs by weighted substructure mining. In: Proc. 23rd Internat. Conf. on Machine Learning. pp. 953–960. · doi:10.1145/1143844.1143964
  104. Umeyama, 1988, An eigen decomposition approach to weighted graph matching problems, IEEE Trans. Pattern Anal. Machine Intell., 10, 695, 10.1109/34.6778 · DOI · Paper page
  105. von Luxburg, U., David, Ben S., 2005. Towards a statistical theory of clustering. In: Pascal Workshop on Statistics and Optimization of Clustering.
  106. Wallace, 1968, An information measure for classification, Comput. J., 11, 185, 10.1093/comjnl/11.2.185 · DOI · Paper page
  107. Wallace, 1987, Estimation and inference by compact coding (with discussions), JRSSB, 49, 240, 10.1111/j.2517-6161.1987.tb01695.x · DOI · Paper page
  108. Welling, 2005, Exponential family harmoniums with an application to information retrieval, Adv. Neural Inform. Process. Systems, 17, 1481
  109. White, Scott, Smyth, Padhraic, 2005. A spectral clustering approach to finding communities in graph. In: Proc. SIAM Data Mining. · DOI · Paper page
  110. Yu, Stella X., Shi, Jianbo, 2003. Multiclass spectral clustering. In: Proc. Internat. Conf. on Computer Vision, pp. 313–319. · DOI · Paper page
  111. Zhang, Tian, Ramakrishnan, Raghu, Livny, Miron. 1996. BIRCH: An efficient data clustering method for very large databases. In: Proc.1996 ACM SIGMOD Internat. Conf. on Management of data, vol. 25, pp. 103–114.

Cited by

Metadata

Authors
Jain, A. K.
Venue
Pattern Recognition Letters
Publisher
Elsevier BV
Published
2010-06
Volume
31
Issue
8
Pages
651-666
ISSN
0167-8655 (ISSN-L)
DOI
10.1016/j.patrec.2009.09.011
OpenAlex
W2011430131
Cited by
9,368
References
7
FWCI
138.43
Type
journal article
Language
en
Open access
closed
Licence
www.elsevier.com/tdm/userlicense/1.0/ (tdm)

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.