Paper: arXiv 2403.00777
Authors: Ahmed N. Bakry, Almohammady S. Alsharkawy, Mohamed S. Farag, Kamal R. Raslan
Abstract
Anti-Money Laundering (AML) is a crucial task in ensuring the integrity of financial systems. One keychallenge in AML is identifying high-risk groups based on their behavior. Unsupervised learning, particularly clustering, is a promising solution for this task. However, the use of hundreds of features todescribe behavior results in a highdimensional dataset that negatively impacts clustering performance.In this paper, we investigate the effectiveness of combining clustering method agglomerative hierarchicalclustering with four dimensionality reduction techniques -Independent Component Analysis (ICA), andKernel Principal Component Analysis (KPCA), Singular Value Decomposition (SVD), Locality Preserving Projections (LPP)- to overcome the issue of high-dimensionality in AML data and improve clusteringresults. This study aims to provide insights into the most effective way of reducing the dimensionality ofAML data and enhance the accuracy of clustering-based AML systems. The experimental results demonstrate that KPCA outperforms other dimension reduction techniques when combined with agglomerativehierarchical clustering. This superiority is observed in the majority of situations, as confirmed by threedistinct validation indices.
Complexity vs Empirical Score
- Math Complexity: 6.0/10
- Empirical Rigor: 4.0/10
- Quadrant: Lab Rats — high math complexity, limited empirical testing
Why this score: The paper employs advanced mathematical techniques like KPCA and ICA but lacks implementation details, code, or specific backtesting results, relying instead on general validation indices.
Research Flowchart
flowchart TD
subgraph Research Goal
A["Goal: Improve Clustering for AML<br>(High-Dimensional Challenge)"]
end
subgraph Data Input
B["AML Dataset<br>(Hundreds of Features)"]
end
subgraph Methodology
C["Apply Dimensionality Reduction Techniques"]
D["Perform Agglomerative Hierarchical Clustering"]
end
subgraph Key Findings
E["Kernel PCA (KPCA)<br>Outperforms ICA, SVD, LPP<br>Validated by 3 Indices"]
end
A --> B
B --> C
C --> D
D --> E
Evidence Card
What the authors claim, on what data, and who has checked it. Read from the paper's own text by a language model: every quote is verbatim, nothing was re-run. How to read this card
Proposes
The paper proposes combining agglomerative hierarchical clustering with dimensionality reduction techniques, especially Kernel PCA, to improve AML clustering performance.
Source sentence
In this paper, we investigate the effectiveness of combining clustering method agglomerative hierarchical clustering with four dimensionality reduction techniques -Independent Component Analysis (ICA), and Kernel Principal Component Analysis (KPCA), Singular Value Decomposition (SVD), Locality Preserving Projections (L
Assumes 2
- High-dimensional feature sets negatively impact clustering performance. model
Source sentence
However, the use of hundreds of features to describe behavior results in a high-dimensional dataset that negatively impacts clustering performance.
- Dimensionality reduction can capture the underlying structure of customer transaction data while minimizing information loss. data
Source sentence
The objective is to identify the best DRTs that can accurately capture the underlying structure of the customer transaction data, while minimizing the loss of information.
Data
- Banking industry transaction dataset other proprietary
Source sentence
Transaction data from various customers were collected. The data was organized into yearly profiles for each customer, with a total of 4099 companies included in the dataset. Each company profile was characterized by 80 features, resulting in a dataset with 4099 rows and 80 columns.
Costs
Not applicable
Finds 3
- Kernel PCA combined with agglomerative hierarchical clustering outperforms other dimensionality reduction techniques across most validation indices. performance
Source sentence
The experimental results demonstrate that KPCA outperforms other dimension reduction techniques when combined with agglomerative hierarchical clustering. This superiority is observed in the majority of situations, as confirmed by three distinct validation indices.
- KPCA yields near‑perfect scores on Silhouette, Calinski‑Harabasz, and Davies‑Bouldin metrics, especially with a low number of features. performance
Source sentence
KPCA, especially with a low number of features, consistently yields nearly perfect scores across all evaluation indices when combined with AHC.
- Original high‑dimensional data without reduction performs relatively poorly compared to most dimensionality reduction techniques. performance
Source sentence
When the original data, without any dimensionality reduction, is utilized, it exhibits relatively poor performance compared to most Dimensionality Reduction Techniques.
Checked by others
Supported by
- Credit Risk Assessment Model for UAE Commercial Banks: A Machine Learning Approach
Compare the findings
This paper: Original high‑dimensional data without reduction performs relatively poorly compared to most dimensionality reduction techniques.
That paper: Applying LDA increased the accuracy of all models, indicating that dimensionality reduction improves performance.
Code
No repository by the authors found in the paper.
Extracted 2026-11-14 · same card as JSON · A language model chose these items: check the source sentence before relying on one.