The DOI matches its Crossref record; 39 of the 39 references it cites were found in a registry or an index.
Topic and Role Discovery in Social Networks with Experiments on Enron and Academic Email
Open accessAbstract
Previous work in social network analysis (SNA) has modeled the existence of links from one entity to another, but not the attributes such as language content or topics on those links. We present the Author-Recipient-Topic (ART) model for social network analysis, which learns topic distributions based on the direction-sensitive messages sent between entities. The model builds on Latent Dirichlet Allocation (LDA) and the Author-Topic (AT) model, adding the key attribute that distribution over topics is conditioned distinctly on both the sender and recipient---steering the discovery of topics according to the relationships between people. We give results on both the Enron email corpus and a researcher's email archive, providing evidence not only that clearly relevant topics are discovered, but that the ART model better predicts people's roles and gives lower perplexity on previously unseen messages. We also present the Role-Author-Recipient-Topic (RART) model, an extension to ART that explicitly represents people's roles.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Statistical mechanics of complex networks
Albert, R., & Barabási, A.-L. (2002) · Reviews of Modern Physics · doi:10.1103/revmodphys.74.47 · Cited by 20,471
Social Network Analysis: Methods and Applications
Wasserman, S. S., & Faust, K. (1994) · Cited by 17,961
Blei, D. M., Ng, A. Y., & Jordan, M. I. (2002) · Advances in Neural Information Processing Systems 14 · doi:10.7551/mitpress/1120.003.0082 · Cited by 12,223
Griffiths, T. L., & Steyvers, M. (2004) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.0307752101 · Cited by 6,049
Stochastic blockmodels: First steps
Holland, P. W., Laskey, K. B., & Leinhardt, S. (1983) · Social Networks · doi:10.1016/0378-8733(83)90021-7 · Cited by 2,755
Unsupervised Learning by Probabilistic Latent Semantic Analysis
Hofmann, T. (2001) · Machine Learning · doi:10.1023/a:1007617005950 · Cited by 2,456
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
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
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
Kleinberg, J. M. (2000) · Nature · doi:10.1038/35022643 · Cited by 1,737
Six Degrees: The Science of a Connected Age
Watts, D. J. (2003) · Cited by 1,724
Structural equivalence of individuals in social networks
Lorrain, F., & White, H. C. (1971) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.1971.9989788 · Cited by 1,697
Social Network Analysis: Methods and Applications
Lazega, E., Wasserman, S., & Faust, K. (1995) · Revue Française de Sociologie · doi:10.2307/3322457 · Cited by 1,558
Six degrees: the science of a connected age
(2003) · Choice Reviews Online · doi:10.5860/choice.40-6452 · Cited by 1,362
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
Estimation and Prediction for Stochastic Blockstructures
Nowicki, K., & Snijders, T. A. B. (2001) · Journal of the American Statistical Association · doi:10.1198/016214501753208735 · Cited by 1,148
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
Self-citationIdentity and Search in Social Networks
Watts, D. J., Dodds, P. S., & Newman, M. E. J. (2002) · Science · doi:10.1126/science.1070120 · Cited by 1,052
Lafferty, J., & Blei, D. M. (2005) · neural information processing systems · Cited by 917
Statistical Mechanics of Complex Networks
(2003) · Lecture Notes in Physics · doi:10.1007/b12331 · Cited by 732
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
Self-citationHow to search a social network
Adamic, L., & Adar, E. (2005) · Social Networks · doi:10.1016/j.socnet.2005.01.007 · Cited by 606
Probabilistic author-topic models for information discovery
Steyvers, M., Smyth, P., Rosen-Zvi, M., & Griffiths, T. (2004) · Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1014052.1014087 · Cited by 572
Learning systems of concepts with an infinite relational model
Kemp, C., Tenenbaum, J. B., Griffiths, T. L., Yamada, T., & Ueda, N. (2006) · Cited by 550
Griffiths, T. L., Mark Steyvers, B., Blei, D. M., & Tenenbaum, J. B. (2004) · Cited by 501
Topical N-Grams: Phrase and Topic Discovery, with an Application to Information Retrieval
Wang, X., McCallum, A., & Wei, X. (2007) · Seventh IEEE International Conference on Data Mining (ICDM 2007) · doi:10.1109/icdm.2007.86 · Cited by 482
Self-citationMixed-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
Expectation-propagation for the generative aspect model
Minka, T. P., & Lafferty, J. (2002) · Cited by 439
The Enron Email Dataset Database Schema and Brief Statistical Report
Shetty, J., & Adibi, J. (2004) · Cited by 315
Information flow in social groups
Wu, F., Huberman, B. A., Adamic, L. A., & Tyler, J. R. (2004) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2004.01.030 · Cited by 306
Learning author-topic models from text corpora
Rosen-Zvi, M., Chemudugunta, C., Griffiths, T., Smyth, P., & Steyvers, M. (2010) · ACM Transactions on Information Systems · doi:10.1145/1658377.1658381 · Cited by 302
Topics over Time: A NonMarkov ContinuousTime Model of Topical Trends
Wang, X., & McCallum, A. (2006) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 291
Self-citationExpertise modeling for matching papers with reviewers
Mimno, D., & McCallum, A. (2007) · Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/1281192.1281247 · Cited by 257
Self-citationUnsupervised Learning by Probabilistic Latent Semantic Analysis
HofmannThomas (2001) · Machine Learning · doi:10.5555/599609.599631 · Cited by 220
Pachinko allocation: dag-structured mixture models of topic correlations
McCallum, A., & Li, W. (2007) · Cited by 143
Self-citationDiscovering Latent Classes in Relational Data
Kemp, C., Griffiths, T. L., & Tenenbaum, J. B. (2004) · Cited by 82
Stochastic link and group detection
Kubica, J., Moore, A., Schneider, J., & Yang, Y. (2002) · doi:10.5555/777092.777215 · Cited by 67
Pachinko Allocation: DAG-Structured Mixture Models of Topic Correlations
Li, W., & Mccallum, A. (2006) · ScholarWorks@UMassAmherst (University of Massachusetts Amherst) · Cited by 46
Self-citation
Cited by
Scientific collaboration and endorsement: Network analysis of coauthorship and citation networks
Ding, Y. (2011) · Journal of Informetrics · doi:10.1016/j.joi.2010.10.008 · Cited by 438
A Survey of Topic Modeling in Text Mining
Alghamdi, R., & Alfalqi, K. (2015) · International Journal of Advanced Computer Science and Applications · doi:10.14569/ijacsa.2015.060121 · Cited by 377
RolX: structural role extraction & mining in large graphs
Henderson, K., Gallagher, B., Eliassi-Rad, T., Tong, H., Basu, S., Akoglu, L., Koutra, D., Faloutsos, C., & Li, L. (2012) · Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining · doi:10.1145/2339530.2339723 · Cited by 376
Camacho, D., Panizo-LLedot, Á., Bello-Orgaz, G., Gonzalez-Pardo, A., & Cambria, E. (2020) · Information Fusion · doi:10.1016/j.inffus.2020.05.009 · Cited by 329
Echoes of power: language effects and power differences in social interaction
Danescu-Niculescu-Mizil, C., Lee, L., Pang, B., & Kleinberg, J. (2012) · Proceedings of the 21st international conference on World Wide Web · doi:10.1145/2187836.2187931 · Cited by 285
Metadata
- Authors
- McCallum, A., Wang, X., & Corrada-Emmanuel, A.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2007-10-13
- Volume
- 30
- Pages
- 249-272
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2131689821
- Cited by
- 447
- References
- 39
- FWCI
- 20.09
- Type
- journal article
- Language
- en
- Open access
- diamond
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.