A density-based fuzzy exemplar clustering algorithm

被引:0
|
作者
Zhou J. [1 ,2 ]
Jiang Z.-B. [1 ,2 ]
Zhang Y.-P. [1 ,2 ]
Wang S.-T. [1 ,2 ]
机构
[1] School of Digital Media, Jiangnan University, Wuxi
[2] Jiangsu Key Laboratory of Digital Design and Software Technology, Wuxi
来源
Kongzhi yu Juece/Control and Decision | 2020年 / 35卷 / 05期
关键词
Clustering; Clustering centers; Density clustering; Exemplar clustering; Fuzzy clustering; Robustness;
D O I
10.13195/j.kzyjc.2018.1179
中图分类号
学科分类号
摘要
According to the characteristics of density-based clustering and fuzzy clustering, a density-based fuzzy exemplar clustering algorithm is proposed. Firstly, the possibility of data points becoming candidate clustering centers is processed by the density. The higher the density of the data point is, the greater the likelihood for the data point to become a clustering center is. The clustering centers are then selected using the fuzzy method. The final clustering centers are determined by merging the clustering centers. The proposed algorithm has great adaptability, which can deal with clustering problems of different shapes, it can not only automatically determine cluster centers, but also get better results with higher accuracy. It can automatically determine the real clustering centers with good interpretability and there is no need to preset the number of clusters in advance. By combining the advantages of different clustering methods, the effective division of data can be realized. In addition, it has better robustness to number of clusters and initialization, processing clustering problems of different shapes, and dealing with outliers. Experiments on synthetic datasets and UCI datasets show that the proposed algorithm has better clustering performance and wide applicability. © 2020, Editorial Office of Control and Decision. All right reserved.
引用
收藏
页码:1123 / 1133
页数:10
相关论文
共 30 条
  • [1] Jain A.K., Murty M.N., Flynn P.J., Data clustering: A review, ACM Computing Surveys, 31, 3, pp. 264-323, (1999)
  • [2] Zhang Y., Lv D., Guo R., Data mining: Practical machine learning tools and techniques, Journal of Software Engineering, 11, 1, pp. 97-136, (1997)
  • [3] Xu R., Wunsch D., Survey of clustering algorithms, IEEE Transactions on Neural Networks, 16, 3, pp. 645-678, (2005)
  • [4] Zhang W., Yoshida T., Tang X., Text clustering using frequent itemsets, Knowledge-Based Systems, 23, 5, pp. 379-388, (2010)
  • [5] Cades I., Smyth P., Mannila H., Probabilistic modeling of transactional data with applications to profiling, visualization and prediction, sigmod, Proceedings of the 7th ACM SIGKDD, pp. 37-46, (2001)
  • [6] Wang J., Liang J.Y., Zheng W.P., A graph clustering method for detecting protein complexes, Journal of Computer Research and Development, 52, 8, pp. 1784-1793, (2015)
  • [7] Chuang K.S., Tzeng H.L., Chen S., Fuzzy c-means clustering with spatial information for image segmentation, Computerized Medical Imaging and Graphics, 30, 1, pp. 9-15, (2006)
  • [8] Wang J., Wang S.T., Deng Z.H., Survey on challenges in clustering analysis research, Control and Decision, 27, 3, pp. 321-328, (2012)
  • [9] Qian W.N., Zhou A.Y., Analyzing popular clustering algorithms from different viewpoints, Journal of Software, 13, 8, pp. 1382-1394, (2002)
  • [10] Hong Y., Kwong S., Learning assignment order of instances for the constrained k-means clustering algorithm, IEEE Transactions on Systems, Man, and Cybernetics: Part B, 39, 2, pp. 568-574, (2009)