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
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
nearest neighbors algorithm. By introducing
kernel space this algorithm divides the objects in data set into near
neighborhood points and far
neighborhood points, and reduces the number of data points which computation of the reverse
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.