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.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
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.
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
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
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 9,680
(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
Probabilistic latent semantic indexing
Hofmann, T. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312649 · Cited by 3,976
Gordon, A. D., & Hartigan, J. A. (1976) · Journal of the American Statistical Association · doi:10.2307/2286880 · Cited by 2,569
Information Retrieval: Data Structures and Algorithms
Frakes, W. B., & Baeza-Yates, R. A. (1992) · Cited by 2,393
Human behavior and the principle of least effort.
indicated, N. A. (1949) · Journal of Consulting Psychology · doi:10.1037/h0052803 · Cited by 1,565
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
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
Syntactic clustering of the Web
Broder, A. Z., Glassman, S. C., Manasse, M. S., & Zweig, G. (1997) · Computer Networks and ISDN Systems · doi:10.1016/s0169-7552(97)00031-7 · Cited by 1,343
On the self-similar nature of Ethernet traffic
Leland, W. E., Taqqu, M. S., Willinger, W., & Wilson, D. V. (1993) · Conference proceedings on Communications architectures, protocols and applications · doi:10.1145/166237.166255 · Cited by 1,077
Web document clustering: a feasibility demonstration
Zamir, O., & Etzioni, O. (1998) · Proceedings of the 21st annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/290941.290956 · Cited by 1,055
Pattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
Scatter/Gather: a cluster-based approach to browsing large document collections
Cutting, D. R., Karger, D. R., Pedersen, J. O., & Tukey, J. W. (1992) · Proceedings of the 15th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '92 · doi:10.1145/133160.133214 · Cited by 953
Numerical methods for computing angles between linear subspaces
Björck, Ȧ., & Golub, G. H. (1973) · Mathematics of Computation · doi:10.1090/s0025-5718-1973-0348991-3 · Cited by 865
Latent semantic indexing: a probabilistic analysis
Papadimitriou, C. H., Tamaki, H., Raghavan, P., & Vempala, S. (1998) · Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems · doi:10.1145/275487.275505 · Cited by 863
Pivoted Document Length Normalization
Singhal, A., Buckley, C., & Mitra, M. (2017) · ACM SIGIR Forum · doi:10.1145/3130348.3130365 · Cited by 848
Reexamining the cluster hypothesis: scatter/gather on retrieval results
Hearst, M. A., & Pedersen, J. O. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243216 · Cited by 822
Recent trends in hierarchic document clustering: A critical review
Willett, P. (1988) · Information Processing & Management · doi:10.1016/0306-4573(88)90027-1 · Cited by 705
Latent Semantic Indexing: A Probabilistic Analysis
Papadimitriou, C. H., Raghavan, P., Tamaki, H., & Vempala, S. (2000) · Journal of Computer and System Sciences · doi:10.1006/jcss.2000.1711 · Cited by 556
Pivoted document length normalization
Singhal, A., Buckley, C., & Mitra, M. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243206 · Cited by 551
RASMUSSEN, E. M. (1992) · Information Retrieval · Cited by 323
Quantization and the method ofk-means
Pollard, D. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056481 · Cited by 213
A Microeconomic View of Data Mining
Kleinberg, J., Papadimitriou, C., & Raghavan, P. (1998) · Data Mining and Knowledge Discovery · doi:10.1023/a:1009726428407 · Cited by 193
The complexity of the generalized Lloyd - Max problem (Corresp.)
Garey, M., Johnson, D., & Witsenhausen, H. (1982) · IEEE Transactions on Information Theory · doi:10.1109/tit.1982.1056488 · Cited by 191
Aggregate and mixed-order Markov models for statistical language processingPreprint
Saul, L. K., & Pereira, F. M. B. (1997) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9706007 · Cited by 148
On the self-similar nature of Ethernet traffic
Leland, W. E., Willinger, W., Taqqu, M. S., et al. (1995) · ACM SIGCOMM Computer Communication Review · doi:10.1145/205447.205464 · Cited by 145
Global convergence and empirical consistency of the generalized Lloyd algorithm
Sabin, M. J., & Gray, R. M. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057168 · Cited by 139
Density estimation by stochastic complexity
Rissanen, J., Speed, T. P., & Yu, B. (1992) · IEEE Transactions on Information Theory · doi:10.1109/18.119689 · Cited by 114
(1949) · Max Planck Digital Library
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
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.