Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs (Technical Report)
Fuente:
arXiv
Guardado en:
| Autores principales: | Jiang, Jiaxin, Yao, Siyuan, Li, Yuchen, Wang, Qiange, He, Bingsheng, Chen, Min |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
por: Zhou, Yingli, et al.
Publicado: (2024)
por: Zhou, Yingli, et al.
Publicado: (2024)
Efficient Densest Flow Queries in Transaction Flow Networks (Complete Version)
por: Jiang, Jiaxin, et al.
Publicado: (2026)
por: Jiang, Jiaxin, et al.
Publicado: (2026)
Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
por: Yang, Yi, et al.
Publicado: (2025)
por: Yang, Yi, et al.
Publicado: (2025)
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
por: Ye, Yutong, et al.
Publicado: (2026)
por: Ye, Yutong, et al.
Publicado: (2026)
Revisiting the Design of In-Memory Dynamic Graph Storage
por: Su, Jixian, et al.
Publicado: (2025)
por: Su, Jixian, et al.
Publicado: (2025)
Efficient Exact Subgraph Matching via GNN-based Path Dominance Embedding (Technical Report)
por: Ye, Yutong, et al.
Publicado: (2023)
por: Ye, Yutong, et al.
Publicado: (2023)
Towards Autonomous Graph Data Analytics with Analytics-Augmented Generation
por: Wang, Qiange, et al.
Publicado: (2026)
por: Wang, Qiange, et al.
Publicado: (2026)
Continuous Subgraph Matching via Cost-Model-based Dynamic Vertex Dominance Embeddings (Technical Report)
por: Ye, Yutong, et al.
Publicado: (2024)
por: Ye, Yutong, et al.
Publicado: (2024)
ML-Asset Management: Curation, Discovery, and Utilization
por: Wang, Mengying, et al.
Publicado: (2025)
por: Wang, Mengying, et al.
Publicado: (2025)
S$^3$GND: An Effective Learning-Based Approach for Subgraph Similarity Search Under Generalized Neighbor Difference Semantics (Technical Report)
por: Wen, Qi, et al.
Publicado: (2026)
por: Wen, Qi, et al.
Publicado: (2026)
S3AND: Efficient Subgraph Similarity Search Under Aggregated Neighbor Difference Semantics (Technical Report)
por: Wen, Qi, et al.
Publicado: (2025)
por: Wen, Qi, et al.
Publicado: (2025)
Color: A Framework for Applying Graph Coloring to Subgraph Cardinality Estimation
por: Deeds, Kyle, et al.
Publicado: (2024)
por: Deeds, Kyle, et al.
Publicado: (2024)
Efficient Partition-based Approaches for Diversified Top-k Subgraph Matching
por: Chen, Liuyi, et al.
Publicado: (2025)
por: Chen, Liuyi, et al.
Publicado: (2025)
Optimal $(α,β)$-Dense Subgraph Search in Bipartite Graphs
por: Zhang, Yalong, et al.
Publicado: (2025)
por: Zhang, Yalong, et al.
Publicado: (2025)
XMiner: Efficient Directed Subgraph Matching with Pattern Reduction
por: Yuan, Pingpeng, et al.
Publicado: (2024)
por: Yuan, Pingpeng, et al.
Publicado: (2024)
A Survey of Densest Subgraph Discovery on Large Graphs
por: Luo, Wensheng, et al.
Publicado: (2023)
por: Luo, Wensheng, et al.
Publicado: (2023)
EvoRAG: Making Knowledge Graph-based RAG Automatically Evolve through Feedback-driven Backpropagation
por: Fu, Zhenbo, et al.
Publicado: (2026)
por: Fu, Zhenbo, et al.
Publicado: (2026)
Diverse Unionable Tuple Search: Novelty-Driven Discovery in Data Lakes [Technical Report]
por: Khatiwada, Aamod, et al.
Publicado: (2025)
por: Khatiwada, Aamod, et al.
Publicado: (2025)
WikiDBGraph: A Data Management Benchmark Suite for Collaborative Learning over Database Silos
por: Wu, Zhaomin, et al.
Publicado: (2025)
por: Wu, Zhaomin, et al.
Publicado: (2025)
GraphMatch: Subgraph Query Processing on FPGAs
por: Dann, Jonas, et al.
Publicado: (2024)
por: Dann, Jonas, et al.
Publicado: (2024)
SAT-BO: Verification Rule Learning and Optimization for FraudTransaction Detection
por: Luo, Mao, et al.
Publicado: (2025)
por: Luo, Mao, et al.
Publicado: (2025)
Chipmink: Efficient Delta Identification for Massive Object Graph
por: Chockchowwat, Supawit, et al.
Publicado: (2025)
por: Chockchowwat, Supawit, et al.
Publicado: (2025)
Efficient Community Detection Over Streaming Bipartite Networks (Technical Report)
por: Zhang, Nan, et al.
Publicado: (2024)
por: Zhang, Nan, et al.
Publicado: (2024)
Novel Table Search [Technical Report]
por: Kassaie, Besat, et al.
Publicado: (2026)
por: Kassaie, Besat, et al.
Publicado: (2026)
New Parallel and Streaming Algorithms for Directed Densest Subgraph
por: Mitrović, Slobodan, et al.
Publicado: (2025)
por: Mitrović, Slobodan, et al.
Publicado: (2025)
gMatch: Fine-Grained and Hardware-Efficient Subgraph Matching on GPUs
por: Chen, Weitian, et al.
Publicado: (2026)
por: Chen, Weitian, et al.
Publicado: (2026)
Hardware-Conscious Stream Processing: A Survey
por: Zhang, Shuhao, et al.
Publicado: (2020)
por: Zhang, Shuhao, et al.
Publicado: (2020)
Differentially Private Densest Subgraph Detection
por: Nguyen, Dung, et al.
Publicado: (2021)
por: Nguyen, Dung, et al.
Publicado: (2021)
Top-L Most Influential Community Detection Over Social Networks (Technical Report)
por: Zhang, Nan, et al.
Publicado: (2023)
por: Zhang, Nan, et al.
Publicado: (2023)
ADS: Approximate Densest Subgraph for Novel Image Discovery
por: Hu, Shanfeng
Publicado: (2024)
por: Hu, Shanfeng
Publicado: (2024)
NeuSO: Neural Optimizer for Subgraph Queries
por: Yang, Linglin, et al.
Publicado: (2025)
por: Yang, Linglin, et al.
Publicado: (2025)
An Efficient and Exact Algorithm for Locally h-Clique Densest Subgraph Discovery
por: Xu, Xiaojia, et al.
Publicado: (2024)
por: Xu, Xiaojia, et al.
Publicado: (2024)
Modeling and Optimization for Massive Data Allocation in Database
por: Niu, Panpan, et al.
Publicado: (2026)
por: Niu, Panpan, et al.
Publicado: (2026)
Approximating Densest Subgraph in Geometric Intersection Graphs
por: Har-Peled, Sariel, et al.
Publicado: (2024)
por: Har-Peled, Sariel, et al.
Publicado: (2024)
RLMiner: Finding the Most Frequent k-sized Subgraph via Reinforcement Learning
por: Huang, Wei, et al.
Publicado: (2026)
por: Huang, Wei, et al.
Publicado: (2026)
DGP: A Dual-Granularity Prompting Framework for Fraud Detection with Graph-Enhanced LLMs
por: Li, Yuan, et al.
Publicado: (2025)
por: Li, Yuan, et al.
Publicado: (2025)
Cardinality Estimation of Subgraph Matching: A Filtering-Sampling Approach
por: Shin, Wonseok, et al.
Publicado: (2023)
por: Shin, Wonseok, et al.
Publicado: (2023)
CEMR: An Effective Subgraph Matching Algorithm with Redundant Extension Elimination
por: Yang, Linglin, et al.
Publicado: (2026)
por: Yang, Linglin, et al.
Publicado: (2026)
TableCopilot: A Table Assistant Empowered by Natural Language Conditional Table Discovery
por: Cui, Lingxi, et al.
Publicado: (2025)
por: Cui, Lingxi, et al.
Publicado: (2025)
PGTuner: An Efficient Framework for Automatic and Transferable Configuration Tuning of Proximity Graphs
por: Duan, Hao, et al.
Publicado: (2025)
por: Duan, Hao, et al.
Publicado: (2025)
Ejemplares similares
-
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework
por: Zhou, Yingli, et al.
Publicado: (2024) -
Efficient Densest Flow Queries in Transaction Flow Networks (Complete Version)
por: Jiang, Jiaxin, et al.
Publicado: (2026) -
Finding Locally Densest Subgraphs: Convex Programming with Edge and Triangle Density
por: Yang, Yi, et al.
Publicado: (2025) -
LIVE: Learnable Monotonic Vertex Embedding for Efficient Exact Subgraph Matching (Technical Report)
por: Ye, Yutong, et al.
Publicado: (2026) -
Revisiting the Design of In-Memory Dynamic Graph Storage
por: Su, Jixian, et al.
Publicado: (2025)