On triangular versus edge representations - Towards scalable modeling of networks

Advances in Neural Information Processing Systems

Volumn 3, Issue , 2012, Pages 2132-2140

  Ho, Qirong ^a   Yin, Junming ^a   Xing, Eric P ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATE INFERENCE; COMMUNITY DETECTION; COMPUTATIONAL BOTTLENECKS; EDGE-BASED MODELS; MODEL BASED APPROACH; NETWORK PROBLEMS; REAL-WORLD NETWORKS; TRIANGULAR MOTIF;

ALGORITHMS; ITERATIVE METHODS;

INFERENCE ENGINES;

EID: 84877735494     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (24)

1. E.M. Airoldi, D.M. Blei, S.E. Fienberg, and E.P. Xing. Mixed membership stochastic blockmodels. The Journal of Machine Learning Research, 9:1981-2014, 2008.
2. D.M. Blei, A.Y. Ng, and M.I. Jordan. Latent dirichlet allocation. The Journal of Machine Learning Research, 3:993-1022, 2003.
3. L. Cao and L. Fei-Fei. Spatially coherent latent topic model for concurrent segmentation and classification of objects and scenes. In ICCV 2007, pages 1-8. IEEE, 2007.
4. B. Fulkerson, A. Vedaldi, and S. Soatto. Class segmentation and object localization with superpixel neighborhoods. In ICCV 2009, pages 670-677. IEEE, 2009.
5. Q. Ho, J. Eisenstein, and E.P. Xing. Document hierarchies from text and links. In Proceedings of the 21st international conference on World Wide Web, pages 739-748. ACM, 2012.
6. Q. Ho, A. Parikh, L. Song, and EP Xing. Multiscale community blockmodel for network exploration. In Proceedings of the 14th International Conference on Artificial Intelligence and Statistics, 2011.
7. M.J. Keeling and K.T.D. Eames. Networks and epidemic models. Journal of the Royal Society Interface, 2(4):295-307, 2005.
8. R. Kondor, N. Shervashidze, and K.M. Borgwardt. The graphlet spectrum. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 529-536. ACM, 2009.
9. D. Krackhardt and M. Handcock. Heider vs simmel: Emergent features in dynamic structures. Statistical Network Analysis: Models, Issues, and New Directions, pages 14-27, 2007.
10. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. In Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 462-470. ACM, 2008.
11. J. Leskovec and C. Faloutsos. Sampling from large graphs. In Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 631-636. ACM, 2006.
12. K.T. Miller, T.L. Griffiths, and M.I. Jordan. Nonparametric latent feature models for link prediction. Advances in Neural Information Processing Systems (NIPS), pages 1276-1284, 2009.
13. R. Milo, S. Shen-Orr, S. Itzkovitz, N. Kashtan, D. Chklovskii, and U. Alon. Network motifs: Simple building blocks of complex networks. Science, 298(5594):824-827, 2002.
14. R.M. Nallapati, A. Ahmed, E.P. Xing, and W.W. Cohen. Joint latent topic models for text and citations. In Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 542-550. ACM, 2008.
15. M.E.J. Newman. Modularity and community structure in networks. Proceedings of the National Academy of Sciences, 103(23):8577-8582, 2006.
16. M.E.J. Newman and J. Park. Why social networks are different from other types of networks. Arxiv preprint cond-mat/0305612, 2003.
17. A.Y. Ng, M.I. Jordan, and Y. Weiss. On spectral clustering: Analysis and an algorithm. Advances in neural information processing systems, 2:849-856, 2002.
18. N. Shervashidze, SVN Vishwanathan, T. Petri, K. Mehlhorn, and K. Borgwardt. Efficient graphlet kernels for large graph comparison. In Proceedings of the International Workshop on Artificial Intelligence and Statistics. Society for Artificial Intelligence and Statistics, 2009.
19. G. Simmel and K.H. Wolff. The Sociology of Georg Simmel. Free Press, 1950.
20. T.A.B. Snijders. Markov chain monte carlo estimation of exponential random graph models. Journal of Social Structure, 3(2):1-40, 2002.
21. C.E. Tsourakakis. Fast counting of triangles in large real networks without counting: Algorithms and laws. In Data Mining, 2008. ICDM'08. Eighth IEEE International Conference on, pages 608-617. IEEE, 2008.
22. A. Vattani, D. Chakrabarti, and M. Gurevich. Preserving personalized pagerank in subgraphs. In ICML 2011, 2011.
23. J. Zhu, A. Ahmed, and E.P. Xing. Medlda: maximum margin supervised topic models for regression and classification. In Proceedings of the 26th Annual International Conference on Machine Learning, pages 1257-1264. ACM, 2009.
24. J. Zhu, N. Chen, and E.P. Xing. Infinite latent svm for classification and multi-task learning. Advances in Neural Information Processing Systems, 25.