Kernel Random Projection Depth for Outlier Detection
Not on the map. Why?
Abstract (arXiv)
This paper proposes an extension of Random Projection Depth (RPD) to cope with multiple modalities and non-convexity on data clouds. In the framework of the proposed method, the RPD is computed in a reproducing kernel Hilbert space. With the help of kernel principal component analysis, we expect that the proposed method can cope with the above multiple modalities and non-convexity. The experimental results demonstrate that the proposed method outperforms RPD and is comparable to other existing detection models on benchmark datasets regarding Area Under the Curves (AUCs) of Receiver Operating Characteristic (ROC).
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 3 of its 56 references that are in the map. First posted on arXiv 12 Jun 2023.
Builds on
3 of 56 references.
References · 3
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025Kernel Outlier Detectioncited by 1
- 2025Kernel Outlier Detection28 Jun 2025