Modeling relational events via latent classes

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn , Issue , 2010, Pages 803-812

  DuBois, Christopher ^a   Smyth, Padhraic ^b  

^a Ringgold Standard Institution Informatics   (United States)

^b Irvine   (United States)

Author keywords

Collapsed Gibbs sampling; Relational data

Indexed keywords

ANIMAL BEHAVIOR; DYADIC INTERACTION; EMAIL COMMUNICATION; EXPECTATION-MAXIMIZATION ALGORITHMS; GENERATIVE MODEL; GIBBS SAMPLING; LATENT CLASS; MARKOV CHAIN MONTE CARLO PROCEDURES; POLITICAL EVENTS; PREDICTIVE ACCURACY; REAL WORLD DATA; RELATIONAL DATA; SOCIAL NETWORKS;

IMAGE SEGMENTATION; INFERENCE ENGINES; MARKOV PROCESSES;

ALGORITHMS;

EID: 77956224163     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1835804.1835906     Document Type: Conference Paper

References (26)

1. E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing. Mixed membership stochastic blockmodels. Journal of Machine Learning Research, (September):1981-2014, 2008.
2. C. Anderson, S. Wasserman, and K. Faust. Building stochastic blockmodels. Social Networks, 14(1-2):137-161, June 1992.
3. M. C. Appleby. Competition in a red deer stag social group: rank, age and relatedness of opponents. Animal Behavior, 31:913-918, 1983.
4. U. Brandes, J. Lerner, and T. a.B. Snijders. Networks evolving step by step: statistical analysis of dyadic event data. 2009 International Conference on Advances in Social Network Analysis and Mining, pages 200-205, 2009.
5. C. Butts. A relational event model for social action. Sociological Methodology, 38(1):155-20, 2008.
6. J. Chang and D. Blei. Relational topic models for document networks. Proc. of Conf. on AI and Statistics (AISTATS'09), 2009.
7. J.-P. Eckmann, E. Moses, and D. Sergi. Entropy of dialogues creates coherent structures in e-mail traffic. Proceedings of the National Academy of Sciences of the United States of America, 101(40):14333-7, October 2004.
8. S. E. Fienberg and S. S. Wasserman. Categorical data analysis of single sociometric relations. Sociological Methodology, 12:156-192, 1981.
9. S. Geisser and W. F. Eddy. A predictive approach to model selection. Journal of the American Statistical Association, 74(365):153, March 1979.
10. S. M. Goodreau, J. A. Kitts, and M. Morris. Birds of a feather, or friend of a friend? Using exponential random graph models to investigate adolescent social networks. Demography, 46:103-125, 2009.
11. T. L. Griffiths and M. Steyvers. Finding scientific topics. Proceedings of the National Academy of Sciences of the United States of America, 101 Suppl:5228-35, April 2004.
12. P. D. Hoff. Multiplicative latent factor models for description and prediction of social networks. Computational and Mathematical Organization Theory, October 2008.
13. P. W. Holland, K. B. Laskey, and S. Leinhardt. Stochastic blockmodels: first steps. Social Networks, 5:109-137, 1983.
14. C. Kemp, J. Tenenbaum, T. Griffiths, T. Yamada, and N. Ueda. Learning systems of concepts with an infinite relational model. Proceedings of the 21st National Conference on Artificial Intelligence, 2006.
15. G. King, W Lowe. An automated information extraction tool for international conflict data with performance as good as human coders: A rare events evaluation design. International Organization, 57:617-642, 2003.
16. G. Kossinets. Effects of missing data in social networks. Social Networks, 28:247-268, 2006.
17. K. Kurihara, Y. Kameya, and T. Sato. A Frequency-based stochastic blockmodel. Workshop on Information-Based Induction Sciences, 2006.
18. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, 2008.
19. K. Nowicki and T. A. B. Snijders. Estimation and prediction of stochastic blockstructures. Journal of the American Statistical Association, 96(455):1077-1087, 2001.
20. S. Rogers, A. Klami, J. Sinkkonen, M. Girolami, and S. Kaski. Infinite factorization of multiple non-parametric views. Machine Learning, 79(1-2):201-226, 2009.
21. S. Ross. Introduction to Probability Models. Academic Press, 2006.
22. M. Shafiei and H. Chipman. Mixed-membership stochastic block-models for transactional data. Workshop on Analyzing Networks and Learning with Graphs (NIPS 2009), pages 1-8, 2009.
23. J. Sinkkonen, J. Aukia, S. Kaski, C. Rudin, R. Schapire, and I. Daubechies. Component models for large networks. ArXiv e-prints. arXiv:0803.1628., page 11-15, 2008.
24. J. Sinkkonen, J. Aukia, S. Kaski. Infinite mixtures for multirelational categorical data. 6th International Workshop on Mining and Learning with Graphs, Helsinki, Finland, 2008.
25. T. A. B. Snijders and K. Nowicki. Estimation and prediction for stochastic blockmodels for graphs with latent block structure. Journal of Classification, 14(1):75-100, 1997.
26. Y. Wang and G. Wong. Stochastic blockmodels for directed graphs. Journal of the American Statistical Association, 82(397):8-19, 1987.