The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Topics over time: a non-Markov continuous-time model of topical trends
Abstract
This paper presents an LDA-style topic model that captures not only the low-dimensional structure of data, but also how the structure changes over time. Unlike other recent work that relies on Markov assumptions or discretization of time, here each topic is associated with a continuous distribution over timestamps, and for each generated document, the mixture distribution over topics is influenced by both word co-occurrences and the document's timestamp. Thus, the meaning of a particular topic can be relied upon as constant, but the topics' occurrence and correlations change significantly over time. We present results on nine months of personal email, 17 years of NIPS research papers and over 200 years of presidential state-of-the-union addresses, showing improved topics, better timestamp prediction, and interpretable trends.
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
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., & Lafferty, J. D. (2006) · Proceedings of the 23rd international conference on Machine learning - ICML '06 · doi:10.1145/1143844.1143859 · Cited by 3,173
An introduction to MCMC for machine learning.
Andrieu, C., de Freitas, N., Doucet, A., & Jordan, M. I. (2003) · Machine Learning · doi:10.1023/a:1020281327116 · Cited by 2,451
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
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,337
The author-topic model for authors and documents
Rosen‐Zvi, M., Griffiths, T. L., Steyvers, M., & Smyth, P. (2004) · Uncertainty in Artificial Intelligence · doi:10.5555/1036843.1036902 · Cited by 1,280
A generalized probability density function for double-bounded random processes
Kumaraswamy, P. (1980) · Journal of Hydrology · doi:10.1016/0022-1694(80)90036-0 · Cited by 1,023
Griffiths, T. L., Mark Steyvers, B., Blei, D. M., & Tenenbaum, J. B. (2004) · Cited by 501
Mixed-membership models of scientific publications
Erosheva, E., Fienberg, S., & Lafferty, J. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307760101 · Cited by 442
Dynamic social network analysis using latent space models
Sarkar, P., & Moore, A. W. (2005) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1117454.1117459 · Cited by 422
Topic and role discovery in social networks
McCallum, A., Corrada-Emmanuel, A., & Wang, X. (2005) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 287
Self-citationModeling word burstiness using the Dirichlet distribution
Madsen, R. E., Kauchak, D., & Elkan, C. (2005) · Proceedings of the 22nd international conference on Machine learning - ICML '05 · doi:10.1145/1102351.1102420 · Cited by 280
Advances in Neural Information Processing Systems 17 (NIPS 2004)
Allan, M., & Williams, C. K. I. (2005) · Cited by 194
Continuous Time Bayesian Networks
Nodelman, U., Shelton, C. R., & Koller, D. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1301.0591 · Cited by 169
Proceedings of the 17th Conference in Uncertainty in Artificial Intelligence
Breese, J., & Koller, D. (2001) · Cited by 135
TimeMines : Constructing Timelines with Statistical Models of Word Usage
Swan, R. C. (2000) · Cited by 111
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
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
Group formation in large social networks: membership, growth, and evolution
Backstrom, L., Huttenlocher, D., Kleinberg, J., & Lan, X. (2006) · Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1150402.1150412 · Cited by 1,805
Meme-tracking and the dynamics of the news cycle
Leskovec, J., Backstrom, L., & Kleinberg, J. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557077 · Cited by 1,530
A biterm topic model for short texts
Yan, X., Guo, J., Lan, Y., & Cheng, X. (2013) · Proceedings of the 22nd international conference on World Wide Web · doi:10.1145/2488388.2488514 · Cited by 1,088
A review of topic modeling methods
Vayansky, I., & Kumar, S. A. P. (2020) · Information Systems · doi:10.1016/j.is.2020.101582 · Cited by 716
Metadata
- Authors
- Wang, X., & McCallum, A.
- Venue
- Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
- Publisher
- ACM
- Published
- 2006-08-20
- Pages
- 424-433
- OpenAlex
- W2171343266
- Cited by
- 1,121
- References
- 18
- FWCI
- 21.85
- 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.