On the Joint Recovery of Community Structure and Community Features

We study the problem of recovering both K communities and their features from a labeled graph observation. We assume that the edges of an observed graph are generated as per the symmetric Stochastic Block Model (SBM), and that the label of each node is a noisy and partially-observed version of the corresponding community feature. We characterize the information-theoretic limit of this problem, and then propose a computationally efficient algorithm that achieves the information-theoretic limit.

[1]  Anup Rao,et al.  Stochastic Block Model and Community Detection in Sparse Graphs: A spectral algorithm with optimal rate of recovery , 2015, COLT.

[2]  Aaron Clauset,et al.  Adapting the Stochastic Block Model to Edge-Weighted Networks , 2013, ArXiv.

[3]  Huan Liu,et al.  Social recommendation: a review , 2013, Social Network Analysis and Mining.

[4]  Elchanan Mossel,et al.  Spectral redemption in clustering sparse networks , 2013, Proceedings of the National Academy of Sciences.

[5]  Christos Bouras,et al.  Improving news articles recommendations via user clustering , 2014, International Journal of Machine Learning and Cybernetics.

[6]  Kathryn B. Laskey,et al.  Stochastic blockmodels: First steps , 1983 .

[7]  Aria Nosratinia,et al.  Community Detection With Side Information: Exact Recovery Under the Stochastic Block Model , 2018, IEEE Journal of Selected Topics in Signal Processing.

[8]  Emmanuel Abbe,et al.  Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery , 2015, 2015 IEEE 56th Annual Symposium on Foundations of Computer Science.

[9]  Elchanan Mossel,et al.  Density Evolution in the Degree-correlated Stochastic Block Model , 2015, COLT.

[10]  Michael Nathanson.  Review: Elements of Information Theory. John Wiley and Sons, Inc., Hoboken, NJ, 2006, xxiv + 748 pp., ISBN 0-471-24195-4, $111.00. by Thomas M. Cover and Joy A. Thomas , 2013, Am. Math. Mon..

[11]  Mason A. Porter,et al.  Social Structure of Facebook Networks , 2011, ArXiv.

[12]  A. Rinaldo,et al.  Consistency of spectral clustering in stochastic block models , 2013, 1312.2050.

[13]  Adel Javanmard,et al.  Phase transitions in semidefinite relaxations , 2015, Proceedings of the National Academy of Sciences.

[14]  David M Blei,et al.  Efficient discovery of overlapping communities in massive networks , 2013, Proceedings of the National Academy of Sciences.

[15]  Jure Leskovec,et al.  Community Detection in Networks with Node Attributes , 2013, 2013 IEEE 13th International Conference on Data Mining.

[16]  Chao Gao,et al.  Achieving Optimal Misclassification Proportion in Stochastic Block Models , 2015, J. Mach. Learn. Res..

[17]  Kangwook Lee,et al.  Binary Rating Estimation with Graph Side Information , 2018, NeurIPS.

[18]  Lada A. Adamic,et al.  The political blogosphere and the 2004 U.S. election: divided they blog , 2005, LinkKDD '05.

[19]  M E J Newman,et al.  Community structure in social and biological networks , 2001, Proceedings of the National Academy of Sciences of the United States of America.