A novel outlier detecting algorithm based on the outlier turning points
Jinlong Huang, Dongdong Cheng, Sulan Zhang
Abstract
Outlier detection is one of the hot research in data mining , and has been applied to various fields such as network anomaly detection , image abnormal analysis, etc. In recent years, many outlier detecting algorithms have been proposed. However, these outlier detecting algorithms are hard to effectively detect global outliers, local outliers and outlier clusters at the same time. In this paper, we propose a novel outlier detecting algorithm based on the following ideas: (1) the density distribution should not be changed dramatically on local area; (2) the ratio of the number of k nearest neighbors and the number of reverse k nearest neighbors should not be very big. Based on above ideas, the proposed algorithm aims to find outlier turning points, then regards all outlier turning points and its sparse neighbors as outliers. Furthermore, the proposed algorithm use natural neighbors to obtain the neighborhood parameter k adaptively. The formal analysis and extensive experiments demonstrate that this technique can detect global outliers, local outliers and outlier clusters without neighborhood parameter k .