The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Fast collapsed gibbs sampling for latent dirichlet allocation
Abstract
In this paper we introduce a novel collapsed Gibbs sampling method for the widely used latent Dirichlet allocation (LDA) model. Our new method results in significant speedups on real world text corpora. Conventional Gibbs sampling schemes for LDA require O(K) operations per sample where K is the number of topics in the model. Our proposed method draws equivalent samples but requires on average significantly less then K operations per sample. On real-word corpora FastLDA can be as much as 8 times faster than the standard collapsed Gibbs sampler for LDA. No approximations are necessary, and we show that our fast sampling scheme produces exactly the same results as the standard (but slower) sampling scheme. Experiments on four real world data sets demonstrate speedups for a wide range of collection sizes. For the PubMed collection of over 8 million documents with a required computation time of 6 CPU months for LDA, our speedup of 5.7 can save 5 CPU months of computation.
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
Multidimensional binary search trees used for associative searching
Bentley, J. L. (1975) · Communications of the ACM · doi:10.1145/361002.361007 · Cited by 7,520
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
Neural Information Processing Systems
(2018) · The Deep Learning Revolution · doi:10.7551/mitpress/11474.003.0014 · Cited by 3,730
X-means: Extending K-means with Efficient Estimation of the Number of Clusters
Pelleg, D., & Moore, A. (2000) · Cited by 2,245
Hierarchical Dirichlet Processes
Teh, Y. W., Jordan, M. I., Beal, M. J., & Blei, D. M. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000302 · Cited by 2,120
LDA-based document models for ad-hoc retrieval
Wei, X., & Croft, W. B. (2006) · Proceedings of the 29th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1148170.1148204 · Cited by 1,075
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
An efficient k-means clustering algorithm
Alsabti, K., Ranka, S., & Singh, V. K. (1997) · Syracuse University Libraries (Syracuse University) · Cited by 516
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
Distributed Inference for Latent Dirichlet Allocation
Newman, D. J., Smyth, P., Welling, M., & Asuncion, A. (2007) · Cited by 215
Self-citationModeling General and Specific Aspects of Documents with a Probabilistic Topic Model
Chemudugunta, C., Smyth, P., & Steyvers, M. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0035 · Cited by 186
Self-citationVery Fast EM-Based Mixture Model Clustering Using Multiresolution Kd-Trees
Moore, A. (1998) · Cited by 153
Pachinko allocation: dag-structured mixture models of topic correlations
McCallum, A., & Li, W. (2007) · Cited by 143
Efficient Multiscale Sampling from Products of Gaussian Mixtures
Ihler, A., Sudderth, E. B., Freeman, W. T., et al. (2003) · Cited by 87
Self-citationMimno, D., & McCallum, A. (2007) · ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL) · doi:10.1145/1255175.1255249 · Cited by 78
Bayesian k-Means as a “Maximization-Expectation” Algorithm
Kurihara, K., & Welling, M. (2009) · Neural Computation · doi:10.1162/neco.2008.12-06-421 · Cited by 67
Self-citationA Scalable Topic-Based Open Source Search Engine
Buntine, W., Löfström, J., Perkiö, J., Perttu, S., Poroshin, V., Silander, T., Tirri, K. A., Tuominen, A., & Tuulos, V. H. (2004) · doi:10.1109/wi.2004.12 · Cited by 28
Cited by
TwitterRank: finding topic-sensitive influential twitterers
Weng, J., Lim, E.-P., Jiang, J., & He, Q. (2010) · Proceedings of the third ACM international conference on Web search and data mining · doi:10.1145/1718487.1718520 · Cited by 1,742
Jumping NLP Curves: A Review of Natural Language Processing Research [Review Article]
Cambria, E., & White, B. (2014) · IEEE Computational Intelligence Magazine · doi:10.1109/mci.2014.2307227 · Cited by 1,102
topicmodels : An R Package for Fitting Topic Models
Grün, B., & Hornik, K. (2011) · Journal of Statistical Software · doi:10.18637/jss.v040.i13 · Cited by 1,072
“…allows to fit the LDA model is available through Infer.NET (Microsoft Corporation 2010) The fast collapsed Gibbs sampling method is described in Porteous, Asuncion, Newman, Ihler, Smyth, and Welling (2008) and code is also available from the first author’s web page (…”
MethodA review of topic modeling methods
Vayansky, I., & Kumar, S. A. P. (2020) · Information Systems · doi:10.1016/j.is.2020.101582 · Cited by 716
Advances in Variational Inference
Zhang, C., Butepage, J., Kjellstrom, H., & Mandt, S. (2019) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2018.2889774 · Cited by 671
Metadata
- Authors
- Porteous, I., Newman, D., Ihler, A., Asuncion, A., Smyth, P., & Welling, M.
- Venue
- Proceedings of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2008-08-24
- Pages
- 569-577
- OpenAlex
- W2146341620
- Cited by
- 560
- References
- 18
- FWCI
- 10.67
- 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.