Most Similar Biclique Search at Scale
Summary: Proposes the "most similar biclique" objective (local: containing query q; global: highest vertex similarity) to find high-similarity bicliques as more meaningful bipartite communities than max-edge bicliques. Develops Mosib, an exact solver with three graph-reduction and two similarity-first search rules, and Mosib-GloApp, a MinHash-based approximate divider for scalable global search, demonstrating practical efficiency on real networks. (summarized by gpt-5-mini on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Deming Chu (University of New South Wales)
- 2. Zhizhi Gao (Guangdong University of Technology)
- 3. Fan Zhang (Guangdong University of Technology)
- 4. Wenjie Zhang (University of New South Wales)
- 5. Xuemin Lin (Shanghai Jiao Tong University)
- 6. Zhihong Tian (Guangdong University of Technology)
BibTeX Citation
@article{chu_vldb25,
title = {{Most Similar Biclique Search at Scale}},
author = {Chu, Deming and Gao, Zhizhi and Zhang, Fan and Zhang, Wenjie and Lin, Xuemin and Tian, Zhihong},
journal = {PVLDB},
series = {{VLDB} '25},
volume = {18},
number = {4},
pages = {1022--1034},
doi = {10.14778/3717755.3717763},
url = {https://doi.org/10.14778/3717755.3717763},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 0 of 0 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 10,308 | Zero-Redundancy Search for Bi-Components in Bipartite Graphs | 2026 | SIGMOD |
| 2 | 9,689 | Density Decomposition of Bipartite Graphs | 2025 | SIGMOD |
| 3 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 4 | 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB |
| 5 | 10,598 | Scalable Approximate Biclique Counting over Large Bipartite Graphs | 2026 | VLDB |
| 6 | 9,049 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD |
| 7 | 1,884 | Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs | 2021 | SIGMOD |
| 8 | 780 | Maximum Biclique Search at Billion Scale | 2020 | VLDB |
| 9 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 10 | 7,731 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB |