Journal
EXPERT SYSTEMS
Volume 39, Issue 2, Pages -Publisher
WILEY
DOI: 10.1111/exsy.12859
Keywords
density-based approach; K-nearest neighbour; local outlier detection; outlier-ness score; reverse nearest neighbour
Ask authors/readers for more resources
This paper proposes a Relative Density-based Outlier Factor algorithm for identifying outliers, which analyzes test points through two stages. Experimental results show that the algorithm has higher rank power than baseline methods on real-world datasets.
An outlier has a significant impact on data quality and the efficiency of data mining. The outlier identification algorithm observes only data points that do not follow clearly defined meanings of projected behaviour in a data set. Several techniques for identifying outliers have been presented in recent years, but if outliers are located in areas where neighbourhood density varies substantially, it can result in an imprecise estimate. To address this problem, we provide a 'Relative Density-based Outlier Factor (RDOF)' algorithm based on the concept of mutual proximity between a data point and its neighbours. The proposed approach is divided into two stages: an influential space is created at a test point in the first stage. In the later stage, a test point is assigned an outlier-ness score. We have conducted experiments on three real-world data sets, namely the Johns Hopkins University Ionosphere, the Iris Plant, and Wisconsin Breast Cancer data sets. We have investigated three performance metrics for comparison: precision, recall, and rank power. In addition, we have compared our proposed method against a set of relevant baseline methods. The experimental results reveal that our proposed method detected all (i.e., 100%) outlier class objects with higher rank power than baseline approaches over these experimental data sets.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available