Deep Fuzzy Variable C-Means Clustering Incorporated With Curriculum Learning

被引:14
作者
Gong, Maoguo [1 ]
Zhao, Yue [1 ]
Li, Hao [1 ]
Qin, A. K. [2 ]
Xing, Lining [1 ]
Li, Jianzhao [1 ]
Liu, Yiting [1 ]
Liu, Yuhao [1 ]
机构
[1] Xidian Univ, Sch Elect Engn, Key Lab Collaborat Intelligence Syst, Minist Educ, Xian 710071, Peoples R China
[2] Swinburne Univ Technol, Dept Comp Technol, Hawthorn, Vic 3122, Australia
基金
中国国家自然科学基金;
关键词
Curriculum learning; deep clustering; fuzzy clustering; unsupervised learning; K-MEANS; ALGORITHMS;
D O I
10.1109/TFUZZ.2023.3283046
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
End-to-end deep clustering method utilizes deep neural networks to jointly learn representation features and clustering assignments. Although many k-means-friendly deep clustering models have been explored, the existing division-based methods tend to directly implement clustering with a specific number of clusters, which suffers from poor performance resulted from indistinguishable clusters, and contributes to bad local optimum. At the same time, the representation learning of fuzzy $c$-means clustering in the feature space still needs more research. In this article, a deep fuzzy curriculum clustering method with the learning strategy of clustering from easy to complex automatically is proposed to tackle the above issues. First, considering the soft flexible allocation of fuzzy $c$-means and the preservation of local structure of original data, the fuzzy clustering loss and the autoencoder's reconstruction loss are constructed to learn the embedded features and clustering centers simultaneously. Second, curriculum loss is introduced into the constraint to make clusters successively merge in line with implementing clustering from easy to complex, and realize the bottom-up deep aggregative clustering automatically. In addition, novel curriculum information is proposed as constraint to guide the merging of clusters belonging to the same class. Experimental results on four real-world datasets show the superiority of the proposal.
引用
收藏
页码:4321 / 4335
页数:15
相关论文
共 52 条
[41]  
Tian F, 2014, AAAI CONF ARTIF INTE, P1293
[42]  
Van Der Maaten L, 2009, Artificial intelligence and statistics, P384
[43]  
van der Maaten L, 2008, J MACH LEARN RES, V9, P2579
[44]   A novel fuzzy clustering algorithm based on a fuzzy scatter matrix with optimality tests [J].
Wu, KL ;
Yu, J ;
Yang, MS .
PATTERN RECOGNITION LETTERS, 2005, 26 (05) :639-652
[45]  
Xiao H, 2017, Arxiv, DOI [arXiv:1708.07747, DOI 10.48550/ARXIV.1708.07747]
[46]  
Xie JY, 2016, PR MACH LEARN RES, V48
[47]  
Yang Xu, 2020, Advances in Neural Information Processing Systems, V33
[48]   Multiple Kernel k-Means Clustering by Selecting Representative Kernels [J].
Yao, Yaqiang ;
Li, Yang ;
Jiang, Bingbing ;
Chen, Huanhuan .
IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2021, 32 (11) :4983-4996
[49]  
Zhang Bowen, 2021, Advances in Neural Information Processing Systems, V34
[50]   Deep Fuzzy K-Means With Adaptive Loss and Entropy Regularization [J].
Zhang, Rui ;
Li, Xuelong ;
Zhang, Hongyuan ;
Nie, Feiping .
IEEE TRANSACTIONS ON FUZZY SYSTEMS, 2020, 28 (11) :2814-2824