IDEAS home Printed from https://ideas.repec.org/a/eee/phsmap/v587y2022ics037843712100786x.html
   My bibliography  Save this article

Local community detection based on higher-order structure and edge information

Author

Listed:
  • Shang, Ronghua
  • Zhang, Weitong
  • Zhang, Jingwen
  • Feng, Jie
  • Jiao, Licheng

Abstract

Local community detection is to discover local community where the seed is located. Most algorithms extend local community by edge information, without considering high-order information in network. The high-order information which is also named as network motif is very important for forming a community. There are also methods that focus on higher-order structure but ignore the sparsely connected edges, resulting in that fail to extend some edge points. In addition, when the seed is the edge node, how to choose the first node to integrate into the community will determine whether the community expands in a right direction. Therefore, a local community detection algorithm based on higher-order structure and edge information (HSEI) is proposed. Firstly, different ways selecting the first node joining local community according to the motif degree of seed are used. Secondly, a new motif-based modularity function is proposed to extend local community, so that the extended community will be connected more tightly. A new motif-based community central node is defined to help extend the central part of local community. For the edge of community and the area with sparse connections, edge information is used to mine the membership strength between nodes and communities, so as to obtain more complete local community members. Compared with five state-of-the-art algorithms, the proposed method achieves better results on the generated networks with different parameters and six real networks.

Suggested Citation

  • Shang, Ronghua & Zhang, Weitong & Zhang, Jingwen & Feng, Jie & Jiao, Licheng, 2022. "Local community detection based on higher-order structure and edge information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 587(C).
    • Handle: RePEc:eee:phsmap:v:587:y:2022:i:c:s037843712100786x
    DOI: 10.1016/j.physa.2021.126513
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843712100786X
    Download Restriction: Full text for ScienceDirect subscribers only. Journal offers the option of making the article available online on Science direct for a fee of $3,000
    File URL: https://libkey.io/10.1016/j.physa.2021.126513?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. Chen, Qiong & Wu, Ting-Ting & Fang, Ming, 2013. "Detecting local community structures in complex networks based on local degree central nodes," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 392(3), pages 529-537.
    2. Feng, Liang & Zhao, Qianchuan & Zhou, Cangqi, 2021. "Incorporating affiliation preference into overlapping community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    3. Moradi, Mehdi & Parsa, Saeed, 2019. "An evolutionary method for community detection using a novel local search strategy," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 457-475.
    4. Li, Xuequn & Zhou, Shuming & Liu, Jiafei & Lian, Guanqin & Chen, Gaolin & Lin, Chen-Wan, 2019. "Communities detection in social network based on local edge centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 531(C).
    5. Diego Raphael Amancio, 2015. "Comparing the topological properties of real and artificially generated scientific manuscripts," Scientometrics, Springer;Akadémiai Kiadó, vol. 105(3), pages 1763-1779, December.
    6. Aghaalizadeh, Saeid & Afshord, Saeid Taghavi & Bouyer, Asgarali & Anari, Babak, 2021. "A three-stage algorithm for local community detection based on the high node importance ranking in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Yanmei Hu & Bo Yang & Bin Duo & Xing Zhu, 2022. "Exhaustive Exploitation of Local Seeding Algorithms for Community Detection in a Unified Manner," Mathematics, MDPI, vol. 10(15), pages 1-30, August.
    2. Liu, Qian & Wang, Jian & Zhao, Zhidan & Zhao, Na, 2022. "Relatively important nodes mining algorithm based on community detection and biased random walk with restart," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 607(C).
    3. Wu, Xunlian & Zhang, Han & Quan, Yining & Miao, Qiguang & Sun, Peng Gang, 2023. "Graph embedding based on motif-aware feature propagation for community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 630(C).
    4. Zhu, Junfang & Ren, Xuezao & Ma, Peijie & Gao, Kun & Wang, Bing-Hong & Zhou, Tao, 2022. "Detecting network communities via greedy expanding based on local superiority index," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 603(C).

    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. Jiang, Jianhua & Yang, Xi & Meng, Xianqiu & Li, Keqin, 2020. "Enhance chaotic gravitational search algorithm (CGSA) by balance adjustment mechanism and sine randomness function for continuous optimization problems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    2. Kazemzadeh, Farzaneh & Safaei, Ali Asghar & Mirzarezaee, Mitra, 2022. "Influence maximization in social networks using effective community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    3. Corrêa, Edilson A. & Marinho, Vanessa Q. & Amancio, Diego R., 2020. "Semantic flow in language networks discriminates texts by genre and publication date," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 557(C).
    4. Dhuha Abdulhadi Abduljabbar & Siti Zaiton Mohd Hashim & Roselina Sallehuddin, 2020. "Nature-inspired optimization algorithms for community detection in complex networks: a review and future trends," Telecommunication Systems: Modelling, Analysis, Design and Management, Springer, vol. 74(2), pages 225-252, June.
    5. Dejian Yu & Wanru Wang & Shuai Zhang & Wenyu Zhang & Rongyu Liu, 2017. "Hybrid self-optimized clustering model based on citation links and textual features to detect research topics," PLOS ONE, Public Library of Science, vol. 12(10), pages 1-21, October.
    6. de Arruda, Henrique F. & Silva, Filipi N. & Comin, Cesar H. & Amancio, Diego R. & Costa, Luciano da F., 2019. "Connecting network science and information theory," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 515(C), pages 641-648.
    7. Jorge A. V. Tohalino & Laura V. C. Quispe & Diego R. Amancio, 2021. "Analyzing the relationship between text features and grants productivity," Scientometrics, Springer;Akadémiai Kiadó, vol. 126(5), pages 4255-4275, May.
    8. Jiang, Jianhua & Xu, Meirong & Meng, Xianqiu & Li, Keqin, 2020. "STSA: A sine Tree-Seed Algorithm for complex continuous optimization problems," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    9. Brito, Ana C.M. & Silva, Filipi N. & de Arruda, Henrique F. & Comin, Cesar H. & Amancio, Diego R. & Costa, Luciano da F., 2021. "Classification of abrupt changes along viewing profiles of scientific articles," Journal of Informetrics, Elsevier, vol. 15(2).
    10. Zhang, Yifan & Ng, S. Thomas, 2021. "Unveiling the rich-club phenomenon in urban mobility networks through the spatiotemporal characteristics of passenger flow," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 584(C).
    11. Guillaume Cabanac & Cyril Labbé, 2021. "Prevalence of nonsensical algorithmically generated papers in the scientific literature," Journal of the Association for Information Science & Technology, Association for Information Science & Technology, vol. 72(12), pages 1461-1476, December.
    12. Ehsan Ardjmand & William A. Young II & Najat E. Almasarwah, 2021. "Detecting Community Structures Within Complex Networks Using a Discrete Unconscious Search Algorithm," International Journal of Operations Research and Information Systems (IJORIS), IGI Global, vol. 12(2), pages 15-32, April.
    13. Liu, Saisai & Xia, Zhengyou, 2020. "A two-stage BFS local community detection algorithm based on node transfer similarity and Local Clustering Coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 537(C).
    14. Du, Ruijin & Zhang, Nidan & Zhang, Mengxi & Kong, Ziyang & Jia, Qiang & Dong, Gaogao & Tian, Lixin & Ahsan, Muhammad, 2024. "Identifying the optimal node group of carbon emission efficiency correlation network in China based on pinning control theory," Applied Energy, Elsevier, vol. 368(C).
    15. Jennifer A. Byrne & Cyril Labbé, 2017. "Striking similarities between publications from China describing single gene knockdown experiments in human cancer cell lines," Scientometrics, Springer;Akadémiai Kiadó, vol. 110(3), pages 1471-1493, March.
    16. Nguyen Minh Tien & Cyril Labbé, 2018. "Detecting automatically generated sentences with grammatical structure similarity," Scientometrics, Springer;Akadémiai Kiadó, vol. 116(2), pages 1247-1271, August.
    17. Jabari Lotf, Jalil & Abdollahi Azgomi, Mohammad & Ebrahimi Dishabi, Mohammad Reza, 2022. "An improved influence maximization method for social networks based on genetic algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 586(C).
    18. Aghaalizadeh, Saeid & Afshord, Saeid Taghavi & Bouyer, Asgarali & Anari, Babak, 2021. "A three-stage algorithm for local community detection based on the high node importance ranking in social networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 563(C).
    19. Chen, Chunchun & Zhu, Wenjie & Peng, Bo, 2022. "Differentiated graph regularized non-negative matrix factorization for semi-supervised community detection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 604(C).
    20. Liu, Qian & Wang, Jian & Zhao, Zhidan & Zhao, Na, 2022. "Relatively important nodes mining algorithm based on community detection and biased random walk with restart," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 607(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:eee:phsmap:v:587:y:2022:i:c:s037843712100786x. 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: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/physica-a-statistical-mechpplications/ .

    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.