Clustering algorithm based on filter model

被引:0
|
作者
Qiu B.-Z. [1 ]
Zhang R.-L. [1 ]
Li X.-L. [1 ]
机构
[1] School of Information Engineering, Zhengzhou University, Zhengzhou
来源
Kongzhi yu Juece/Control and Decision | 2020年 / 35卷 / 05期
关键词
Clustering algorithm; Clustering prototype; Density factor; Deviation factor; Filter model; Local density;
D O I
10.13195/j.kzyjc.2018.1089
中图分类号
学科分类号
摘要
Reasonable clustering prototype is the premise of correct clustering. Most of the existing clustering algorithms have some shortcomings such as the unreasonable selection of clustering prototypes and calculation deviation of cluster numbers. A clustering algorithm based on filter model (CA-FM) is proposed. The algorithm uses the proposed filtering model to remove the boundary and noise objects which interfere with the clustering process. The adjacency matrix is generated according to the neighbor relationships among the core objects, and the number of clusters is calculated by traversing the matrix. Then, the objects are sorted according to the density factor, and clustering prototypes are selected from them. Finally, the remaining objects are assigned into corresponding clusters according to the minimum distance from the high density objects. The effectiveness of the proposed algorithm is demonstrated by experiments on synthetic datasets, UCI datasets and Olivetti face dataset. Compared with similar algorithms, the CA-FM has a higher clustering accuracy. © 2020, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码:1091 / 1101
页数:10
相关论文
共 27 条
  • [1] Kacprzyk J., Pedrycz W., Springer Handbook of Computational Intelligence, pp. 578-600, (2015)
  • [2] Li X.L., Han Q., Qiu B.Z., A clustering algorithm using skewness-based boundary detection, Neurocomputing, 275, pp. 618-626, (2018)
  • [3] Mondal S.A., An improved approximation algorithm for hierarchical clustering, Pattern Recognition Letters, 104, pp. 23-28, (2018)
  • [4] Chen H.Z., Wang W.W., Feng X.C., Discriminative and coherent subspace clustering, Neurocomputing, 284, pp. 177-186, (2018)
  • [5] Li H.L., Wang C., Deng X.Y., Multivariate time series clustering based on affinity propagation of component attributes, Control and Decision, 33, 4, pp. 649-656, (2018)
  • [6] Li X.L., Cao X.F., Qiu B.Z., Clustering boundary pattern discovery for high dimensional space base on matrix model, Acta Automatica Sinica, 43, 11, pp. 1962-1972, (2017)
  • [7] Zhang Q., Fang Z.G., Cai J.J., Generalized interval grey entropy-weight clustering model based on multiple heterogeneous uncertainty cases study, Control and Decision, 33, 8, pp. 1481-1488, (2018)
  • [8] Macqueen J., Some methods for classification and analysis of multivariate observations, Proc of 5th Berkeley Symposium on Mathematical Statistics and Probability, pp. 281-297, (1967)
  • [9] Bezdek J.C., Robert E., Full W., FCM: The fuzzy c-means clustering algorithm, Computers & Geosciences, 10, 2-3, pp. 191-203, (1984)
  • [10] Ester M., Kriegel H.P., Xu X.W., Et al., A density-based algorithm for discovering clusters in large spatial databases with noise, Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pp. 226-231, (1996)