Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Abdi H, Bera M (2017) Correspondence analysis. Springer, New York, pp 1–12
Akbas E, Zhao P (2019) Graph clustering based on attribute-aware graph embedding. In: Security to community detection in social networking platforms. ASONAM 2017, Lecture notes in social networks. Springer, pp 109–131 (2019)
Bilal S, Abdelouahab M (2017) Evolutionary algorithm and modularity for detecting communities in networks. Physica A Stat Mech Appl 473:89–96. https://doi.org/10.1016/j.physa.2017.01.018
Cao S, Lu W, Xu Q (2016) Deep neural networks for learning graph representations. In: Schuurmans D, Wellman MP (eds) Proceedings of the thirtieth AAAI conference on artificial intelligence, February 12–17, 2016, Phoenix, Arizona, USA. AAAI Press, pp 1145–1152
Capocci A, Servedio VDP, Caldarelli G, Colaiori F (2005) Detecting communities in large networks. Physica A Stat Mech Appl 352:669–676. https://doi.org/10.1016/j.physa.2004.12.050
Chaabani Y, Akaichi J (2017) Meaningful communities detection in medias network. Soc Netw Anal Min 7(1):11:1–11:11. https://doi.org/10.1007/s13278-017-0430-9
Chouchane A, Boutemine O, Bouguessa M (2019) On detecting multidimensional communities. In: Security to community detection in social networking platforms. ASONAM 2017, lecture notes in social networks, pp 45–78
Cui P, Wang X, Pei J, Zhu W (2019) A survey on network embedding. IEEE Trans Knowl Data Eng 31(5):833–852. https://doi.org/10.1109/TKDE.2018.2849727
Fortunato S (2010) Community detection in graphs. Phys Rep 486(3–5):75–174. https://doi.org/10.1016/j.physrep.2009.11.002
Fortunato S, Barthelemy M (2007) Resolution limit in community detection. Proc Natl Acad Sci 104(1):36–41
Fortunato S, Hric D (2016) Community detection in networks: a user guide. Phys Rep 659:1–44. https://doi.org/10.1016/j.physrep.2016.09.002
Ge R, Jin C, Kakade SM, Netrapalli P, Sidford A (2016) Efficient algorithms for large-scale generalized eigenvector computation and canonical correlation analysis. CoRR abs/1604.03930
Hajiabadi M, Zare H, Bobarshad H (2017) Iedc: an integrated approach for overlapping and non-overlapping community detection. Knowl Based Syst 123:188–199. https://doi.org/10.1016/j.knosys.2017.02.018
Hayashi C (1992) Quantification method III or correspondence analysis in medical science. Ann Cancer Res Ther 1(1):17–21
Hewapathirana IU, Lee D, Moltchanova E, McLeod J (2020) Change detection in noisy dynamic networks: a spectral embedding approach. Soc Netw Anal Min 10(1):14. https://doi.org/10.1007/s13278-020-0625-3
Hill MO (1974) Correspondence analysis: a neglected multivariate method. J R Stat Soc Ser C (Appl Stat) 23(3):340–354
Hirschfeld HO (1935) A connection between correlation and contingency. In: Mathematical proceedings of the cambridge philosophical society, vol 31. Cambridge University Press, pp 520–524
Huang Z, Mamoulis N (2017) Heterogeneous information network embedding for meta path based proximity. CoRR abs/1701.05291
Jia Y, Zhang Q, Zhang W, Wang X (2019) Communitygan: community detection with generative adversarial nets
Karrer B, Newman MEJ (2011) Stochastic blockmodels and community structure in networks. Phys Rev E 83(1):016107
Khatoon M, Banu WA (2019) An efficient method to detect communities in social networks using DBSCAN algorithm. Soc Netw Anal Min 9(1):9:1–9:12. https://doi.org/10.1007/s13278-019-0554-1
Kimura M (20119) Cab-nc: the correspondence analysis based network clustering method. In: 2019 IEEE/ACM international conference on advances in social networks analysis and mining (ASONAM), pp 538–539
Lancichinetti A, Fortunato S, Radicchi F (2008) Benchmark graphs for testing community detection algorithms. Phys Rev E 78:046110. https://doi.org/10.1103/physreve.78.046110
Lorrain F, White HC (1971) Structural equivalence of individuals in social networks. J Math Sociol 1(1):49–80. https://doi.org/10.1080/0022250X.1971.9989788
Maulik U, Bandyopadhyay S (2002) Performance evaluation of some clustering algorithms and validity indices. IEEE Trans Pattern Anal Mach Intell 24:1650–1654. https://doi.org/10.1109/TPAMI.2002.1114856
Mellinger M (1987) Correspondence analysis: the method and its application. Chemom Intell Lab Syst 2(1):61–77 (Proceedings of the Multivariate Statistical Workshop for Geologists and Geochemists)
Newman MEJ (2006) Finding community structure in networks using the eigenvectors of matrices. Phys Rev E 74:036104. https://doi.org/10.1103/physreve.74.036104
Newman MEJ (2013) Spectral methods for community detection and graph partitioning. Phys Rev E 88(4):042822
Newman MEJ (2016) Equivalence between modularity optimization and maximum likelihood methods for community detection. Phys Rev E 94(5):052315
Newman MEJ, Girvan M (2004) Finding and evaluating community structure in networks. Phys Rev E Stat Nonlinear Soft Matter Phys 69(2 Pt 2):026113. https://doi.org/10.1103/PhysRevE.69.026113
Nishisato S, Nishisato S (1980) Analysis of categorical data: dual scaling and its applications. University of Toronto Press, Toronto
Panagiotakis C, Papadakis H, Fragopoulou P (2014) Flowpro: a flow propagation method for single community detection. https://doi.org/10.1109/ccnc.2014.6940507
Papadakis H, Panagiotakis C, Fragopoulou P (2014) Distributed detection of communities in complex networks using synthetic coordinates. J Stat Mech Theory Exp. https://doi.org/10.1088/1742-5468/2014/03/p03013
Perozzi B, Al-Rfou R, Skiena S (2014) Deepwalk: online learning of social representations. In: Macskassy SA, Perlich C, Leskovec J, Wang W, Ghani R (eds) The 20th ACM SIGKDD international conference on knowledge discovery and data mining, KDD ’14, New York, NY, USA. ACM, pp 701–710. https://doi.org/10.1145/2623330.2623732
Raghavan UN, Albert R, Kumara S (2007) Near linear time algorithm to detect community structures in large-scale networks. Phys Rev E 76:036106. https://doi.org/10.1103/PhysRevE.76.036106
Rosenberg A, Hirschberg J (2007) V-measure: a conditional entropy-based external cluster evaluation measure. In: Eisner J (ed) EMNLP-CoNLL 2007, proceedings of the 2007 joint conference on empirical methods in natural language processing and computational natural language learning, June 28–30, 2007, Prague, Czech Republic. ACL, pp 410–420
Sales-Pardo M, Guimerà R, Moreira AA, Amaral LAN (2007) Extracting the hierarchical organization of complex systems. Proc Natl Acad Sci 104(39):15224–15229. https://doi.org/10.1073/pnas.0703740104
Sarkar S, Dong A (2011) Community detection in graphs using singular value decomposition. Phys Rev E 83(4):046114
Schaub MT, Delvenne JC, Rosvall M, Lambiotte R (2017) The many facets of community detection in complex networks. Appl Netw Sci 2:4. https://doi.org/10.1007/s41109-017-0023-6
Shi J, Malik J (2000) Normalized cuts and image segmentation. IEEE Trans Pattern Anal Mach Intell 22(8):888–905. https://doi.org/10.1109/34.868688
Skillicorn DB, Zheng Q, Morselli C (2014) Modeling dynamic social networks using spectral embedding. Soc Netw Anal Min 4(1):182. https://doi.org/10.1007/s13278-014-0182-8
Symeonidis P, Mantas N (2013) Spectral clustering for link prediction in social networks with positive and negative links. Soc Netw Anal Min 3:1433–1447. https://doi.org/10.1007/s13278-013-0128-6
Tanaka Y (1979) Review of the methods of quantification. Environ Health Perspect 32:113–123
Teng X, Liu J, Li M (2019) Overlapping community detection in directed and undirected attributed networks using a multiobjective evolutionary algorithm. IEEE Trans Cybern. https://doi.org/10.1109/TCYB.2019.2931983
Vu T, Parker DS (2017) Mining community structure with node embeddings. In: Kaya M, Erdoǧan Ö, Rokne J (eds) Social data mining and analysis to prediction and community detection. Lecture notes in social networks. Springer, Berlin, pp 123–140
Wang D, Cui P, Zhu W (2016) Structural deep network embedding. In: Krishnapuram B, Shah M, Smola AJ, Aggarwal CC, Shen D, Rastogi R (eds) Proceedings of the 22nd ACM SIGKDD international conference on knowledge discovery and data mining, San Francisco, CA, USA, August 13–17, 2016. ACM, pp 1225–1234. https://doi.org/10.1145/2939672.2939753
Wang S, Tang J, Aggarwal CC, Chang Y, Liu H (2017) Signed network embedding in social media. In: Chawla N, Wang W(eds) Proceedings of the 2017 SIAM international conference on data mining, Houston, Texas, USA, April 27–29, 2017. SIAM, pp 327–335. https://doi.org/10.1137/1.9781611974973.37
Whang JJ, Gleich DF, Dhillon IS (2016) Overlapping community detection using neighborhood-inflated seed expansion. IEEE Trans Knowl Data Eng 28:1272–1284. https://doi.org/10.1109/tkde.2016.2518687
Yang J, Leskovec J (2015) Defining and evaluating network communities based on ground-truth. Knowl Inf Syst 42:181–213. https://doi.org/10.1007/s10115-013-0693-z
Yelland PM (2010) An introduction to correspondence analysis. Math J 12:1–23
Zachary WW (1977) An information flow model for conflict and fission in small groups. J Anthropol Res 33:452–473. https://doi.org/10.1086/jar.33.4.3629752
Zhang Y, Yin D, Wu B, Long F, Cui Y, Bian X (2019) Plinkshrink: a parallel overlapping community detection algorithm with link-graph for large networks. Soc Netw Anal Min 9(1):66:1–66:17. https://doi.org/10.1007/s13278-019-0609-3
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
Conflict of Interest
The authors declare that they have no conflict of interest.
Additional information
Publisher’s Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Kimura, M. Correspondence analysis-based network clustering and importance of degenerate solutions unification of spectral clustering and modularity maximization. Soc. Netw. Anal. Min. 10, 71 (2020). https://doi.org/10.1007/s13278-020-00686-z
Received:
Revised:
Accepted:
Published:
DOI: https://doi.org/10.1007/s13278-020-00686-z