Robust spectral clustering using LASSO regularization

Cluster structure detection is a fundamental task for the analysis of graphs, in order to understand and to visualize their functional characteristics. Among the different cluster structure detection methods, spectral clustering is currently one of the most widely used due to its speed and simplicity. Yet, there are few theoretical guarantee to recover the underlying partitions of the graph for general models. This paper therefore presents a variant of spectral clustering, called 1-spectral clustering, performed on a new random model closely related to stochastic block model. Its goal is to promote a sparse eigenbasis solution of a 1 minimization problem revealing the natural structure of the graph. The effectiveness and the robustness to small noise perturbations of our technique is confirmed through a collection of simulated and real data examples.

[1]  Stephen B. Seidman,et al.  Network structure and minimum degree , 1983 .

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

[3]  David Bawden,et al.  Book Review: Evolution and Structure of the Internet: A Statistical Physics Approach. , 2006 .

[4]  Richard Peng,et al.  Partitioning Well-Clustered Graphs: Spectral Clustering Works! , 2014, SIAM J. Comput..

[5]  Mark S Handcock,et al.  MODELING SOCIAL NETWORKS FROM SAMPLED DATA. , 2010, The annals of applied statistics.

[6]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[7]  E. Candes,et al.  11-magic : Recovery of sparse signals via convex programming , 2005 .

[8]  Kenneth Lange,et al.  Power k-Means Clustering , 2019, ICML.

[9]  Alex Pothen,et al.  Graph Partitioning Algorithms with Applications to Scientific Computing , 1997 .

[10]  Michael I. Jordan,et al.  On Spectral Clustering: Analysis and an algorithm , 2001, NIPS.

[11]  R. Albert,et al.  The large-scale organization of metabolic networks , 2000, Nature.

[12]  Yilin Zhang,et al.  Understanding Regularized Spectral Clustering via Graph Conductance , 2018, NeurIPS.

[13]  M E J Newman,et al.  Modularity and community structure in networks. , 2006, Proceedings of the National Academy of Sciences of the United States of America.

[14]  J J Hopfield,et al.  Neural networks and physical systems with emergent collective computational abilities. , 1982, Proceedings of the National Academy of Sciences of the United States of America.

[15]  Bin Yu,et al.  Spectral clustering and the high-dimensional stochastic blockmodel , 2010, 1007.1684.

[16]  Feiping Nie,et al.  Structured Doubly Stochastic Matrix for Graph Based Clustering: Structured Doubly Stochastic Matrix , 2016, KDD.

[17]  Stanley Wasserman,et al.  Social Network Analysis: Methods and Applications , 1994, Structural analysis in the social sciences.

[18]  Sergei Vassilvitskii,et al.  k-means++: the advantages of careful seeding , 2007, SODA '07.

[19]  M. Pop,et al.  Metagenomic Analysis of the Human Distal Gut Microbiome , 2006, Science.

[20]  Jon Kleinberg,et al.  Authoritative sources in a hyperlinked environment , 1998, SODA '98.

[21]  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.

[22]  Matthieu Latapy,et al.  Computing Communities in Large Networks Using Random Walks , 2004, J. Graph Algorithms Appl..

[23]  Eric R. Ziegel,et al.  The Elements of Statistical Learning , 2003, Technometrics.

[24]  Philip S. Yu,et al.  Top 10 algorithms in data mining , 2007, Knowledge and Information Systems.

[25]  Edward T. Bullmore,et al.  Neuroinformatics Original Research Article , 2022 .

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

[27]  M E J Newman,et al.  Finding and evaluating community structure in networks. , 2003, Physical review. E, Statistical, nonlinear, and soft matter physics.

[28]  V. Kreinovich,et al.  Why ` 1 is a Good Approximation to ` 0 : A Geometric Explanation , 2012 .

[29]  P. Gentileschi,et al.  Molecular Phenomics and Metagenomics of Hepatic Steatosis in Non-Diabetic Obese Women , 2018, Nature Medicine.

[30]  Thomas Bonald,et al.  Spectral embedding of regularized block models , 2019, ICLR.

[31]  U. Feige,et al.  Spectral Graph Theory , 2015 .

[32]  Silvio Lattanzi,et al.  A Better k-means++ Algorithm via Local Search , 2019, ICML.

[33]  Vladik Kreinovich,et al.  Why l1 Is a Good Approximation to l0: A Geometric Explanation , 2013 .

[34]  Carey E. Priebe,et al.  A Consistent Adjacency Spectral Embedding for Stochastic Blockmodel Graphs , 2011, 1108.2228.

[35]  F. Bäckhed,et al.  Obesity alters gut microbial ecology. , 2005, Proceedings of the National Academy of Sciences of the United States of America.

[36]  Stéphane Robin,et al.  Variational Inference for sparse network reconstruction from count data , 2018, ICML.

[37]  Bin Yu,et al.  Impact of regularization on spectral clustering , 2013, 2014 Information Theory and Applications Workshop (ITA).

[38]  Santo Fortunato,et al.  Community detection in graphs , 2009, ArXiv.