Local outlier factor in rough K-means clustering

K-means is an unsupervised method partitions the input space into clusters. k-means algorithm has a weakness of detecting outliers,which have it available in many variations research fields. a decade ago,rough sets theory (rst) has been used to solve the problem of clustering partition. specifically,rough k-means (rkm) is a one of the powerful hybrid algorithm,which has it,has various extension versions. however,with respect of the ideas of existing rough clustering algorithms,a suitable method to detect outliers is much needed now. in this paper,we propose an effective method to detect local outliers in rough clustering. the local outlier factor (lof) method in rough clustering improves the quality of the cluster partition. the improved algorithm increased the level of clusters quality. an existing algorithm version,the π rough k-means (π rkm) tested in the study. finally,the effectiveness of the algorithm performance is demonstrated based on synthetic and real datasets. © 2017 universiti putra malaysia press.