[1]FENG Ji,RAN Ruisheng,WEI Yan.A parameter-free outlier detection algorithm based on natural neighborhood graph[J].CAAI Transactions on Intelligent Systems,2019,14(5):998-1006.[doi:10.11992/tis.201809032]
Copy
CAAI Transactions on Intelligent Systems[ISSN 1673-4785/CN 23-1538/TP] Volume:
14
Number of periods:
2019 5
Page number:
998-1006
Column:
学术论文—机器学习
Public date:
2019-09-05
- Title:
-
A parameter-free outlier detection algorithm based on natural neighborhood graph
- Author(s):
-
FENG Ji; RAN Ruisheng; WEI Yan
-
College of Computer and Information Science, Chongqing Normal University, Chongqing 401331, China
-
- Keywords:
-
parameter-free; adaptive neighbor; nearest neighbor; weighted graph; outlier detection; outlier factor; global outlier; local outlier
- CLC:
-
TP311
- DOI:
-
10.11992/tis.201809032
- Abstract:
-
This study aims to deal with the practical shortages of nearest-neighbor-based data mining techniques, particularly outlier detection. In particular, when data sets have arbitrarily shaped clusters and varying density, determining the appropriate parameters without a priori knowledge becomes difficult. To address this issue, on the basis of the natural neighbor method, which can better reflect the relationship between elements in a data set than the k-nearest neighbor method, we present a graph called the weighted natural neighborhood graph for outlier detection. The weighted natural neighborhood graph does not need to set parameters artificially in the entire process and can identify global and local outliers in the data set with different distribution characteristics. The outlier detection results of artificial dataset and real data prove that the algorithm can obtain an effect similar to that of the optimal parameter in the algorithm with parameters. The algorithm detection result is far better than that of most parameter-sensitive algorithms and is much better than that of the parameter-insensitive algorithm, which has stronger universality and more practicality.