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

Uncovering overlapping community structures by the key bi-community and intimate degree in bipartite networks

Author

Listed:
  • Cui, Yaozu
  • Wang, Xingyuan

Abstract

Although many successful algorithms have been designed to discover community structures in network, most of them are dedicated to disjoint and non-overlapping communities. Very few of them are intended to discover overlapping communities, particularly the detection of such communities have hardly been explored in the bipartite networks. In this paper, a novel algorithm is proposed to detect overlapping community structures in bipartite networks. After analyzing the topological properties in bipartite networks, the key bi-communities and free-nodes are introduced. Firstly, some key bi-communities and free-nodes are extracted from the original bipartite networks. Then the free-nodes are allocated into a certain key bi-community by some given rules. In addition, the proposed algorithm successfully finds overlapping vertices between communities. Experimental results using some real-world networks data show that the performance of the proposed algorithm is satisfactory.

Suggested Citation

  • Cui, Yaozu & Wang, Xingyuan, 2014. "Uncovering overlapping community structures by the key bi-community and intimate degree in bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 407(C), pages 7-14.
    • Handle: RePEc:eee:phsmap:v:407:y:2014:i:c:p:7-14
    DOI: 10.1016/j.physa.2014.03.077
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S037843711400288X
    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.2014.03.077?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. Zhang, Peng & Wang, Jinliang & Li, Xiaojia & Li, Menghui & Di, Zengru & Fan, Ying, 2008. "Clustering coefficient and community structure of bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 387(27), pages 6869-6875.
    2. Pablo M. Gleiser & Leon Danon, 2003. "Community Structure In Jazz," Advances in Complex Systems (ACS), World Scientific Publishing Co. Pte. Ltd., vol. 6(04), pages 565-573.
    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. Wang, Xingyuan & Qin, Xiaomeng, 2016. "Asymmetric intimacy and algorithm for detecting communities in bipartite networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 462(C), pages 569-578.
    2. Yubo Peng & Bofeng Zhang & Furong Chang, 2021. "Overlapping Community Detection of Bipartite Networks Based on a Novel Community Density," Future Internet, MDPI, vol. 13(4), pages 1-21, March.
    3. Nan, Dong-Yang & Yu, Wei & Liu, Xiao & Zhang, Yun-Peng & Dai, Wei-Di, 2018. "A framework of community detection based on individual labels in attribute networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 512(C), pages 523-536.
    4. Wang, Tao & Wang, Hongjue & Wang, Xiaoxia, 2015. "A novel cosine distance for detecting communities in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 437(C), pages 21-35.
    5. Luo, Chao & Zhang, Xiaolin & Liu, Hong & Shao, Rui, 2016. "Cooperation in memory-based prisoner’s dilemma game on interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 450(C), pages 560-569.
    6. Hu, Fang & Liu, Yuhua, 2016. "A new algorithm CNM-Centrality of detecting communities based on node centrality," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 446(C), pages 138-151.
    7. Zhang, Hong, 2015. "Moderate tolerance promotes tag-mediated cooperation in spatial Prisoner’s dilemma game," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 52-61.
    8. Shang, Ronghua & Luo, Shuang & Li, Yangyang & Jiao, Licheng & Stolkin, Rustam, 2015. "Large-scale community detection based on node membership grade and sub-communities integration," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 428(C), pages 279-294.
    9. Sun, Hong-liang & Ch’ng, Eugene & Yong, Xi & Garibaldi, Jonathan M. & See, Simon & Chen, Duan-bing, 2018. "A fast community detection method in bipartite networks by distance dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 496(C), pages 108-120.
    10. Li, Jin-Yang & Teng, Jing & Wang, Hui, 2023. "Integrating bipartite network modelling and overlapping community detection: A new method to evaluate transit line coordination," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 628(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. Cui, Yaozu & Wang, Xingyuan, 2016. "Detecting one-mode communities in bipartite networks by bipartite clustering triangular," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 307-315.
    2. Ramadiah, Amanah & Caccioli, Fabio & Fricke, Daniel, 2020. "Reconstructing and stress testing credit networks," Journal of Economic Dynamics and Control, Elsevier, vol. 111(C).
    3. Zhang, Wen-Yao & Wei, Zong-Wen & Wang, Bing-Hong & Han, Xiao-Pu, 2016. "Measuring mixing patterns in complex networks by Spearman rank correlation coefficient," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 451(C), pages 440-450.
    4. Zhang, Yun & Liu, Yongguo & Li, Jieting & Zhu, Jiajing & Yang, Changhong & Yang, Wen & Wen, Chuanbiao, 2020. "WOCDA: A whale optimization based community detection algorithm," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    5. Rezvanian, Alireza & Meybodi, Mohammad Reza, 2015. "Sampling social networks using shortest paths," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 424(C), pages 254-268.
    6. Kong, Hanzhang & Kang, Qinma & Li, Wenquan & Liu, Chao & Kang, Yunfan & He, Hong, 2019. "A hybrid iterated carousel greedy algorithm for community detection in complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    7. Yuan, Quan & Liu, Binghui, 2021. "Community detection via an efficient nonconvex optimization approach based on modularity," Computational Statistics & Data Analysis, Elsevier, vol. 157(C).
    8. 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.
    9. Fatemi, Samira & Salehi, Mostafa & Veisi, Hadi & Jalili, Mahdi, 2018. "A fuzzy logic based estimator for respondent driven sampling of complex networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 510(C), pages 42-51.
    10. Zhao, Shuying & Sun, Shaowei, 2023. "Identification of node centrality based on Laplacian energy of networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 609(C).
    11. Zhe Li & Xinyu Huang, 2023. "Identifying Influential Spreaders Using Local Information," Mathematics, MDPI, vol. 11(6), pages 1-14, March.
    12. Liu, X. & Murata, T., 2010. "Advanced modularity-specialized label propagation algorithm for detecting communities in networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 389(7), pages 1493-1500.
    13. Etienne Côme & Nicolas Jouvin & Pierre Latouche & Charles Bouveyron, 2021. "Hierarchical clustering with discrete latent variable models and the integrated classification likelihood," 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. 15(4), pages 957-986, December.
    14. Li, Hanwen & Shang, Qiuyan & Deng, Yong, 2021. "A generalized gravity model for influential spreaders identification in complex networks," Chaos, Solitons & Fractals, Elsevier, vol. 143(C).
    15. Namtirtha, Amrita & Dutta, Animesh & Dutta, Biswanath, 2018. "Identifying influential spreaders in complex networks based on kshell hybrid method," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 499(C), pages 310-324.
    16. Huang, Chung-Yuan & Chin, Wei-Chien-Benny & Fu, Yu-Hsiang & Tsai, Yu-Shiuan, 2019. "Beyond bond links in complex networks:Local bridges, global bridges and silk links," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 536(C).
    17. Cheng, Le & Li, Xianghua & Han, Zhen & Luo, Tengyun & Ma, Lianbo & Zhu, Peican, 2022. "Path-based multi-sources localization in multiplex networks," Chaos, Solitons & Fractals, Elsevier, vol. 159(C).
    18. Wang, Zhixiao & Zhao, Ya & Xi, Jingke & Du, Changjiang, 2016. "Fast ranking influential nodes in complex networks using a k-shell iteration factor," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 461(C), pages 171-181.
    19. Wu, Tao & Chen, Leiting & Zhong, Linfeng & Xian, Xingping, 2017. "Predicting the evolution of complex networks via similarity dynamics," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 465(C), pages 662-672.
    20. Long, Yong-Shang & Jia, Zhen & Wang, Ying-Ying, 2018. "Coarse graining method based on generalized degree in complex network," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 505(C), pages 655-665.

    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:407:y:2014:i:c:p:7-14. 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.