The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
On-line LDA: Adaptive Topic Models for Mining Text Streams with Applications to Topic Detection and Tracking
Abstract
This paper presents Online Topic Model (OLDA), a topic model that automatically captures the thematic patterns and identifies emerging topics of text streams and their changes over time. Our approach allows the topic modeling framework, specifically the Latent Dirichlet Allocation (LDA) model, to work in an online fashion such that it incrementally builds an up-to-date model (mixture of topics per document and mixture of words per topic) when a new document (or a set of documents) appears. A solution based on the Empirical Bayes method is proposed. The idea is to incrementally update the current model according to the information inferred from the new stream of data with no need to access previous data. The dynamics of the proposed approach also provide an efficient mean to track the topics over time and detect the emerging topics in real time. Our method is evaluated both qualitatively and quantitatively using benchmark datasets. In our experiments, the OLDA has discovered interesting patterns by just analyzing a fraction of data at a time. Our tests also prove the ability of OLDA to align the topics across the epochs with which the evolution of the topics over time is captured. The OLDA is also comparable to, and sometimes better than, the original LDA in predicting the likelihood of unseen documents.
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
Book Review: Pattern Recognition and Machine Learning
Nasrabadi, N. M. (2007) · Journal of Electronic Imaging · doi:10.1117/1.2819119 · Cited by 22,066
Pattern Recognition and Machine Learning
(2006) · doi:10.1007/978-0-387-45528-0 · Cited by 9,824
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
Blei, D. M. (2012) · Communications of the ACM · doi:10.1145/2133806.2133826 · Cited by 5,516
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
(2000) · CrossRef Listing of Deleted DOIs · doi:10.1162/jmlr.2003.3.4-5.993 · Cited by 3,024
Blei, D. M., & Lafferty, J. D. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143859 · Cited by 2,386
Bursty and hierarchical structure in streams
Kleinberg, J. (2002) · Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/775047.775061 · Cited by 1,160
Topics over time: a non-Markov continuous-time model of topical trends
Wang, X., & McCallum, A. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150450 · Cited by 1,121
Steyvers, M., & Griffiths, T. (2015) · Handbook of Latent Semantic Analysis · doi:10.4324/9780203936399.ch21 · Cited by 1,011
Parameter estimation for text analysis
Heinrich, G. (2009) · Cited by 700
Discovering evolutionary theme patterns from text: an exploration of temporal text mining
Mei, Q., & Zhai, C. (2005) · Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining · doi:10.1145/1081870.1081895 · Cited by 524
Continuous Time Dynamic Topic Models
Wang, C., Blei, D. M., & Heckerman, D. E. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1206.3298 · Cited by 311
Modeling and predicting personal information dissemination behavior
Song, X., Lin, C., Tseng, B. L., & Sun, M. (2005) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1081870.1081925 · Cited by 87
Detect and track latent factors with online nonnegative matrix factorization
Cao, B., Shen, D., Sun, J.-T., et al. (2007) · Cited by 85
Using Incremental PLSI for Threshold-Resilient Online Event Analysis
Chou, T., & Chen, M. C. (2008) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2007.190702 · Cited by 61
Nallapati, R. M., Ditmore, S., Lafferty, J., & Ung, K. (2007) · ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD) · doi:10.1145/1281192.1281249 · Cited by 60
Cited by
Latent Dirichlet allocation (LDA) and topic modeling: models, applications, a survey
Jelodar, H., Wang, Y., Yuan, C., Feng, X., Jiang, X., Li, Y., & Zhao, L. (2019) · Multimedia Tools and Applications · doi:10.1007/s11042-018-6894-4 · Cited by 1,961
Information diffusion in online social networks: a survey
Guille, A., Hacid, H., Favre, C., & Zighed, D. A. (2013) · ACM SIGMOD Record · doi:10.1145/2503792.2503797 · Cited by 851
Accurate 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
BTM: Topic Modeling over Short Texts
Cheng, X., Yan, X., Lan, Y., & Guo, J. (2014) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2014.2313872 · Cited by 556
Günther, F., Rinaldi, L., & Marelli, M. (2019) · Perspectives on Psychological Science · doi:10.1177/1745691619861372 · Cited by 341
Metadata
- Authors
- AlSumait, L., Barbará, D., & Domeniconi, C.
- Venue
- 2008 Eighth IEEE International Conference on Data Mining
- Publisher
- IEEE
- Published
- 2008-12
- Pages
- 3-12
- ISSN
- 1550-4786 (ISSN-L)
- OpenAlex
- W2110642088
- Cited by
- 421
- References
- 18
- FWCI
- 8.68
- 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.