A new (k,δ)-dense subhypergraph model with fair-stable algorithms reduces decomposition complexity and yields smoother, less redundant layers than k-core baselines on real hypergraphs.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
TransXion supplies a 3-million-transaction graph benchmark with profile-aware normal activity and stochastic illicit subgraphs that produces lower detection scores than prior AML datasets.
citing papers explorer
-
Density Decomposition on Hypergraphs
A new (k,δ)-dense subhypergraph model with fair-stable algorithms reduces decomposition complexity and yields smoother, less redundant layers than k-core baselines on real hypergraphs.
-
TransXion: A High-Fidelity Graph Benchmark for Realistic Anti-Money Laundering
TransXion supplies a 3-million-transaction graph benchmark with profile-aware normal activity and stochastic illicit subgraphs that produces lower detection scores than prior AML datasets.