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

12/23/2019
by   Yuxiang Ren, et al.
0

Fraud detection is extremely critical for e-commerce business. It is the intent of the companies to detect and prevent fraud as early as possible. Existing fraud detection methods try to identify unexpected dense subgraphs and treat related nodes as suspicious. Spectral relaxation-based methods solve the problem efficiently but hurt the performance due to the relaxed constraints. Besides, many methods cannot be accelerated with parallel computation or control the number of returned suspicious nodes because they provide a set of subgraphs with diverse node sizes. These drawbacks affect the real-world applications of existing methods. In this paper, we propose an Ensemble-based Fraud Detection (EnsemFDet) method to scale up fraud detection in bipartite graphs by decomposing the original problem into subproblems on small-sized subgraphs. By oversampling the graph and solving the subproblems, the ensemble approach further votes suspicious nodes without sacrificing the prediction accuracy. Extensive experiments have been done on real transaction data from JD.com, which is one of the world's largest e-commerce platforms. Experimental results demonstrate the effectiveness, practicability, and scalability of EnsemFDet. More specifically, EnsemFDet is up to 100x faster than the state-of-the-art methods due to its parallelism with all aspects of data.

READ FULL TEXT

page 1

page 2

page 3

page 4

06/18/2019

TitAnt: Online Real-time Transaction Fraud Detection in Ant Financial

With the explosive growth of e-commerce and the booming of e-payment, de...
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 ...
10/16/2018

On Finding Dense Subgraphs in Bipartite Graphs: Linear Algorithms

Detecting dense subgraphs from large graphs is a core component in many ...
06/27/2019

Adversarial Representation Learning on Large-Scale Bipartite Graphs

Graph representation on large-scale bipartite graphs is central for a va...
08/28/2018

Enumerating Top-k Quasi-Cliques

Quasi-cliques are dense incomplete subgraphs of a graph that generalize ...
12/03/2021

Feature Importance-aware Graph Attention Network and Dueling Double Deep Q-Network Combined Approach for Critical Node Detection Problems

Detecting critical nodes in sparse networks is important in a variety of...
10/24/2021

Parallel Peeling of Bipartite Networks for Hierarchical Dense Subgraph Discovery

Wing and Tip decomposition construct a hierarchy of butterfly-dense edge...