The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Concept Decompositions for Large Sparse Text Data Using Clustering
Open accessOverview
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
Golub, G. (2012) · doi:10.56021/9781421407944 · Cited by 34,505
The Fractal Geometry of Nature
Mandelbrot, B. B., & Wheeler, J. A. (1983) · American Journal of Physics · doi:10.1119/1.13295 · Cited by 21,832
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
Indexing by latent semantic analysis
Deerwester, S., Dumais, S. T., Furnas, G. W., Landauer, T. K., & Harshman, R. (1990) · Journal of the American Society for Information Science · doi:10.1002/(sici)1097-4571(199009)41:6<391::aid-asi1>3.0.co;2-9 · Cited by 12,751
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Term-weighting approaches in automatic text retrieval
Salton, G., & Buckley, C. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90021-0 · Cited by 9,740
(1975) · CERN Document Server (European Organization for Nuclear Research) · Cited by 5,958
On the self-similar nature of Ethernet traffic (extended version)
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1994) · IEEE/ACM Transactions on Networking · doi:10.1109/90.282603 · Cited by 5,233
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
Probabilistic Latent Semantic Indexing
Hofmann, T. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130370 · Cited by 3,988
Cited by
Fast, sensitive and accurate integration of single-cell data with Harmony
Korsunsky, I., Millard, N., Fan, J., Slowikowski, K., Zhang, F., Wei, K., Baglaenko, Y., Brenner, M., Loh, P.-R., & Raychaudhuri, S. (2019) · Nature Methods · doi:10.1038/s41592-019-0619-0 · Cited by 10,488
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
Characterizing long COVID in an international cohort: 7 months of symptoms and their impact
Davis, H. E., Assaf, G. S., McCorkell, L., Wei, H., Low, R. J., Re'em, Y., Redfield, S., Austin, J. P., & Akrami, A. (2021) · eClinicalMedicine · doi:10.1016/j.eclinm.2021.101019 · Cited by 2,881
“Symptom time course clustering Symptom time courses were clustered using spherical k-means, a variant of k-means based on cosine distances [12].”
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
Self-citationOrthogonal nonnegative matrix t-factorizations for clustering
Ding, C., Li, T., Peng, W., & Park, H. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150420 · Cited by 1,245
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/153244303321897735 · Cited by 1,092
Information-theoretic co-clustering
Dhillon, I. S., Mallela, S., & Modha, D. S. (2003) · Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/956750.956764 · Cited by 1,006
Self-citationRokach, L., & Maimon, O. (2006) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/0-387-25465-x_15 · Cited by 906
A probabilistic framework for semi-supervised clustering
Basu, S., Bilenko, M., & Mooney, R. J. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014062 · Cited by 814
Clustering on the Unit Hypersphere using von Mises-Fisher Distributions
Banerjee, A., Dhillon, I. S., Ghosh, J., & Sra, S. (2005) · MPG.PuRe (Max Planck Society) · doi:10.5555/1046920.1088718 · Cited by 766
Self-citationPhan, X.-H., Nguyen, L.-M., & Horiguchi, S. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367510 · Cited by 740
Bickel, S., & Scheffer, T. (2005) · Fourth IEEE International Conference on Data Mining (ICDM'04) · doi:10.1109/icdm.2004.10095 · Cited by 710
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
SVD based initialization: A head start for nonnegative matrix factorization
Boutsidis, C., & Gallopoulos, E. (2008) · Pattern Recognition · doi:10.1016/j.patcog.2007.09.010 · Cited by 695
Chakrabarti, D., Kumar, R., & Tomkins, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150467 · Cited by 661
Hierarchical Clustering Algorithms for Document Datasets
Zhao, Y., Karypis, G., & Fayyad, U. (2005) · Data Mining and Knowledge Discovery · doi:10.1007/s10618-005-0361-3 · Cited by 627
Empirical and Theoretical Comparisons of Selected Criterion Functions for Document Clustering
Zhao, Y., & Karypis, G. (2004) · Machine Learning · doi:10.1023/b:mach.0000027785.44527.d6 · Cited by 611
Learning Feature Representations with K-Means
Coates, A., & Ng, A. Y. (2012) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-35289-8_30 · Cited by 601
A Survey of Text Clustering Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_4 · Cited by 581
Information retrieval on the web
Kobayashi, M., & Takeda, K. (2000) · ACM Computing Surveys · doi:10.1145/358923.358934 · Cited by 562
Wang, X., Ma, X., & Grimson, W. E. L. (2009) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.87 · Cited by 534
Data stream clustering: A survey
Silva, J. A., Faria, E. R., Barros, R. C., Hruschka, E. R., Carvalho, A. C. P. L. F. D., & Gama, J. (2013) · ACM Computing Surveys · doi:10.1145/2522968.2522981 · Cited by 508
The Challenges of Clustering High Dimensional Data
Steinbach, M., Ertöz, L., & Kumar, V. (2004) · New Directions in Statistical Physics · doi:10.1007/978-3-662-08968-2_16 · Cited by 508
A divisive information theoretic feature clustering algorithm for text classification
Dhillon, I. S., Mallela, S., & Kumar, R. (2003) · doi:10.5555/944919.944973 · Cited by 500
Self-citationDesigning structured tight frames via an alternating projection method
Tropp, J. A., Dhillon, I. S., Heath, R. W., & Strohmer, T. (2005) · IEEE Transactions on Information Theory · doi:10.1109/tit.2004.839492 · Cited by 494
Self-citationDouze, M., Guzhva, A., Deng, C., Johnson, J., Szilvasy, G., Mazaré, P.-E., Lomeli, M., Hosseini, L., & Jégou, H. (2026) · IEEE Transactions on Big Data · doi:10.1109/tbdata.2025.3618474 · Cited by 478
Symmetric Nonnegative Matrix Factorization for Graph Clustering
Kuang, D., Ding, C., & Park, H. (2012) · Proceedings of the 2012 SIAM International Conference on Data Mining · doi:10.1137/1.9781611972825.10 · Cited by 433
Generalized Low Rank Approximations of Matrices
Ye, J. (2005) · Machine Learning · doi:10.1007/s10994-005-3561-6 · Cited by 428
Characterizing Long COVID in an International Cohort: 7 Months of Symptoms and Their Impact
Davis, H. E., Assaf, G. S., McCorkell, L., Wei, H., Low, R. J., Re’em, Y., Redfield, S., Austin, J. P., & Akrami, A. (2020) · medRxiv · doi:10.1101/2020.12.24.20248802 · Cited by 387
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
Self-citationSeries in Machine Perception and Artificial Intelligence
(2012) · Series in machine perception and artificial intelligence · doi:10.1142/smpai · Cited by 365
Scene Summarization for Online Image Collections
Simon, I., Snavely, N., & Seitz, S. M. (2007) · 2007 IEEE 11th International Conference on Computer Vision · doi:10.1109/iccv.2007.4408863 · Cited by 339
Big Data as Complementary Audit Evidence
Yoon, K., Hoogduin, L., & Zhang, L. (2015) · Accounting Horizons · doi:10.2308/acch-51076 · Cited by 330
Classifier ensembles: Select real-world applications
Oza, N. C., & Tumer, K. (2008) · Information Fusion · doi:10.1016/j.inffus.2007.07.002 · Cited by 313
(2004) · Springer eBooks · doi:10.1007/978-1-4757-4305-0 · Cited by 310
Learning author-topic models from text corpora
Rosen-Zvi, M., Chemudugunta, C., Griffiths, T., Smyth, P., & Steyvers, M. (2010) · ACM Transactions on Information Systems · doi:10.1145/1658377.1658381 · Cited by 302
A Similarity Measure for Text Classification and Clustering
Lin, Y.-S., Jiang, J.-Y., & Lee, S.-J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2013.19 · Cited by 291
Hornik, K., Feinerer, I., Kober, M., & Buchta, C. (2012) · Journal of Statistical Software · doi:10.18637/jss.v050.i10 · Cited by 275
A survey of Clustering Algorithms
Rokach, L. (2009) · Data Mining and Knowledge Discovery Handbook · doi:10.1007/978-0-387-09823-4_14 · Cited by 245
Using natural language processing to analyse text data in behavioural science
Feuerriegel, S., Maarouf, A., Bär, D., Geissler, D., Schweisthal, J., Pröllochs, N., Robertson, C. E., Rathje, S., Hartmann, J., Mohammad, S. M., et al. (2025) · Nature Reviews Psychology · doi:10.1038/s44159-024-00392-z · Cited by 140
Metadata
- Authors
- Dhillon, I. S., & Modha, D. S.
- Venue
- Machine Learning
- Published
- 2001-01
- Volume
- 42
- Issue
- 1-2
- Pages
- 143-175
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W1790954942
- Cited by
- 1,293
- References
- 37
- FWCI
- 33.80
- Type
- journal article
- Language
- en
- Open access
- bronze
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.