Outlier detection based on cluster outlier factor and mutual density Online publication date: Wed, 18-Sep-2019
by Zhongping Zhang; Mengfan Zhu; Jingyang Qiu; Cong Liu; Debin Zhang; Jie Qi
International Journal of Intelligent Information and Database Systems (IJIIDS), Vol. 12, No. 1/2, 2019
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 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. 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 centres. 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.
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Intelligent Information and Database Systems (IJIIDS):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email subs@inderscience.com
Our Blog 
Follow us on Twitter 
Visit us on Facebook