Randomized PCA Forest for Outlier Detection

Muhammad Rajabinasab, Farhad Pakdaman, Moncef Gabbouj, Peter Schneider-Kamp, Arthur Zimek
8/18/2025
cs.LGcs.AIstat.ML

No confident code implementation found for this paper. 4 possible matches can be shown below.

Abstract

We propose a novel unsupervised outlier detection method based on Randomized Principal Component Analysis (PCA). Inspired 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 outlier detection. 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 it high generalization power and its computational efficiency, highlighting it as a good choice for unsupervised outlier detection.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 4 weaker matches are hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{rajabinasab2025randomized,
  title  = {Randomized PCA Forest for Outlier Detection},
  author = {Muhammad Rajabinasab and Farhad Pakdaman and Moncef Gabbouj and Peter Schneider-Kamp and Arthur Zimek},
  year   = {2025},
  eprint = {2508.12776},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2508.12776v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2508.12776.svg)](https://codeofpaper.com/paper/2508.12776)

Discussion