Learning Mixed Membership Community Models in Social Tagging Networks through Tensor Methods

Author(s): Anandkumar, Anima; Sedghi, Hanie | Abstract: Community detection in graphs has been extensively studied both in theory and in applications. However, detecting communities in hypergraphs is more challenging. In this paper, we propose a tensor decomposition approach for guaranteed learning of communities in a special class of hypergraphs modeling social tagging systems or folksonomies. A folksonomy is a tripartite 3-uniform hypergraph consisting of (user, tag, resource) hyperedges. We posit a probabilistic mixed membership community model, and prove that the tensor method consistently learns the communities under efficient sample complexity and separation requirements.

[1]  Tsuyoshi Murata.  Detecting communities from tripartite networks , 2010, WWW '10.

[2]  Yiannis Kompatsiaris,et al.  A Graph-Based Clustering Scheme for Identifying Related Tags in Folksonomies , 2010, DaWak.

[3]  Huan Liu,et al.  Discovering Overlapping Groups in Social Media , 2010, 2010 IEEE International Conference on Data Mining.

[4]  Anima Anandkumar,et al.  Fast Detection of Overlapping Communities via Online Tensor Methods on GPUs , 2013, ArXiv.

[5]  Anima Anandkumar,et al.  Guaranteed Non-Orthogonal Tensor Decomposition via Alternating Rank-1 Updates , 2014, ArXiv.

[6]  M. Rudelson,et al.  Hanson-Wright inequality and sub-gaussian concentration , 2013 .

[7]  Saptarshi Ghosh,et al.  Clustering Hypergraphs for Discovery of Overlapping Communities in Folksonomies , 2013 .

[8]  Joel A. Tropp,et al.  User-Friendly Tail Bounds for Sums of Random Matrices , 2010, Found. Comput. Math..

[9]  Niloy Ganguly,et al.  Detecting overlapping communities in folksonomies , 2012, HT '12.

[10]  Jure Leskovec,et al.  Overlapping community detection at scale: a nonnegative matrix factorization approach , 2013, WSDM.

[11]  Sujay Sanghavi,et al.  Clustering Sparse Graphs , 2012, NIPS.

[12]  Anima Anandkumar,et al.  A Tensor Spectral Approach to Learning Mixed Membership Community Models , 2013, COLT.

[13]  Alexei Vazquez,et al.  Finding hypergraph communities: a Bayesian approach and variational solution , 2009 .

[14]  Jimeng Sun,et al.  MetaFac: community discovery via relational hypergraph factorization , 2009, KDD.

[15]  Van H. Vu,et al.  Random weighted projections, random quadratic forms and random eigenvectors , 2013, Random Struct. Algorithms.

[16]  Frank McSherry,et al.  Spectral partitioning of random graphs , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.

[17]  Ioannis Konstas,et al.  On social networks and collaborative recommendation , 2009, SIGIR.

[18]  Edoardo M. Airoldi,et al.  Mixed Membership Stochastic Blockmodels , 2007, NIPS.

[19]  Anima Anandkumar,et al.  A tensor approach to learning mixed membership community models , 2013, J. Mach. Learn. Res..

[20]  H. Yau,et al.  Bulk universality for generalized Wigner matrices , 2010, 1001.3453.

[21]  K. Obermayer,et al.  Towards Community Detection in k-Partite k-Uniform Hypergraphs , 2009 .

[22]  Michael Brinkmeier,et al.  Communities in graphs and hypergraphs , 2007, CIKM '07.

[23]  Yong Yu,et al.  Exploring folksonomy for personalized search , 2008, SIGIR '08.

[24]  Suvrit Sra,et al.  Approximation Algorithms for Tensor Clustering , 2009, ALT.

[25]  Roman Vershynin,et al.  Introduction to the non-asymptotic analysis of random matrices , 2010, Compressed Sensing.