The DOI matches its Crossref record; 38 of the 38 references it cites were found in a registry or an index.
Topic modeling with network regularization
Abstract
In this paper, we formally define the problem of topic modeling with network structure (TMN). We propose a novel solution to this problem, which regularizes a statistical topic model with a harmonic regularizer based on a graph structure in the data. The proposed method bridges topic modeling and social network analysis, which leverages the power of both statistical topic models and discrete regularization. The output of this model well summarizes topics in text, maps a topic on the network, and discovers topical communities. With concrete selection of a topic model and a graph-based regularizer, our model can be applied to text mining problems such as author-topic analysis, community discovery, and spatial text mining. Empirical experiments on two different genres of data show that our approach is effective, which improves text-oriented methods as well as network-oriented methods. The proposed model is general; it can be applied to any text collections with a mixture of topics and an associated network structure.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
(2003) · Journal of Machine Learning Research · doi:10.5555/944919.944937 · Cited by 32,337
Normalized cuts and image segmentation
Shi, J., & Malik, J. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868688 · Cited by 15,502
Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
Belkin, M., & Niyogi, P. (2003) · Neural Computation · doi:10.1162/089976603321780317 · Cited by 7,621
The EM Algorithm and Extensions
Kushary, D. (1998) · Technometrics · doi:10.1080/00401706.1998.10485534 · Cited by 5,417
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
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
Learning with Local and Global Consistency
Zhou, D., Bousquet, O., Lal, T. N., Weston, J., & Schölkopf, B. (2003) · MPG.PuRe (Max Planck Society) · Cited by 3,864
Semi-supervised learning using Gaussian fields and harmonic functions
Zhu, X., Zoubin Ghahramani, A., & Lafferty, J. (2003) · Cited by 3,509
Cited by
Recommender systems with social regularization
Ma, H., Zhou, D., Liu, C., Lyu, M. R., & King, I. (2011) · Proceedings of the fourth ACM international conference on Web search and data mining · doi:10.1145/1935826.1935877 · Cited by 1,626
Social influence analysis in large-scale networks
Tang, J., Sun, J., Wang, C., & Yang, Z. (2009) · Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1557019.1557108 · Cited by 927
Aggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
A Survey of Text Clustering Algorithms
Aggarwal, C. C., & Zhai, C. (2012) · Mining Text Data · doi:10.1007/978-1-4614-3223-4_4 · Cited by 581
Self-citationLabel Informed Attributed Network Embedding
Huang, X., Li, J., & Hu, X. (2017) · Proceedings of the Tenth ACM International Conference on Web Search and Data Mining · doi:10.1145/3018661.3018667 · Cited by 487
Mining Heterogeneous Information Networks: Principles and Methodologies
Sun, Y., & Han, J. (2012) · Synthesis lectures on data mining and knowledge discovery · doi:10.2200/s00433ed1v01y201207dmk005 · Cited by 471
Attributed Social Network Embedding
Liao, L., He, X., Zhang, H., & Chua, T.-S. (2018) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2018.2819980 · Cited by 440
Geographical topic discovery and comparison
Yin, Z., Cao, L., Han, J., Zhai, C., & Huang, T. (2011) · Proceedings of the 20th international conference on World wide web · doi:10.1145/1963405.1963443 · Cited by 315
Self-citationExploiting social context for review quality prediction
Lu, Y., Tsaparas, P., Ntoulas, A., & Polanyi, L. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772761 · Cited by 306
Topic-link LDA: joint models of topic and author community
Liu, Y., Niculescu-Mizil, A., & Gryc, W. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553460 · Cited by 288
Investigating task performance of probabilistic topic models: an empirical study of PLSA and LDA
Lu, Y., Mei, Q., & Zhai, C. (2011) · Information Retrieval · doi:10.1007/s10791-010-9141-9 · Cited by 259
Self-citationHierarchical relational models for document networks
Chang, J., & Blei, D. M. (2010) · The Annals of Applied Statistics · doi:10.1214/09-aoas309 · Cited by 255
Metadata
- Authors
- Mei, Q., Cai, D., Zhang, D., & Zhai, C.
- Venue
- Proceedings of the 17th international conference on World Wide Web
- Publisher
- ACM
- Published
- 2008-04-21
- Pages
- 101-110
- OpenAlex
- W2150461699
- Cited by
- 392
- References
- 38
- FWCI
- 19.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.