Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs

Summary: Dupin is a parallel DSD framework for billion-scale fraud graphs, exploiting peeling-based properties for scalable, quality-guaranteed detection with a flexible API. Up to 100x speedups; fraud detection improves 45.3% to 94.5%, density error below 5%. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID: 7280
Venue: SIGMOD
Year: 2025
Pagerank: 5.093636e-05
Overall Rank: 10,758 | 26.20%
DOI: 10.1145/3725287

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

1. Jiaxin Jiang (National University of Singapore)
2. Siyuan Yao (National University of Singapore)
3. Yuchen Li (Singapore Management University)
4. Qiange Wang (National University of Singapore)
5. Bingsheng He (National University of Singapore)
6. Min Chen (GrabTaxi Holdings)

BibTeX Citation

@inproceedings{jiang_sigmod25,
        title = {{Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs}},
        author = {Jiang, Jiaxin and Yao, Siyuan and Li, Yuchen and Wang, Qiange and He, Bingsheng and Chen, Min},
        series = {{SIGMOD} '25},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3725287},
        url = {https://dl.acm.org/doi/10.1145/3725287},
        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.

Rank	Cited Paper	Year	Venue	Pagerank
138	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00029823423
564	Densest Subgraph in Streaming and MapReduce	2012	VLDB	0.00016485347
706	Effective Community Search for Large Attributed Graphs	2016	VLDB	0.00014789612
1,307	KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs	2020	VLDB	0.00011232263
2,896	Online Density Bursting Subgraph Detection from Temporal Graphs	2019	VLDB	7.9828452e-05
3,337	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	7.5072753e-05
3,855	Distributed D-core Decomposition over Large Directed Graphs	2022	VLDB	7.0712144e-05
4,903	A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery	2022	SIGMOD	6.4520708e-05
7,011	GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection	2021	SIGMOD	5.7263348e-05
8,390	Spade: A Real-Time Fraud Detection Framework on Evolving Graphs	2023	VLDB	5.4360143e-05
9,189	RUSH: Real-time Burst Subgraph Detection in Dynamic Graphs	2024	VLDB	5.3058708e-05
9,948	uBlade: Efficient Batch Processing for Uncertain Graph Queries	2024	SIGMOD	5.1915905e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	11,608	Densest Subgraph Discovery on Large Graphs: Applications, Challenges, and Techniques	2022	VLDB
2	9,689	Density Decomposition of Bipartite Graphs	2025	SIGMOD
3	13,362	Spade: A Real-Time Fraud Detection Framework	2024	VLDB
4	10,807	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB
5	10,767	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD
6	9,189	RUSH: Real-time Burst Subgraph Detection in Dynamic Graphs	2024	VLDB
7	4,666	xFraud: Explainable Fraud Transaction Detection	2022	VLDB
8	7,011	GPU-Accelerated Graph Label Propagation for Real-Time Fraud Detection	2021	SIGMOD
9	3,737	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD
10	8,390	Spade: A Real-Time Fraud Detection Framework on Evolving Graphs	2023	VLDB