Unsupervised Distance-Based Anomaly disclosure in RNN

Authors

  • M Tejasri Dept. of CSE, VVIT, Guntur, India
  • K Sri Lakshmi Dept. of CSE, VVIT, Guntur, India
  • K Gowri Raghavendra Narayan Dept. of CSE, VVIT, Guntur, India

DOI:

https://doi.org/10.26438/ijcse/v6i3.439441

Keywords:

High-Dimensional Data, Anomaly Detection, Reverse Nearest Neighbors (RNN), Distance Concentration

Abstract

Anomaly discovery in high-dimensional information presents different difficulties coming about because of the "scourge of dimensionality." A common view is that separation fixation, i.e., the propensity of separations in high-dimensional information to wind up garbled, blocks the location of anomalies by making separation based strategies name all focuses as similarly great exceptions. In this paper, we give confirm supporting the conclusion that such a view is excessively straightforward, by exhibiting that separation based strategies can deliver all the more differentiating exception scores in high-dimensional settings. By assessing the great k-NN technique, the density-based local anomaly factor and impacted frameworks strategies, and anti-hub strategies with respect to different manufactured and genuine informational collections, we offer novel knowledge into the value of turn around neighbor checks in unsupervised exception recognition.

References

V.Chandola, et al, “Anomaly detection: A survey”, ACM /computSuro, vol 41,no. 3,p. 15,20090

A. Zimek, et al, “A survey on unsupervised outlier detection in high-dimensional numerical data,” Statist. Anal. Data Mining, vol. 5, no. 5, 2012

C. C. Aggarwal et al, “Outlier detection for high dimensional data,” in Proc. 27th ACM SIGMOD Int. Conf. Manage. Data, 2001,

Srinivasa Rao, “A Review on Multivariate Mutual Information”, University of Notre Dame, vol. 2, 2005

Shu Wu, et al, “Information-Theoretic Outlier Detection for Large-Scale Categorical Data”, IEEE Explorer vol. 25, No. 3.

Markus M. et al, “Institute for computer science. Department of Computer Science” University of British Columbia.

A. Hinneburg, et al, “On the surprising behavior of distance metrics in high dimensional spaces,” in Proc 8thIntConf on Database Theory (ICDT), 2001.

Jayshree S.Gosavi, http://www.rroij.com

Random key algorithm https://dzone.com/articles/random-number-generation-in-java

KNN-Algorithm http://www.saedsayad.com/k_nearest_neighbors.htm

Downloads

Published

2025-11-12
CITATION
DOI: 10.26438/ijcse/v6i3.439441
Published: 2025-11-12

How to Cite

[1]
M. Tejasri, K. Sri Lakshmi, and K. Gowri Raghavendra Narayan, “Unsupervised Distance-Based Anomaly disclosure in RNN”, Int. J. Comp. Sci. Eng., vol. 6, no. 3, pp. 439–441, Nov. 2025.

Issue

Section

Research Article