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 条
  • [31] Node Classification in Weighted Complex Networks Using Neighborhood Feature Similarity
    Shetty, Ramya D.
    Bhattacharjee, Shrutilipi
    Thanmai, Kogatam
    IEEE TRANSACTIONS ON EMERGING TOPICS IN COMPUTATIONAL INTELLIGENCE, 2024, 8 (06): : 3982 - 3994
  • [32] Community Detection Algorithm Based on Structural Similarity for Bipartite Networks
    Chen, Dongming
    Yan, Yanbin
    Wang, Dongqi
    Huang, Xinyu
    PROCEEDINGS OF 2016 IEEE 7TH INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS 2016), 2016, : 98 - 102
  • [33] A novel similarity measure for the link prediction in unipartite and bipartite networks
    Purushottam Kumar
    Dolly Sharma
    Social Network Analysis and Mining, 2021, 11
  • [34] A novel similarity measure for the link prediction in unipartite and bipartite networks
    Kumar, Purushottam
    Sharma, Dolly
    SOCIAL NETWORK ANALYSIS AND MINING, 2021, 11 (01)
  • [35] Similarity-based Local Community Detection for Bipartite Networks
    Chen, Dongming
    Zhao, Wei
    Wang, Dongqi
    Huang, Xinyu
    FILOMAT, 2018, 32 (05) : 1559 - 1570
  • [36] Finding Maximum Edge Biclique in Bipartite Networks by Integer Programming
    Sozdinler, Melih
    Ozturan, Can
    2018 21ST IEEE INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE AND ENGINEERING (CSE 2018), 2018, : 132 - 137
  • [37] Finding Fault-tolerant Solutions for Complete Bipartite Networks
    Farrag, Abdel Aziz
    2014 ANNUAL GLOBAL ONLINE CONFERENCE ON INFORMATION AND COMPUTER TECHNOLOGY, 2014, : 85 - 89
  • [38] Finding the most vital node by node contraction in communication networks
    Wu, J
    Tan, YJ
    2005 INTERNATIONAL CONFERENCE ON COMMUNICATIONS, CIRCUITS AND SYSTEMS, VOLS 1 AND 2, PROCEEDINGS: VOL 1: COMMUNICATION THEORY AND SYSTEMS, 2005, : 1283 - 1286
  • [39] Maximal Neighbor Similarity Reveals Real Communities in Networks
    Zalik, Krista Rizman
    SCIENTIFIC REPORTS, 2015, 5
  • [40] Maximal Neighbor Similarity Reveals Real Communities in Networks
    Krista Rizman Žalik
    Scientific Reports, 5
12345