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

Asymmetric intimacy and algorithm for detecting communities in bipartite networks

Author

Listed:
  • Wang, Xingyuan
  • Qin, Xiaomeng

Abstract

In this paper, an algorithm to choose a good partition in bipartite networks has been proposed. Bipartite networks have more theoretical significance and broader prospect of application. In view of distinctive structure of bipartite networks, in our method, two parameters are defined to show the relationships between the same type nodes and heterogeneous nodes respectively. Moreover, our algorithm employs a new method of finding and expanding the core communities in bipartite networks. Two kinds of nodes are handled separately and merged, and then the sub-communities are obtained. After that, objective communities will be found according to the merging rule. The proposed algorithm has been simulated in real-world networks and artificial networks, and the result verifies the accuracy and reliability of the parameters on intimacy for our algorithm. Eventually, comparisons with similar algorithms depict that the proposed algorithm has better performance.

Suggested Citation

  • 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.
    • Handle: RePEc:eee:phsmap:v:462:y:2016:i:c:p:569-578
    DOI: 10.1016/j.physa.2016.06.096
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0378437116303715
    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.2016.06.096?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. Mukherjee, Animesh & Choudhury, Monojit & Ganguly, Niloy, 2011. "Understanding how both the partitions of a bipartite network affect its one-mode projection," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3602-3607.
    3. Jose C Nacher & Jean-Marc Schwartz, 2012. "Modularity in Protein Complex and Drug Interactions Reveals New Polypharmacological Properties," PLOS ONE, Public Library of Science, vol. 7(1), pages 1-13, January.
    4. Mitrović, Marija & Tadić, Bosiljka, 2012. "Dynamics of bloggers’ communities: Bipartite networks from empirical data and agent-based modeling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(21), pages 5264-5278.
    5. H. Jeong & B. Tombor & R. Albert & Z. N. Oltvai & A.-L. Barabási, 2000. "The large-scale organization of metabolic networks," Nature, Nature, vol. 407(6804), pages 651-654, October.
    6. 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.
    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. Yang, Guizhen & Qi, Xiaogang & Liu, Lifang, 2020. "Research on network robustness based on different deliberate attack methods," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 545(C).
    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. Li, Ruimeng & Yang, Naiding & Zhang, Yanlu & Liu, Hui & Zhang, Mingzhen, 2021. "Impacts of module–module aligned patterns on risk cascading propagation in complex product development (CPD) interdependent networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 564(C).
    4. 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.
    5. Qi, Xiaogang & Yang, Guizhen & Liu, Lifang, 2020. "Robustness analysis of the networks in cascading failures with controllable parameters," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 539(C).
    6. Jiang, Xurui & Wen, Xiangxi & Wu, Minggong & Song, Min & Tu, Congliang, 2019. "A complex network analysis approach for identifying air traffic congestion based on independent component analysis," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 523(C), pages 364-381.
    7. 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.

    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. 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.
    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. Biggiero, Lucio & Angelini, Pier Paolo, 2015. "Hunting scale-free properties in R&D collaboration networks: Self-organization, power-law and policy issues in the European aerospace research area," Technological Forecasting and Social Change, Elsevier, vol. 94(C), pages 21-43.
    4. 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.
    5. Qiao, Jian & Meng, Ying-Ying & Chen, Hsinchun & Huang, Hong-Qiao & Li, Guo-Ying, 2016. "Modeling one-mode projection of bipartite networks by tagging vertex information," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 457(C), pages 270-279.
    6. Jin Wang & Bo Huang & Xuefeng Xia & Zhirong Sun, 2006. "Funneled Landscape Leads to Robustness of Cell Networks: Yeast Cell Cycle," PLOS Computational Biology, Public Library of Science, vol. 2(11), pages 1-10, November.
    7. Zhou, Wei-Xing & Jiang, Zhi-Qiang & Sornette, Didier, 2007. "Exploring self-similarity of complex cellular networks: The edge-covering method with simulated annealing and log-periodic sampling," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 375(2), pages 741-752.
    8. Ramadiah, Amanah & Caccioli, Fabio & Fricke, Daniel, 2020. "Reconstructing and stress testing credit networks," Journal of Economic Dynamics and Control, Elsevier, vol. 111(C).
    9. Jorge Peña & Yannick Rochat, 2012. "Bipartite Graphs as Models of Population Structures in Evolutionary Multiplayer Games," PLOS ONE, Public Library of Science, vol. 7(9), pages 1-13, September.
    10. Sgrignoli, P. & Agliari, E. & Burioni, R. & Schianchi, A., 2015. "Instability and network effects in innovative markets," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 108(C), pages 260-271.
    11. Long Ma & Xiao Han & Zhesi Shen & Wen-Xu Wang & Zengru Di, 2015. "Efficient Reconstruction of Heterogeneous Networks from Time Series via Compressed Sensing," PLOS ONE, Public Library of Science, vol. 10(11), pages 1-12, November.
    12. Christian F A Negre & Hayato Ushijima-Mwesigwa & Susan M Mniszewski, 2020. "Detecting multiple communities using quantum annealing on the D-Wave system," PLOS ONE, Public Library of Science, vol. 15(2), pages 1-14, February.
    13. Tamás Nepusz & Tamás Vicsek, 2013. "Hierarchical Self-Organization of Non-Cooperating Individuals," PLOS ONE, Public Library of Science, vol. 8(12), pages 1-9, December.
    14. Aslam, Faheem & Aziz, Saqib & Nguyen, Duc Khuong & Mughal, Khurrum S. & Khan, Maaz, 2020. "On the efficiency of foreign exchange markets in times of the COVID-19 pandemic," Technological Forecasting and Social Change, Elsevier, vol. 161(C).
    15. Semi Min & Juyong Park, 2019. "Modeling narrative structure and dynamics with networks, sentiment analysis, and topic modeling," PLOS ONE, Public Library of Science, vol. 14(12), pages 1-20, December.
    16. Jiang, Jingchi & Zheng, Jichuan & Zhao, Chao & Su, Jia & Guan, Yi & Yu, Qiubin, 2016. "Clinical-decision support based on medical literature: A complex network approach," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 459(C), pages 42-54.
    17. Gerhardt, Günther J.L. & Lemke, Ney & Corso, Gilberto, 2006. "Network clustering coefficient approach to DNA sequence analysis," Chaos, Solitons & Fractals, Elsevier, vol. 28(4), pages 1037-1045.
    18. Laurienti, Paul J. & Joyce, Karen E. & Telesford, Qawi K. & Burdette, Jonathan H. & Hayasaka, Satoru, 2011. "Universal fractal scaling of self-organized networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 390(20), pages 3608-3613.
    19. Chen, Qinghua & Shi, Dinghua, 2004. "The modeling of scale-free networks," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 335(1), pages 240-248.
    20. 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.

    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:462:y:2016:i:c:p:569-578. 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.