Correspondence analysis-based network clustering and importance of degenerate solutions unification of spectral clustering and modularity maximization

Methods to find clusters in a network have been studied extensively because clustering has practical importance in many applications. Commonly used methods include spectral clustering and Newman’s modularity maximization. However, there has been no unified view of the two methods. In this study, we introduce an innovative guiding principle based on correspondence analysis to obtain node coordinates and discuss its equivalence to spectral clustering and Newman’s modularity. Besides, we discuss a degeneration case and its significance.

[1]  G. Caldarelli,et al.  Detecting communities in large networks , 2004, cond-mat/0402499.

[2]  Sham M. Kakade,et al.  Efficient Algorithms for Large-scale Generalized Eigenvector Computation and Canonical Correlation Analysis , 2016, ICML.

[3]  M. Newman.  Community detection in networks: Modularity optimization and maximum likelihood are equivalent , 2016, Physical review. E.

[4]  Wenwu Zhu,et al.  Structural Deep Network Embedding , 2016, KDD.

[5]  Jean R. Lobry,et al.  Introduction to Correspondence Analysis , 2018 .

[6]  Steven Skiena,et al.  DeepWalk: online learning of social representations , 2014, KDD.

[7]  Isuru Udayangani Hewapathirana,et al.  Change detection in noisy dynamic networks: a spectral embedding approach , 2019, Social Network Analysis and Mining.

[8]  Inderjit S. Dhillon,et al.  Overlapping Community Detection Using Neighborhood-Inflated Seed Expansion , 2015, IEEE Transactions on Knowledge and Data Engineering.

[9]  Masaomi Kimura,et al.  CAB-NC: The Correspondence Analysis Based Network Clustering Method , 2019, 2019 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM).

[10]  G. M. Southward,et al.  Analysis of Categorical Data: Dual Scaling and Its Applications , 1981 .

[11]  Nikos Mamoulis,et al.  Heterogeneous Information Network Embedding for Meta Path based Proximity , 2017, ArXiv.

[12]  H. White,et al.  “Structural Equivalence of Individuals in Social Networks” , 2022, The SAGE Encyclopedia of Research Design.

[13]  Panagiotis Symeonidis,et al.  Spectral clustering for link prediction in social networks with positive and negative links , 2013, Social Network Analysis and Mining.

[14]  Charu C. Aggarwal,et al.  Signed Network Embedding in Social Media , 2017, SDM.

[15]  Jian Pei,et al.  A Survey on Network Embedding , 2017, IEEE Transactions on Knowledge and Data Engineering.

[16]  Ujjwal Maulik,et al.  Performance Evaluation of Some Clustering Algorithms and Validity Indices , 2002, IEEE Trans. Pattern Anal. Mach. Intell..

[17]  Roger Guimerà,et al.  Extracting the hierarchical organization of complex systems , 2007, Proceedings of the National Academy of Sciences.

[18]  Jitendra Malik,et al.  Normalized cuts and image segmentation , 1997, Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[19]  W. Zachary,et al.  An Information Flow Model for Conflict and Fission in Small Groups , 1977, Journal of Anthropological Research.

[20]  Paraskevi Fragopoulou,et al.  Distributed detection of communities in complex networks using synthetic coordinates , 2014 .

[21]  Chikio Hayashi,et al.  Quantification Method III or Correspondence Analysis in Medical Science , 1992 .

[22]  Peixiang Zhao,et al.  Graph Clustering Based on Attribute-Aware Graph Embedding , 2017, Lecture Notes in Social Networks.

[23]  Wei Lu,et al.  Deep Neural Networks for Learning Graph Representations , 2016, AAAI.

[24]  Jean-Charles Delvenne,et al.  The many facets of community detection in complex networks , 2016, Applied Network Science.

[25]  Xinbing Wang,et al.  CommunityGAN: Community Detection with Generative Adversarial Nets , 2019, WWW.

[26]  W. Aisha Banu,et al.  An efficient method to detect communities in social networks using DBSCAN algorithm , 2019, Social Network Analysis and Mining.

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

[28]  Jure Leskovec,et al.  Defining and evaluating network communities based on ground-truth , 2012, Knowledge and Information Systems.

[29]  Jing Liu,et al.  Overlapping Community Detection in Directed and Undirected Attributed Networks Using a Multiobjective Evolutionary Algorithm , 2021, IEEE Transactions on Cybernetics.

[30]  Mirella Lapata,et al.  Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning , 2007 .

[31]  M. Newman,et al.  Finding community structure in networks using the eigenvectors of matrices. , 2006, Physical review. E, Statistical, nonlinear, and soft matter physics.

[32]  Somwrita Sarkar,et al.  Community detection in graphs using singular value decomposition. , 2011, Physical review. E, Statistical, nonlinear, and soft matter physics.

[33]  H. Hirschfeld.  A Connection between Correlation and Contingency , 1935, Mathematical Proceedings of the Cambridge Philosophical Society.

[34]  David B. Skillicorn,et al.  Modeling dynamic social networks using spectral embedding , 2014, Social Network Analysis and Mining.

[35]  Julia Hirschberg,et al.  V-Measure: A Conditional Entropy-Based External Cluster Evaluation Measure , 2007, EMNLP.

[36]  Bin Wu,et al.  PLinkSHRINK: a parallel overlapping community detection algorithm with Link-Graph for large networks , 2019, Social Network Analysis and Mining.

[37]  Mark E. J. Newman,et al.  Stochastic blockmodels and community structure in networks , 2010, Physical review. E, Statistical, nonlinear, and soft matter physics.

[38]  Réka Albert,et al.  Near linear time algorithm to detect community structures in large-scale networks. , 2007, Physical review. E, Statistical, nonlinear, and soft matter physics.

[39]  Mohamed Bouguessa,et al.  On Detecting Multidimensional Communities , 2017, Lecture Notes in Social Networks.

[40]  Konstantin Avrachenkov,et al.  Cooperative Game Theory Approaches for Network Partitioning , 2017, COCOON.

[41]  S. Fortunato,et al.  Resolution limit in community detection , 2006, Proceedings of the National Academy of Sciences.

[42]  Paraskevi Fragopoulou,et al.  FlowPro: A flow propagation method for single community detection , 2014, 2014 IEEE 11th Consumer Communications and Networking Conference (CCNC).

[43]  Y. Tanaka,et al.  Review of the methods of quantification. , 1979, Environmental health perspectives.

[44]  西里 静彦,et al.  Analysis of categorical data : dual scaling and its applications , 1980 .

[45]  F. Radicchi,et al.  Benchmark graphs for testing community detection algorithms. , 2008, Physical review. E, Statistical, nonlinear, and soft matter physics.

[46]  Hadi Zare,et al.  IEDC: An integrated approach for overlapping and non-overlapping community detection , 2016, Knowl. Based Syst..

[47]  M. Hill.  Correspondence Analysis: A Neglected Multivariate Method , 1974 .

[48]  M. Mellinger,et al.  Correspondence Analysis: The Method and Its Application , 1987 .

[49]  Jalel Akaichi,et al.  Meaningful communities detection in medias network , 2017, Social Network Analysis and Mining.

[50]  Moussaoui Abdelouahab,et al.  Evolutionary algorithm and modularity for detecting communities in networks , 2017 .

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

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

[53]  D. Stott Parker,et al.  Mining Community Structure with Node Embeddings , 2017 .