Infinite edge partition models for overlapping community detection and link prediction

Journal of Machine Learning Research

Volumn 38, Issue , 2015, Pages 1135-1143

  Zhou, Mingyuan ^a  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; STOCHASTIC SYSTEMS;

ADJACENCY MATRICES; DATA AUGMENTATION; LINK PREDICTION; NON-PARAMETRIC BAYESIAN; OVERLAPPING COMMUNITIES; OVERLAPPING COMMUNITY DETECTIONS; RELATIONAL NETWORK; STATE-OF-THE-ART PERFORMANCE;

STOCHASTIC MODELS;

EID: 84954308726     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (32)

1. Y.-Y. Aim, J. P. Bagrow, and S. Lehmann. Link communities reveal multiscale complexity in networks. Nature, pages 761-764, 2010.
2. E. M. Airoldi, D. M. Blei, S. E. Fienberg, and E. P. Xing. Mixed membership stochastic blockmodels. Journal of Machine Learning Research, pages 1981-2014, 2008.
3. D. Aldous. Exchangeability and related topics. Ecole d'ete de probabilites de Saint-Flour XIII-1983, pages 1-198, 1985.
4. B. Ball, B. Karrer, and M. E. J. Newman. Efficient and principled method for detecting communities in networks. Physical Review E, 2011.
5. D. Bu, Y. Zhao, L. Cai, H. Xue, X. Zhu, H. Lu, J. Zhang, S. Sun, L. Ling, N. Zhang, G. Li, and R. Chen. Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic acids research, pages 2443-2450, 2003.
6. G. Butland, J. M. Peregrin-Alvarez, J. Li, W. Yang, X. Yang, V. Canadien, A. Starostine, D. Richards, B. Beattie, N. Krogan, M. Davey, J. Parkinson, J. Greenblatt, and A. Emili. Interaction network containing conserved and essential protein complexes in Escherichia coli. Nature, pages 531-537, 2005.
7. J. Davis and M. Goadrich. The relationship between Precision-Recall and ROC curves. In ICML, 2006.
8. T. S. Evans and R. Lambiotte. Line graphs, link partitions, and overlapping communities. Physical Review E, page 016105, 2009.
9. T. S. Ferguson. A Bayesian analysis of some nonpara-metric problems. Ann. Statist., 1973.
10. S. Fortunato. Community detection in graphs. Physics Reports, pages 75-174, 2010.
11. P. Gopalan, S. Gerrish, M. Freedman, D. M. Blei, and D. M. Mimno. Scalable inference of overlapping communities. In NIPS, pages 2249-2257, 2012.
12. T. L. Griffiths and Z. Ghahramani. Infinite latent feature models and the Indian buffet process. In NIPS, 2005.
13. P. Hoff. Modeling homophily and stochastic equivalence in symmetric relational data. In NIPS, 2008.
14. P. W. Holland, K. B. Laskey, and S. Leinhardt. Stochastic blockmodels: First steps. Social networks, pages 109-137, 1983.
15. D. N. Hoover. Row-column exchangeability and a general model for exchangeability. In G. Koch and F. Spizzichino, editors, Exchangeability in Probability and Statistics. 1982.
16. C. Kemp, J. B. Tenenbaum, T. L. Griffiths, T. Ya-mada, and N. Ueda. Learning systems of concepts with an infinite relational model. In AAAI, 2006.
17. D. I. Kim, P. Gopalan, D. M. Blei, and E. Sudderth. Efficient online inference for Bayesian nonparamet-ric relational models. In NIPS, pages 962-970, 2013.
18. J. F. C. Kingman. Poisson Processes. Oxford University Press, 1993.
19. J. Lloyd, P. Orbanz, Z. Ghahramani, and D. Roy. Random function priors for exchangeable arrays with applications to graphs and relational data. In NIPS, 2012.
20. K. Miller, M. I. Jordan, and T. L. Griffiths. Nonpara-metric latent feature models for link prediction. In NIPS, 2009.
21. M. Morup, M. N. Schmidt, and L. K. Hansen. Infinite multiple membership relational modeling for complex networks. In IEEE MLSP, 2011.
22. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Physical review E, page 026113, 2004.
23. K. Nowicki and T. A. B. Snijders. Estimation and prediction for stochastic blockstructures. JASA, pages 1077-1087, 2001.
24. G. Palla, I. Derenyi, I. Farkas, and T. Vicsek. Uncovering the overlapping community structure of complex networks in nature and society. Nature, pages 814-818, 2005.
25. K. Palla, D. Knowles, and Z. Ghahramani. A reversible infinite HMM using normalised random measures. In ICML, 2014.
26. K. Palla, D. A. Knowles, and Z. Ghahramani. An infinite latent attribute model for network data. In ICML. 2012.
27. Y. W. Teh, M. I. Jordan, M. J. Beal, and D. M. Blei. Hierarchical Dirichlet processes. JASA, 2006.
28. J. Yang and J. Leskovec. Community-affiliation graph model for overlapping network community detection. In ICDM, 2012.
29. J. Yang and J. Leskovec. Structure and overlaps of ground-truth communities in networks. ACM Trans. Intell. Syst. Technol., pages 26:1-26:35, 2014.
30. M. Zhou and L. Carin. Augment-and-conquer negative binomial processes. In NIPS, 2012.
31. M. Zhou and L. Carin. Negative binomial process count and mixture modeling. IEEE Trans. Pattern Analysis and Machine Intelligence, 2015.
32. M. Zhou, L. Hannah, D. Dunson, and L. Carin. Beta-negative binomial process and Poisson factor analysis. In AISTATS, 2012.