Bayesian community detection

Neural Computation

Volumn 24, Issue 9, 2012, Pages 2434-2456

  Mørup, Morten ^a   Schmidt, Mikkel N ^a  

^a TECHNICAL UNIVERSITY OF DENMARK   (Denmark)

Author keywords

[No Author keywords available]

Indexed keywords

ARTICLE; ARTIFICIAL NEURAL NETWORK; BAYES THEOREM; COMMUNITY CARE; HUMAN; PROBABILITY; SIGNAL TRANSDUCTION;

BAYES THEOREM; COMMUNITY NETWORKS; HUMANS; MARKOV CHAINS; NEURAL NETWORKS (COMPUTER); SIGNAL TRANSDUCTION;

EID: 84870691266     PISSN: 08997667     EISSN: 1530888X     Source Type: Journal    
DOI: 10.1162/NECO_a_00314     Document Type: Article

References (30)

1. Airoldi, E. M., Blei, D. M., Fienberg, S. E., & Xing, E. P. (2008). Mixed membership stochastic blockmodels. J. Mach. Learn. Res., 9, 1981-2014.
2. Clauset, A., Moore, C., & Newman, M. E. J. (2008). Hierarchical structure and the prediction of missing links in networks. Nature, 453(7191), 98-101.
3. Dutka, J. (1981). The incomplete beta function: A historical profile. Archive for History of Exact Sciences, 24, 11-29.
4. Fortunato, S. (2010). Community detection in graphs. Physics Reports, 486(3-5), 75-174.
5. Girvan, M.,& Newman, M. E. J. (2002). Community structure in social and biological networks. Proceedings of the National Academy of Sciences, 99(12), 7821-7826.
6. Globerson, A., Chechik, G., Pereira, F., & Tishby, N. (2005). Euclidean embedding of co-occurrence data. In L. K. Saul, Y. Weiss, & L. Bottou (Eds.), Advances in neural information processing systems, 17 (pp. 497-504). Cambridge, MA: MIT Press.
7. Gulbahce, N., & Lehmann, S. (2008). The art of community detection. BioEssays, 30(10), 934-938.
8. Hofman, J. M., & Wiggins, C. H. (2008). Bayesian approach to network modularity. Physical Review Letters, 100(25), 258701.
9. Jain, S., & Neal, R. M. (2004). A split-merge Markov chain Monte Carlo procedure for the Dirichlet process mixture model. Journal of Computational and Graphical Statistics, 13(1), 158-182.
10. Karrer, B., Levina, E.,&Newman, M. E. J. (2008). Robustness of community structure in networks. Physical Review E, 77(4), 1-10.
11. Karrer, B., & Newman, M. E. J. (2011). Stochastic blockmodels and community structure in networks. Physical Review E, 83(1), 016107.
12. Kemp, C., Tenenbaum, J. B., Griffiths, T. L., Yamada, T., & Ueda, N. (2006). Learning systems of concepts with an infinite relational model. In Proceedings of the National AAAI Conference on Artificial Intelligence. Palo Alto, CA: AAAI Press.
13. Kok, S., & Domingos, P. (2007). Statistical predicate invention. In Proceedings of the Twenty-Fourth International Conference on Machine Learning. Palo Alto, CA: AAAI Press.
14. Lusseau, D., Schneider, K., Boisseau, O. J., Haase, P., Slooten, E., & Dawson, S. M. (2003). The bottlenose dolphin community of Doubtful Sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology, 54(4), 396-405.
15. Menon, A.,& Elkan, C. (2011). Link prediction via matrix factorization. In Proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases (pp. 437-452). Berlin: Springer-Verlag.
16. Miller, K. T., Griffiths, T. L.,&Jordan, M. I. (2009). Nonparametric latent feature models for link prediction. In Y. Bengio, D. Schuurmans, J. Lafferty, C.K.I.Williams, & A. Culotta (Eds.), Advances in neural information processing systems, 22 (pp. 1276-1284). Red Hook, NY: Curran Associates.
17. Mørup, M., & Schmidt, M. N. (2011). Matlab code for Bayseian community detection. Available online at: http://www2.imm.dtu.dk/pubdb/views/publication_details.php?id=6147.
18. Mørup, M., Schmidt, M. N., & Hansen, L. K. (2010). Infinite multiple membership relational modeling for complex networks. In IEEE International Workshop on Machine Learning for Signal Processing. Piscataway, NJ: IEEE.
19. Neal, R. M. (2000). Markov chain sampling methods for Dirichlet process mixture models. Journal of Computational and Graphical Statistics, 9, 249-265.
20. Newman, M. E. J.,& Girvan, M. (2004). Finding and evaluating community structure in networks. Phys. Rev. E, 69(2), 026113-1-15.
21. Nowicki, K., & Snijders, T. A. B. (2001). Estimation and prediction for stochastic blockstructures. Journal of the American Statistical Association, 96(455), 1077-1087.
22. Pitman, J. (2006). Combinatorial stochastic processes. Berlin: Springer-Verlag.
23. Rosvall, M., & Bergstrom, C. T. (2007). An information-theoretic framework for resolving community structure in complex networks. Proceedings of the National Academy of Sciences, 104(18), 7327-7331.
24. Shi, J., & Malik, J. (2000). Normalized cuts and image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence, 22(8), 888-905.
25. Sun, S., Ling, L., Zhang, N., Li, G.,& Chen, R. (2003). Topological structure analysis of the protein-protein interaction network in budding yeast. Nucleic Acids Research, 31(9), 2443-2450.
26. Sutskever, I., Salakhutdinov, R., & Tenenbaum, J. (2009). Modelling relational data using Bayesian clustered tensor factorization. In Y. Bengio, D. Schuurmans, J. Lafferty, C. K. I. Williams, & A. Culotta (Eds.), Advances in neural information processing systems, 22 (pp. 1821-1828). Red Hook, NY: Curran Associates.
27. Von Luxburg, U. (2007). A tutorial on spectral clustering. Statistics and Computing, 17(4), 395-416.
28. Watts, D. J.,& Strogatz, S. H. (1998). Collective dynamics of "small-world" networks. Nature, 393(6684), 440-442.
29. Weiler, H. (1965). The use of incomplete beta functions for prior distributions in binomial sampling. Technometrics, 7, 335-347.
30. Xu, Z., Tresp, V., Yu, K., & Kriegel, H. P. (2006). Learning infinite hidden relational models. In Proceedings of the 22nd Conference on Uncertainty in Artificial Intelligence. AUAI Press.