Outlier detection based on cluster outlier factor and mutual density

3Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Outlier detection is an important task in data mining with numerous applications. Recent years, the study on outlier detection is very active, many algorithms were proposed including that based on clustering. However, most outlier detection algorithms based on clustering often need parameters, and it is very difficult to select a suitable parameter for different data set. In order to solve this problem, an outlier detection algorithm called outlier detection based on cluster outlier factor and mutual density is proposed in this paper which combining the natural neighbor search algorithm of the Natural Outlier Factor (NOF) algorithm and based on the Density and Distance Cluster (DDC) algorithm. The mutual density and γ density is used to construct decision graph. The data points with γ density anomalously large in decision graph are treated as cluster centers. This algorithm detect the boundary of outlier cluster using cluster outlier factor called Cluster Outlier Factor (COF), it can automatic find the parameter. This method can achieve good performance in clustering and outlier detection which be shown in the experiments.

Cite

CITATION STYLE

APA

Zhang, Z., Zhu, M., Qiu, J., Liu, C., Zhang, D., & Qi, J. (2019). Outlier detection based on cluster outlier factor and mutual density. In Communications in Computer and Information Science (Vol. 986, pp. 319–329). Springer Verlag. https://doi.org/10.1007/978-981-13-6473-0_28

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free