On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms

10/16/2018
by   Yikun Ban, et al.
0

Detecting dense subgraphs from large graphs is a core component in many applications, ranging from social networks mining, bioinformatics. In this paper, we focus on mining dense subgraphs in a bipartite graph. The work is motivated by the task of detecting synchronized behavior that can often be formulated as mining a bipartite graph formed by the source nodes (followers, customers) and target nodes (followees, products, etc.) for malicious patterns. We introduce a new restricted biclique problem, Maximal Half Isolated Biclique (MHI Biclique), and show that the problem finds immediate applications in fraud detection. We prove that, unlike many other biclique problems such as the maximum edge biclique problem that are known to be NP-Complete, the MHI Biclique problem admits a linear time solution. We provide a novel algorithm S-tree, and its extension, S-forest, that solves the problem efficiently. We also demonstrate that the algorithms are robust against deliberate camouflaging and other perturbations. Furthermore, our approach can automatically combine and prioritize multiple features, reducing the need for feature engineering while maintaining security against unseen attacks. Extensive experiments on several public and proprietary datasets demonstrate that S-tree/S-forest outperforms strong rivals across all configurations, becoming the new state of the art in fraud detection.

READ FULL TEXT
research
10/16/2018

On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms with Applications to Fraud Detection

Detecting dense subgraphs from large graphs is a core component in many ...
research
10/02/2021

Decomposing a graph into subgraphs with small components

The component size of a graph is the maximum number of edges in any conn...
research
12/02/2020

Tree-width dichotomy

We prove that the tree-width of graphs in a hereditary class defined by ...
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
05/16/2018

Investigating the Agility Bias in DNS Graph Mining

The concept of agile domain name system (DNS) refers to dynamic and rapi...
research
04/16/2018

Hardness and structural results for half-squares of restricted tree convex bipartite graphs

Let B=(X,Y,E) be a bipartite graph. A half-square of B has one color cla...
research
07/08/2020

Mining Dense Subgraphs with Similar Edges

When searching for interesting structures in graphs, it is often importa...

Please sign up or login with your details

Forgot password? Click here to reset