Randomized PCA Forest for Unsupervised Outlier Detection
Not on the map. Why?
Abstract (arXiv)
We propose a novel unsupervised outlier detection method based on Randomized Principal Component Analysis (PCA). Motivated by the performance of Randomized PCA (RPCA) Forest in approximate K-Nearest Neighbor (KNN) search, we develop a novel unsupervised outlier detection method that utilizes RPCA Forest for unsupervised outlier detection by deriving an outlier score from its intrinsic properties. Experimental results showcase the superiority of the proposed approach compared to the classical and state-of-the-art methods in performing the outlier detection task on several datasets while performing competitively on the rest. The extensive analysis of the proposed method reflects its robustness and its computational efficiency, highlighting it as a good choice for unsupervised outlier detection.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 8 of its 50 references that are in the map. First posted on arXiv 18 Aug 2025.
Builds on
8 of 50 references.
References · 8
- 2016Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphscited by 861
- 2022ADBench: Anomaly Detection Benchmarkcited by 232
- 2022Deep Isolation Forest for Anomaly Detectioncited by 92
- 2018Extended Isolation Forestcited by 81
- 2024Outlier detection by ensembling uncertainty with negative objectnesscited by 34
- 2022D.MCA: Outlier Detection with Explicit Micro-Cluster Assignmentscited by 5
- 2025Metrics for Inter-Dataset Similarity with Example Applications in Synthetic Data and Feature Selection Evaluation -- Extended Versioncited by 5
- 2020Explainable outlier detection through decision tree conditioningcited by 3
Built on by
Citing papers per year: 2026: 2.
2 papers.