Affiliation:
1. Swinburne University of Technology, Melbourne, Australia
2. Soochow University, Suzhou, China
3. Deakin University, Melbourne, Australia
Abstract
Maximal bicliques are effective to reveal meaningful information hidden in bipartite graphs. Maximal biclique enumeration (MBE) is challenging since the number of the maximal bicliques grows exponentially w.r.t. the number of vertices in a bipartite graph in the worst case. However, a large bipartite graph is usually very sparse, which is against the worst case and may lead to fast MBE algorithms. The uncharted opportunity is taking advantage of the sparsity to substantially improve the MBE efficiency for large sparse bipartite graphs. We observe that for a large sparse bipartite graph, a vertex
u
may converge to a few vertices in the same vertex set as
u
via its neighbours, which reveals that the enumeration scope for a vertex could be very small. Based on this observation, we propose novel concepts: unilateral coreness for individual vertices, unilateral order for each vertex set and unilateral convergence (ζ) for a large sparse bipartite graph, ζ could be a few thousand for a large sparse bipartite graph with hundreds of million edges. Using the unilateral order, every vertex with τ unilateral coreness only needs to check at most 2
τ
combinations so that all maximal bicliques can be enumerated and τ is bounded by ζ, which leads to a novel MBE algorithm running in
O
*
(2
ζ
). We then propose a batch-pivots technique to eliminate all enumerations resulting in non-maximal bicliques, which guarantees that every maximal biclique is reported in
O
(ζ
e
)-delay, where
e
is the number of edges. We devise novel data structures that allow storing subgraphs at omissible space for further speeding up MBE. Extensive experiments are conducted on synthetic and real large datasets to justify that our proposed algorithm is faster and more scalable than the existing algorithms.
Publisher
Association for Computing Machinery (ACM)
Subject
General Earth and Planetary Sciences,Water Science and Technology,Geography, Planning and Development
Reference49 articles.
1. 2017. https://github.com/ddervs/MBEA Online ; accessed 12 December 2021 . 2017. https://github.com/ddervs/MBEA Online; accessed 12 December 2021.
2. Pivot-based Maximal Biclique Enumeration
3. Graph structure in the Web
4. Topological structure analysis of the protein-protein interaction network in budding yeast
5. Lijun Chang and Lu Qin . 2018. Cohesive subgraph computation over large sparse graphs: algorithms, data structures, and programming techniques . Springer . Lijun Chang and Lu Qin. 2018. Cohesive subgraph computation over large sparse graphs: algorithms, data structures, and programming techniques. Springer.
Cited by
15 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. DeepDense: Enabling node embedding to dense subgraph mining;Expert Systems with Applications;2024-03
2. Identifying similar-bicliques in bipartite graphs;The VLDB Journal;2024-01-25
3. Efficient Maximal Biclique Enumeration on Large Uncertain Bipartite Graphs;IEEE Transactions on Knowledge and Data Engineering;2023-12-01
4. Efficient Maximal Biclique Enumeration on GPUs;Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis;2023-11-11
5. Fairness-Aware Maximal Clique in Large Graphs: Concepts and Algorithms;IEEE Transactions on Knowledge and Data Engineering;2023-11-01