Parallel Peeling of Bipartite Networks for Hierarchical Dense Subgraph Discovery

10/24/2021
by   Kartik Lakhotia, et al.
0

Wing and Tip decomposition construct a hierarchy of butterfly-dense edge and vertex induced bipartite subgraphs, respectively. They have applications in several domains including e-commerce, recommendation systems and document analysis. Existing decomposition algorithms use a bottom-up approach that constructs the hierarchy in an increasing order of subgraph density. They iteratively peel the entities with minimum butterfly count i.e. remove them from the graph and update the butterfly count of other entities. However, the amount of butterflies in large bipartite graphs makes bottom-up peeling computationally demanding. Furthermore, the strict order of peeling entities results in a numerous sequentially dependent iterations, which makes parallelization challenging. In this paper, we propose a novel Parallel Bipartite Network peelinG (PBNG) framework which adopts a two-phased peeling approach to relax the order of peeling, and in turn, reduce synchronization. The first phase divides the decomposition hierarchy into several partitions using very few peeling iterations. The second phase concurrently processes these partitions to generate the final hierarchy, and requires no global synchronization. The two-phased peeling further enables batching optimizations that dramatically improve the computational efficiency. We empirically evaluate PBNG using several real-world bipartite graphs. Compared to the state-of-the-art frameworks and decomposition algorithms, PBNG achieves up to four orders of magnitude reduction in synchronization and two orders of magnitude speedup, respectively. We also present the first decomposition results of some of the largest public real-world datasets, which PBNG can peel in few minutes but existing algorithms fail to process even in several days.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/17/2020

RECEIPT: REfine CoarsE-grained IndePendent Tasks for Parallel Tip decomposition of Bipartite Graphs

Tip decomposition is a crucial kernel for mining dense subgraphs in bipa...
research
01/16/2020

Efficient Bitruss Decomposition for Large-scale Bipartite Graphs

Cohesive subgraph mining in bipartite graphs becomes a popular research ...
research
07/19/2019

Parallel Algorithms for Butterfly Computations

Butterflies are the smallest non-trivial subgraph in bipartite graphs, a...
research
06/14/2023

Parallel Algorithms for Hierarchical Nucleus Decomposition

Nucleus decompositions have been shown to be a useful tool for finding d...
research
01/04/2021

Searching Personalized k-wing in Large and Dynamic Bipartite Graphs

There are extensive studies focusing on the application scenario that al...
research
12/23/2019

EnsemFDet: An Ensemble Approach to Fraud Detection based on Bipartite Graph

Fraud detection is extremely critical for e-commerce business. It is the...
research
03/13/2014

Scalable and Robust Construction of Topical Hierarchies

Automated generation of high-quality topical hierarchies for a text coll...

Please sign up or login with your details

Forgot password? Click here to reset