Density Viewpoint Clustering Outlier Detection Algorithm With Feature Weight and Entropy

ABSTRACT The k‐means outlier removal (KMOR) algorithm uses the distance criterion to measure similarity in cluster analysis for outlier detection and places outliers in a separate cluster to achieve outlier detection with clustering. However, the distance‐based clustering outlier detection algorithm has poor effect and is sensitive to parameters and clustering center for the datasets with a special distribution and large number of outliers. Therefore, this article proposes a density viewpoint clustering outlier detection algorithm with feature weighting and entropy by introducing feature and entropy information. First, the algorithm introduces the entropy regularization into the objective function to control the clustering process by minimizing the clustering dispersion and maximizing the negative entropy. Second, feature weight and regularization strategies are introduced in the objective function and outlier detection criteria to improve the detection accuracy of the algorithm for feature‐imbalanced datasets while controlling the weight of features. In addition, the weighted distance function of data dimension normalization is used to calculate the viewpoint, and the correct clustering center is formed by density viewpoint guidance to improve the overall performance. Finally, five experiments by synthetic datasets show that the algorithm has an average classification accuracy of 98.22, which is higher than other algorithms. Further demonstrated by ten UCI datasets show that the algorithm can balance data classification and outlier detection well.