The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Topic-link LDA: joint models of topic and author community
Abstract
Given a large-scale linked document collection, such as a collection of blog posts or a research literature archive, there are two fundamental problems that have generated a lot of interest in the research community. One is to identify a set of high-level topics covered by the documents in the collection; the other is to uncover and analyze the social network of the authors of the documents. So far these problems have been viewed as separate problems and considered independently from each other. In this paper we argue that these two problems are in fact inter-dependent and should be addressed together. We develop a Bayesian hierarchical approach that performs topic modeling and author community discovery in one unified framework. The effectiveness of our model is demonstrated on two blog data sets in different domains and one research paper citation data from CiteSeer.
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
An Introduction to Variational Methods for Graphical Models
Jordan, M. I., Ghahramani, Z., Jaakkola, T. S., & Saul, L. K. (1999) · Machine Learning · doi:10.1023/a:1007665907178 · Cited by 3,791
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
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
Automating the Construction of Internet Portals with Machine Learning
McCallum, A. K., Nigam, K., Rennie, J., & Seymore, K. (2000) · Information Retrieval · doi:10.1023/a:1009953814988 · Cited by 1,280
Inferring Web communities from link topology
Gibson, D., Kleinberg, J., & Raghavan, P. (1998) · Proceedings of the ninth ACM conference on Hypertext and hypermedia : links, objects, time and space---structure in hypermedia systems links, objects, time and space---structure in hypermedia systems - HYPERTEXT '98 · doi:10.1145/276627.276652 · Cited by 768
Graph mining: Laws, generators, and algorithms
Chakrabarti, D., & Faloutsos, C. (2006) · ACM Computing Surveys · doi:10.1145/1132952.1132954 · Cited by 609
Relational Topic Models for Document Networks
Chang, J., & Blei, D. M. (2009) · Cited by 507
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
The Missing Link - A Probabilistic Model of Document Content and Hypertext Connectivity
Cohn, D. A., & Hofmann, T. (2000) · Cited by 436
Topic modeling with network regularization
Mei, Q., Cai, D., Zhang, D., & Zhai, C. (2008) · Proceedings of the 17th international conference on World Wide Web · doi:10.1145/1367497.1367512 · Cited by 392
Topic and role discovery in social networks
McCallum, A., Corrada-Emmanuel, A., & Wang, X. (2005) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 287
Unsupervised prediction of citation influences
Dietz, L., Bickel, S., & Scheffer, T. (2007) · Proceedings of the 24th international conference on Machine learning · doi:10.1145/1273496.1273526 · Cited by 233
Stochastic Relational Models for Discriminative Link Prediction
Yu, K., Chu, W., Yu, S., Tresp, V., & Xu, Z. (2007) · Advances in Neural Information Processing Systems 19 · doi:10.7551/mitpress/7503.003.0199 · Cited by 199
Link-PLSA-LDA: A New Unsupervised Model for Topics and Influence of Blogs
Nallapati, R. M., & Cohen, W. W. (2021) · Proceedings of the International AAAI Conference on Web and Social Media · doi:10.1609/icwsm.v2i1.18621 · Cited by 126
Variational methods for inference and estimation in graphical models
Jaakkola, T., & Jordan, M. I. (1997) · Cited by 89
Cited by
Empirical study of topic modeling in Twitter
Hong, L., & Davison, B. D. (2010) · Proceedings of the First Workshop on Social Media Analytics · doi:10.1145/1964858.1964870 · Cited by 1,120
Inferring Networks of Substitutable and Complementary Products
McAuley, J., Pandey, R., & Leskovec, J. (2015) · Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining · doi:10.1145/2783258.2783381 · Cited by 645
“LDA associates each document in a corpus d ∈ T with a K -dimensional topic distribution θ d (a stochastic vector, i.e. , k θ d,k = 1 ), which encodes the fraction of words in d that discuss each of the K topics.”
MethodInfluentialCommunity Detection in Networks with Node Attributes
Yang, J., McAuley, J., & Leskovec, J. (2013) · 2013 IEEE 13th International Conference on Data Mining · doi:10.1109/icdm.2013.167 · Cited by 575
Discovering social circles in ego networks
Mcauley, J., & Leskovec, J. (2014) · ACM Transactions on Knowledge Discovery from Data · doi:10.1145/2556612 · Cited by 366
A survey of community search over big graphs
Fang, Y., Huang, X., Qin, L., Zhang, Y., Zhang, W., Cheng, R., & Lin, X. (2020) · The VLDB Journal · doi:10.1007/s00778-019-00556-x · Cited by 339
Metadata
- Authors
- Liu, Y., Niculescu-Mizil, A., & Gryc, W.
- Venue
- Proceedings of the 26th Annual International Conference on Machine Learning
- Publisher
- ACM
- Published
- 2009-06-14
- Pages
- 665-672
- OpenAlex
- W2130978632
- Cited by
- 288
- References
- 17
- FWCI
- 11.28
- 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.