mlsanityData to 7 Oct 2026

BikNN: Anomaly Estimation in Bilateral Domains with k-Nearest Neighbors

arXiv 2105.05037 ↗First posted 11 May 2021cs.LG cs.CV cs.IRcited by 0

Not on the map. Why?

Abstract (arXiv)

In this paper, a novel framework for anomaly estimation is proposed. The basic idea behind our method is to reduce the data into a two-dimensional space and then rank each data point in the reduced space. We attempt to estimate the degree of anomaly in both spatial and density domains. Specifically, we transform the data points into a density space and measure the distances in density domain between each point and its k-Nearest Neighbors in spatial domain. Then, an anomaly coordinate system is built by collecting two unilateral anomalies from k-nearest neighbors of each point. Further more, we introduce two schemes to model their correlation and combine them to get the final anomaly score. Experiments performed on the synthetic and real world datasets demonstrate that the proposed method performs well and achieve highest average performance. We also show that the proposed method can provide visualization and classification of the anomalies in a simple manner. Due to the complexity of the anomaly, none of the existing methods can perform best on all benchmark datasets. Our method takes into account both the spatial domain and the density domain and can be adapted to different datasets by adjusting a few parameters manually.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 4 of its 14 references that are in the map. First posted on arXiv 11 May 2021.

Builds on

4 of 14 references.

References · 4

  1. 2019PyOD: A Python Toolbox for Scalable Outlier Detectioncited by 221
  2. 2020COPOD: Copula-Based Outlier Detectioncited by 143
  3. 2018Generative Adversarial Active Learning for Unsupervised Outlier Detectioncited by 65
  4. 2018LSCP: Locally Selective Combination in Parallel Outlier Ensemblescited by 31

Built on by

Not cited yet.