Finding maximal bicliques in bipartite networks using node similarity

被引：0
|
作者：
Taher Alzahrani
Kathy Horadam
机构：
[1] Mathematical Sciences,
[2] RMIT University,undefined
来源：
Applied Network Science | / 4卷
关键词：
Bipartite network; Overlapping community detection; Maximal biclique; Community strength; Node similarity;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In real world complex networks, communities are usually both overlapping and hierarchical. A very important class of complex networks is the bipartite networks. Maximal bicliques are the strongest possible structural communities within them.
引用
收藏
相关论文
共 50 条
  • [21] On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types
    Zhang, Yun
    Phillips, Charles A.
    Rogers, Gary L.
    Baker, Erich J.
    Chesler, Elissa J.
    Langston, Michael A.
    BMC BIOINFORMATICS, 2014, 15
  • [22] On finding bicliques in bipartite graphs: a novel algorithm and its application to the integration of diverse biological data types
    Yun Zhang
    Charles A Phillips
    Gary L Rogers
    Erich J Baker
    Elissa J Chesler
    Michael A Langston
    BMC Bioinformatics, 15
  • [23] Mixed Similarity Diffusion for Recommendation on Bipartite Networks
    Wang, Ximeng
    Liu, Yun
    Zhang, Guangquan
    Zhang, Yi
    Chen, Hongshu
    Lu, Jie
    IEEE ACCESS, 2017, 5 : 21029 - 21038
  • [24] Evolutionary method for finding communities in bipartite networks
    Zhan, Weihua
    Zhang, Zhongzhi
    Guan, Jihong
    Zhou, Shuigeng
    PHYSICAL REVIEW E, 2011, 83 (06)
  • [25] Algorithm for Mining Maximal Balanced Bicliques Using Formal Concept Analysis
    Sadriddinov, Ilkhomjon
    Peng, Sony
    Siet, Sophort
    Kim, Dae-Young
    Park, Doo-Soon
    Yi, Gangman
    IEEE ACCESS, 2025, 13 : 35113 - 35123
  • [26] Finding Maximal Cliques in Massive Networks
    Cheng, James
    Ke, Yiping
    Fu, Ada Wai-Chee
    Yu, Jeffrey Xu
    Zhu, Linhong
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2011, 36 (04):
  • [27] Exploiting node metadata to predict interactions in bipartite networks using graph embedding and neural networks
    Runghen, Rogini
    Stouffer, Daniel B. B.
    Dalla Riva, Giulio V. V.
    ROYAL SOCIETY OPEN SCIENCE, 2022, 9 (08):
  • [28] Comment on "Evolutionary method for finding communities in bipartite networks"
    Costa, Alberto
    Hansen, Pierre
    PHYSICAL REVIEW E, 2011, 84 (05)
  • [29] Measure of Node Similarity in Multilayer Networks
    Mollgaard, Anders
    Zettler, Ingo
    Dammeyer, Jesper
    Jensen, Mogens H.
    Lehmann, Sune
    Mathiesen, Joachim
    PLOS ONE, 2016, 11 (06):
  • [30] Finding Maximal Stable Cores in Social Networks
    Zhou, Alexander
    Zhang, Fan
    Yuan, Long
    Zhang, Ying
    Lin, Xuemin
    DATABASES THEORY AND APPLICATIONS, ADC 2018, 2018, 10837 : 224 - 235
12345