The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
On Finding the Natural Number of Topics with Latent Dirichlet Allocation: Some Observations
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
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Learning the parts of objects by non-negative matrix factorization
Lee, D. D., & Seung, H. S. (1999) · Nature · doi:10.1038/44565 · Cited by 13,868
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
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
The Approximation of One Matrix by Another of Lower Rank
Eckart, C., & Young, G. (1936) · Psychometrika · doi:10.1007/bf02288367 · Cited by 3,800
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/jmlr.2003.3.4-5.993 · Cited by 3,024
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
Why and Where: A Characterization of Data Provenance
Buneman, P., Khanna, S., & Wang-Chiew, T. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44503-x_20 · Cited by 1,334
Lafferty, J., & Blei, D. M. (2005) · neural information processing systems · Cited by 1,221
A density-based method for adaptive LDA model selection
Cao, J., Xia, T., Li, J., Zhang, Y., & Tang, S. (2009) · Neurocomputing · doi:10.1016/j.neucom.2008.06.011 · Cited by 880
Pachinko allocation: DAG-structured mixture models of topic correlations
Li, W., & McCallum, A. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143917 · Cited by 609
Sharing Clusters among Related Groups: Hierarchical Dirichlet Processes
Teh, Y. W., Jordan, M. I., Beal, M. J., & Blei, D. M. (2004) · UCL Discovery (University College London) · Cited by 589
Relation between PLSA and NMF and implications
Gaussier, E., & Goutte, C. (2005) · Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1076034.1076148 · Cited by 264
Pachinko allocation: dag-structured mixture models of topic correlations
McCallum, A., & Li, W. (2007) · Cited by 143
Asynchronous Distributed Learning of Topic Models
Smyth, P., Welling, M., & Asuncion, A. (2008) · Cited by 138
Cited by
SCENIC+: single-cell multiomic inference of enhancers and gene regulatory networks
Bravo González-Blas, C., De Winter, S., Hulselmans, G., Hecker, N., Matetovici, I., Christiaens, V., Poovathingal, S., Wouters, J., Aibar, S., & Aerts, S. (2023) · Nature Methods · doi:10.1038/s41592-023-01938-4 · Cited by 778
“- Arun_2010: Uses a density-based metric as in Arun et al (2010)105 using the topic-region distribution, the cell- topic distribution and the cell coverage.”
MethodAccurate and effective latent concept modeling for ad hoc information retrieval
Deveaud, R., SanJuan, E., & Bellot, P. (2014) · Document numérique · doi:10.3166/dn.17.1.61-84 · Cited by 609
Yang, D., Kleissl, J., Gueymard, C. A., Pedro, H. T. C., & Coimbra, C. F. M. (2018) · Solar Energy · doi:10.1016/j.solener.2017.11.023 · Cited by 548
Gao, S., Janowicz, K., & Couclelis, H. (2017) · Transactions in GIS · doi:10.1111/tgis.12289 · Cited by 468
Text Mining in Organizational Research
Kobayashi, V. B., Mol, S. T., Berkers, H. A., Kismihók, G., & Den Hartog, D. N. (2018) · Organizational Research Methods · doi:10.1177/1094428117722619 · Cited by 275
Metadata
- Authors
- Arun, R., Suresh, V., Veni Madhavan, C. E., & Narasimha Murthy, M. N.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 391-402
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W1927727507
- Cited by
- 719
- References
- 17
- FWCI
- 3.12
- Type
- conference paper
- 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.