Soft unveiling of communities via egonet tensors

The task of community detection over a network pertains to identifying the underlying groups of nodes whose often-hidden association has manifested itself in dense connections among the members, and sparse inter-community links. The present work aims at improving the robustness of the traditional matrix-based community detection algorithms via capturing multi-hop connectivity patterns through tensor analysis. To this end, a novel tensor-based network representation is advocated in this contribution, and the task of community detection is cast as a constrained PARAFAC decomposition. Subsequently, the proposed tri-linear minimization is handled via alternating least-squares, where intermediate subproblems are solved using the alternating direction method of multipliers (ADMM) to ensure convergence. The framework is further broadened to accommodate time-varying graphs, where the edgeset as well as the underlying communities evolve through time. Numerical tests corroborate the increased robustness provided through the novel representation as well as the proposed tensor decomposition.

[1]  T. Vicsek,et al.  Clique percolation in random networks. , 2005, Physical review letters.

[2]  Georgios B. Giannakis,et al.  Identification of Overlapping Communities via Constrained Egonet Tensor Decomposition , 2017, IEEE Transactions on Signal Processing.

[3]  Christos Faloutsos,et al.  oddball: Spotting Anomalies in Weighted Graphs , 2010, PAKDD.

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

[5]  Jure Leskovec,et al.  Tensor Spectral Clustering for Partitioning Higher-order Network Structures , 2015, SDM.

[6]  Georgios B. Giannakis,et al.  Joint Community and Anomaly Tracking in Dynamic Networks , 2015, IEEE Transactions on Signal Processing.

[7]  Nikos D. Sidiropoulos,et al.  A Flexible and Efficient Algorithmic Framework for Constrained Matrix and Tensor Factorization , 2015, IEEE Transactions on Signal Processing.

[8]  Inderjit S. Dhillon,et al.  Non-exhaustive, Overlapping k-means , 2015, SDM.

[9]  N. Sidiropoulos,et al.  On the uniqueness of multilinear decomposition of N‐way arrays , 2000 .

[10]  Santo Fortunato,et al.  Finding Statistically Significant Communities in Networks , 2010, PloS one.

[11]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[12]  George Karypis,et al.  Constrained Tensor Factorization with Accelerated AO-ADMM , 2017, 2017 46th International Conference on Parallel Processing (ICPP).

[13]  A. Arenas,et al.  Community detection in complex networks using extremal optimization. , 2005, Physical review. E, Statistical, nonlinear, and soft matter physics.

[14]  Nikos D. Sidiropoulos,et al.  From K-Means to Higher-Way Co-Clustering: Multilinear Decomposition With Sparse Latent Factors , 2013, IEEE Transactions on Signal Processing.

[15]  Yoram Singer,et al.  Efficient projections onto the l1-ball for learning in high dimensions , 2008, ICML '08.

[16]  Ananthram Swami,et al.  Com2: Fast Automatic Discovery of Temporal ('Comet') Communities , 2014, PAKDD.

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

[18]  Santo Fortunato,et al.  Community detection in networks: A user guide , 2016, ArXiv.

[19]  Dit-Yan Yeung,et al.  Overlapping community detection via bounded nonnegative matrix tri-factorization , 2012, KDD.

[20]  Ludvig Bohlin,et al.  Community detection and visualization of networks with the map equation framework , 2014 .

[21]  Ulrike von Luxburg,et al.  A tutorial on spectral clustering , 2007, Stat. Comput..

[22]  Yixin Cao,et al.  Identifying overlapping communities as well as hubs and outliers via nonnegative matrix factorization , 2013, Scientific Reports.

[23]  Kun He,et al.  Detecting Overlapping Communities from Local Spectral Subspaces , 2015, 2015 IEEE International Conference on Data Mining.