IDEAS home Printed from https://ideas.repec.org/a/spr/advdac/v18y2024i4d10.1007_s11634-023-00565-3.html
   My bibliography  Save this article

Applications of dual regularized Laplacian matrix for community detection

Author

Listed:
  • Huan Qing

    (Chongqing University of Technology)

  • Jingli Wang

    (Nankai University)

Abstract

Spectral clustering is widely used for detecting clusters in networks for community detection, while a small change on the graph Laplacian matrix could bring a dramatic improvement. In this paper, we propose a dual regularized graph Laplacian matrix and then employ it to the classical spectral clustering approach under the degree-corrected stochastic block model. If the number of communities is known as K, we consider more than K leading eigenvectors and weight them by their corresponding eigenvalues in the spectral clustering procedure to improve the performance. The improved spectral clustering method is dual regularized spectral clustering (DRSC). Theoretical analysis of DRSC shows that under mild conditions it yields stable consistent community detection. Meanwhile, we develop a strategy by taking advantage of DRSC and Newman’s modularity to estimate the number of communities K. We compare the performance of DRSC with several spectral methods and investigate the behaviors of our strategy for estimating K by substantial simulated networks and real-world networks. Numerical results show that DRSC enjoys satisfactory performance and our strategy on estimating K performs accurately and consistently, even in cases where there is only one community in a network.

Suggested Citation

  • Huan Qing & Jingli Wang, 2024. "Applications of dual regularized Laplacian matrix for community detection," Advances in Data Analysis and Classification, Springer;German Classification Society - Gesellschaft für Klassifikation (GfKl);Japanese Classification Society (JCS);Classification and Data Analysis Group of the Italian Statistical Society (CLADAG);International Federation of Classification Societies (IFCS), vol. 18(4), pages 1001-1043, December.
  • Handle: RePEc:spr:advdac:v:18:y:2024:i:4:d:10.1007_s11634-023-00565-3
    DOI: 10.1007/s11634-023-00565-3
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s11634-023-00565-3
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s11634-023-00565-3?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Kehui Chen & Jing Lei, 2018. "Network Cross-Validation for Determining the Number of Communities in Network Data," Journal of the American Statistical Association, Taylor & Francis Journals, vol. 113(521), pages 241-251, January.
    2. Traud, Amanda L. & Mucha, Peter J. & Porter, Mason A., 2012. "Social structure of Facebook networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(16), pages 4165-4180.
    3. Tianxi Li & Elizaveta Levina & Ji Zhu, 2020. "Network cross-validation by edge sampling," Biometrika, Biometrika Trust, vol. 107(2), pages 257-276.
    4. J. Reichardt & D. R. White, 2007. "Role models for complex networks," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 60(2), pages 217-224, November.
    5. Patrick Doreian, 1985. "Structural equivalence in a psychology journal network," Journal of the American Society for Information Science, Association for Information Science & Technology, vol. 36(6), pages 411-417, November.
    6. L. Šubelj & M. Bajec, 2011. "Robust network community detection using balanced propagation," The European Physical Journal B: Condensed Matter and Complex Systems, Springer;EDP Sciences, vol. 81(3), pages 353-362, June.
    7. Pengsheng Ji & Jiashun Jin & Zheng Tracy Ke & Wanshan Li, 2022. "Co-citation and Co-authorship Networks of Statisticians," Journal of Business & Economic Statistics, Taylor & Francis Journals, vol. 40(2), pages 469-485, April.
    8. Jiashun Jin & Zheng Tracy Ke & Shengming Luo, 2022. "Improvements on SCORE, Especially for Weak Signals," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 84(1), pages 127-162, June.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Wu, Qianyong & Hu, Jiang, 2024. "Two-sample test of stochastic block models," Computational Statistics & Data Analysis, Elsevier, vol. 192(C).
    2. Vainora, J., 2024. "Latent Position-Based Modeling of Parameter Heterogeneity," Cambridge Working Papers in Economics 2455, Faculty of Economics, University of Cambridge.
    3. Watanabe, Chihiro & Suzuki, Taiji, 2021. "Goodness-of-fit test for latent block models," Computational Statistics & Data Analysis, Elsevier, vol. 154(C).
    4. Šubelj, Lovro & Bajec, Marko, 2014. "Group detection in complex networks: An algorithm and comparison of the state of the art," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 397(C), pages 144-156.
    5. Marian-Gabriel Hâncean & Matjaž Perc & Lazăr Vlăsceanu, 2014. "Fragmented Romanian Sociology: Growth and Structure of the Collaboration Network," PLOS ONE, Public Library of Science, vol. 9(11), pages 1-9, November.
    6. Xin Xu & Yang Lu & Yupeng Zhou & Zhiguo Fu & Yanjie Fu & Minghao Yin, 2021. "An Information-Explainable Random Walk Based Unsupervised Network Representation Learning Framework on Node Classification Tasks," Mathematics, MDPI, vol. 9(15), pages 1-14, July.
    7. Ding, Yi & Li, Yingying & Liu, Guoli & Zheng, Xinghua, 2024. "Stock co-jump networks," Journal of Econometrics, Elsevier, vol. 239(2).
    8. Yuan, Quan & Liu, Binghui, 2021. "Community detection via an efficient nonconvex optimization approach based on modularity," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    9. Xue Jiang & Han Zhang & Xiongwen Quan & Zhandong Liu & Yanbin Yin, 2017. "Disease-related gene module detection based on a multi-label propagation clustering algorithm," PLOS ONE, Public Library of Science, vol. 12(5), pages 1-17, May.
    10. Blagus, Neli & Šubelj, Lovro & Bajec, Marko, 2012. "Self-similar scaling of density in complex real-world networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(8), pages 2794-2802.
    11. Jiashun Jin & Zheng Tracy Ke & Shengming Luo, 2022. "Improvements on SCORE, Especially for Weak Signals," Sankhya A: The Indian Journal of Statistics, Springer;Indian Statistical Institute, vol. 84(1), pages 127-162, June.
    12. Yi Yu & Jaeseung Baek & Ali Tosyali & Myong K. Jeong, 2024. "Robust asymmetric non-negative matrix factorization for clustering nodes in directed networks," Annals of Operations Research, Springer, vol. 341(1), pages 245-265, October.
    13. Yong Cai, 2022. "Linear Regression with Centrality Measures," Papers 2210.10024, arXiv.org.
    14. Han, Kevin & Basse, Guillaume & Bojinov, Iavor, 2024. "Population interference in panel experiments," Journal of Econometrics, Elsevier, vol. 238(1).
    15. Pieters, R. & Baumgartner, H. & Vermunt, J.K. & Bijmolt, T.H.A., 1999. "Importance and similarity in the evolving citation network of the International Journal of Research in Marketing," Other publications TiSEM e2c16930-bf58-49ae-8cc9-f, Tilburg University, School of Economics and Management.
    16. Tidarat Luangrungruang & Urachart Kokaew, 2022. "Adapting Fleming-Type Learning Style Classifications to Deaf Student Behavior," Sustainability, MDPI, vol. 14(8), pages 1-16, April.
    17. Saxena, Rakhi & Kaur, Sharanjit & Bhatnagar, Vasudha, 2019. "Identifying similar networks using structural hierarchy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    18. Luca Braghieri & Ro'ee Levy & Alexey Makarin, 2022. "Social Media and Mental Health," American Economic Review, American Economic Association, vol. 112(11), pages 3660-3693, November.
    19. Thorben Funke & Till Becker, 2019. "Stochastic block models: A comparison of variants and inference methods," PLOS ONE, Public Library of Science, vol. 14(4), pages 1-40, April.
    20. Lu, Hong & Sang, Xiaoshuang & Zhao, Qinghua & Lu, Jianfeng, 2020. "Community detection algorithm based on nonnegative matrix factorization and pairwise constraints," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:advdac:v:18:y:2024:i:4:d:10.1007_s11634-023-00565-3. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.