Affiliations: [a] School of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei, China | [b] The Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province, Qinhuangdao, Hebei, China | [c] The First Middle School of Qian’an Country, Jilin, China
Correspondence:
[*]
Corresponding author: Ming-Yue Shi, School of Information Science and Engineering, Yanshan University, Qinhuangdao, Hebei 066004, China. Tel.: +86 156 0336 9159; E-mail: 1412930010@qq.com.
Abstract: Outlier detection can detect a small amount of data which containing valuable information from a large number of data, and it has become a hot topic in data mining. In this article, a new algorithm is proposed, which is fast local outlier detection algorithm using K kernel space. It is proposed to solve problem of the detection efficiency is not high because of the unevenness of density distribution in the outlier detection algorithm based on density, and the running time of the algorithm is obviously increased after introducing the reverse K nearest neighbors algorithm. By introducing K kernel space this algorithm divides the objects in data set into near K neighborhood points and far K neighborhood points, and reduces the number of data points which computation of the reverse K neighborhood, so as to reduce the running time of the algorithm. The accuracy of outlier detection is improved by introducing reachable distance and reachable density to reduce the statistical fluctuation of distance. Finally, the effectiveness of the proposed algorithm is shown by simulation data set and real data set.
Keywords: Data mining, outlier detection, K kernel space, reachable density
