IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i16p3497-d1216344.html
   My bibliography  Save this article

HLEGF: An Effective Hypernetwork Community Detection Algorithm Based on Local Expansion and Global Fusion

Author

Listed:
  • Feng Wang

    (School of Computer, Qinghai Normal University, Xining 810008, China
    The State Key Laboratory of Tibetan Intelligent Information Processing and Application, Xining 810008, China)

  • Feng Hu

    (School of Computer, Qinghai Normal University, Xining 810008, China
    The State Key Laboratory of Tibetan Intelligent Information Processing and Application, Xining 810008, China)

  • Rumeng Chen

    (School of Computer, Qinghai Normal University, Xining 810008, China
    The State Key Laboratory of Tibetan Intelligent Information Processing and Application, Xining 810008, China)

  • Naixue Xiong

    (Department of Computer, Mathematical and Physical Sciences, Sul Ross State University, Alpine, TX 79830, USA)

Abstract

Community structure is crucial for understanding network characteristics, and the local expansion method has performed well in detecting community structures. However, there are two problems with this method. Firstly, it can only add nodes or edges on the basis of existing clusters, and secondly, it can produce a large number of small communities. In this paper, we extend the local expansion method based on ordinary graph to hypergraph, and propose an effective hypernetwork community detection algorithm based on local expansion (LE) and global fusion (GF), which is referred to as HLEGF. The LE process obtains multiple small sub-hypergraphs by deleting and adding hyperedges, while the GF process optimizes the sub-hypergraphs generated by the local expansion process. To solve the first problem, the HLEGF algorithm introduces the concepts of community neighborhood and community boundary to delete some nodes and hyperedges in hypergraphs. To solve the second problem, the HLEGF algorithm establishes correlations between adjacent sub-hypergraphs through global fusion. We evaluated the performance of the HLEGF algorithm in the real hypernetwork and six synthetic random hypernetworks with different probabilities. Because the HLEGF algorithm introduces the concepts of community boundary and neighborhood, and the concept of a series of similarities, the algorithm has superiority. In the real hypernetwork, the HLEGF algorithm is consistent with the classical Spectral algorithm, while in the random hypernetwork, when the probability is not less than 0.95, the NMI value of the HLEGF algorithm is always greater than 0.92, and the RI value is always greater than 0.97. When the probability is 0.95, the HLEGF algorithm achieves a 2.3% improvement in the NMI value, compared to the Spectral algorithm. Finally, we applied the HLEGF algorithm to the drug–target hypernetwork to partition drugs with similar functions into communities.

Suggested Citation

  • Feng Wang & Feng Hu & Rumeng Chen & Naixue Xiong, 2023. "HLEGF: An Effective Hypernetwork Community Detection Algorithm Based on Local Expansion and Global Fusion," Mathematics, MDPI, vol. 11(16), pages 1-17, August.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:16:p:3497-:d:1216344
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/16/3497/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/16/3497/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Liu, Zhong & Huang, Jincai & Cheng, Guangquan, 2016. "Community detection in hypernetwork via Density-Ordered Tree partitionAuthor-Name: Cheng, Qing," Applied Mathematics and Computation, Elsevier, vol. 276(C), pages 384-393.
    2. Duncan J. Watts & Steven H. Strogatz, 1998. "Collective dynamics of ‘small-world’ networks," Nature, Nature, vol. 393(6684), pages 440-442, June.
    3. Estrada, Ernesto & Rodríguez-Velázquez, Juan A., 2006. "Subgraph centrality and clustering in complex hyper-networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 364(C), pages 581-594.
    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. Yu, Ping & Wang, Zhiping & Wang, Peiwen & Yin, Haofei & Wang, Jia, 2022. "Dynamic evolution of shipping network based on hypergraph," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 598(C).
    2. Yuanzhao Zhang & Maxime Lucas & Federico Battiston, 2023. "Higher-order interactions shape collective dynamics differently in hypergraphs and simplicial complexes," Nature Communications, Nature, vol. 14(1), pages 1-8, December.
    3. Huan Wang & Chuang Ma & Han-Shuang Chen & Ying-Cheng Lai & Hai-Feng Zhang, 2022. "Full reconstruction of simplicial complexes from binary contagion and Ising data," Nature Communications, Nature, vol. 13(1), pages 1-10, December.
    4. Vinayak, & Raghuvanshi, Adarsh & kshitij, Avinash, 2023. "Signatures of capacity development through research collaborations in artificial intelligence and machine learning," Journal of Informetrics, Elsevier, vol. 17(1).
    5. Supriya Tiwari & Pallavi Basu, 2024. "Quasi-randomization tests for network interference," Papers 2403.16673, arXiv.org.
    6. Anzhi Sheng & Qi Su & Aming Li & Long Wang & Joshua B. Plotkin, 2023. "Constructing temporal networks with bursty activity patterns," Nature Communications, Nature, vol. 14(1), pages 1-10, December.
    7. Guihai Yu & Renjie Wu & Xingfu Li, 2022. "The Connective Eccentricity Index of Hypergraphs," Mathematics, MDPI, vol. 10(23), pages 1-15, December.
    8. Samrachana Adhikari & Beau Dabbs, 2018. "Social Network Analysis in R: A Software Review," Journal of Educational and Behavioral Statistics, , vol. 43(2), pages 225-253, April.
    9. Wang, Xiaojie & Slamu, Wushour & Guo, Wenqiang & Wang, Sixiu & Ren, Yan, 2022. "A novel semi local measure of identifying influential nodes in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 158(C).
    10. Lin, Dan & Wu, Jiajing & Xuan, Qi & Tse, Chi K., 2022. "Ethereum transaction tracking: Inferring evolution of transaction networks via link prediction," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 600(C).
    11. Ferreira, D.S.R. & Ribeiro, J. & Oliveira, P.S.L. & Pimenta, A.R. & Freitas, R.P. & Dutra, R.S. & Papa, A.R.R. & Mendes, J.F.F., 2022. "Spatiotemporal analysis of earthquake occurrence in synthetic and worldwide data," Chaos, Solitons & Fractals, Elsevier, vol. 165(P2).
    12. Mario V. Tomasello & Mauro Napoletano & Antonios Garas & Frank Schweitzer, 2017. "The rise and fall of R&D networks," Industrial and Corporate Change, Oxford University Press and the Associazione ICC, vol. 26(4), pages 617-646.
    13. Qinghu Liao & Wenwen Dong & Boxin Zhao, 2023. "A New Strategy to Solve “the Tragedy of the Commons” in Sustainable Grassland Ecological Compensation: Experience from Inner Mongolia, China," Sustainability, MDPI, vol. 15(12), pages 1-24, June.
    14. Xinyu Huang & Dongming Chen & Dongqi Wang & Tao Ren, 2020. "MINE: Identifying Top- k Vital Nodes in Complex Networks via Maximum Influential Neighbors Expansion," Mathematics, MDPI, vol. 8(9), pages 1-25, August.
    15. Xueguo Xu & Chen Xu & Wenxin Zhang, 2022. "Research on the Destruction Resistance of Giant Urban Rail Transit Network from the Perspective of Vulnerability," Sustainability, MDPI, vol. 14(12), pages 1-26, June.
    16. Jianhong Chen & Hongcai Ma & Shan Yang, 2023. "SEIOR Rumor Propagation Model Considering Hesitating Mechanism and Different Rumor-Refuting Ways in Complex Networks," Mathematics, MDPI, vol. 11(2), pages 1-22, January.
    17. Xiaokun Su & Chenrouyu Zheng & Yefei Yang & Yafei Yang & Wen Zhao & Yue Yu, 2022. "Spatial Structure and Development Patterns of Urban Traffic Flow Network in Less Developed Areas: A Sustainable Development Perspective," Sustainability, MDPI, vol. 14(13), pages 1-18, July.
    18. Manisha Sawant & Rupali Patil & Tanmay Shikhare & Shreyas Nagle & Sakshi Chavan & Shivang Negi & Neeraj Dhanraj Bokde, 2022. "A Selective Review on Recent Advancements in Long, Short and Ultra-Short-Term Wind Power Prediction," Energies, MDPI, vol. 15(21), pages 1-24, October.
    19. Vincenza Carchiolo & Marco Grassia & Michele Malgeri & Giuseppe Mangioni, 2022. "Co-Authorship Networks Analysis to Discover Collaboration Patterns among Italian Researchers," Future Internet, MDPI, vol. 14(6), pages 1-15, June.
    20. Gregory Gutin & Tomohiro Hirano & Sung-Ha Hwang & Philip R. Neary & Alexis Akira Toda, 2021. "The effect of social distancing on the reach of an epidemic in social networks," Journal of Economic Interaction and Coordination, Springer;Society for Economic Science with Heterogeneous Interacting Agents, vol. 16(3), pages 629-647, July.

    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:gam:jmathe:v:11:y:2023:i:16:p:3497-:d:1216344. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.