Unsupervised discriminative feature learning via finding a clustering-friendly embedding space

被引:27
作者
Cao, Wenming [1 ]
Zhang, Zhongfan [2 ]
Liu, Cheng [3 ]
Li, Rui [3 ]
Jiao, Qianfen [4 ]
Yu, Zhiwen [2 ]
Wong, Hau-San [4 ]
机构
[1] Chongqing Jiaotong Univ, Coll Math & Stat, Chongqing, Peoples R China
[2] South China Univ Technol, Sch Comp Sci & Engn, Guangzhou, Peoples R China
[3] Shantou Univ, Dept Comp Sci, Shantou, Peoples R China
[4] City Univ Hong Kong, Dept Comp Sci, Hong Kong, Peoples R China
基金
中国国家自然科学基金;
关键词
Deep clustering; Unsupervised learning; Generative adversarial networks; Siamese network;
D O I
10.1016/j.patcog.2022.108768
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, we propose an enhanced deep clustering network (EDCN), which is composed of a Feature Extractor, a Conditional Generator, a Discriminator and a Siamese Network. Specifically, we will utilize two kinds of generated data based on adversarial training, as well as the original data, to train the Fea-ture Extractor for learning effective latent representations. In addition, we adopt the Siamese network to find an embedding space, where a better affinity similarity matrix is obtained as the key to success of spectral clustering in providing reliable pseudo-labels. Particularly, the obtained pseudo-labels will be used to generate realistic data by the Generator. Finally, the discriminator is used to model the real joint distribution of data and corresponding latent representations for Feature Extractor enhancement. To eval-uate our proposed EDCN, we conduct extensive experiments on multiple data sets including MNIST, USPS, FRGC, CIFAR-10, STL-10, and Fashion-MNIST by comparing our method with a number of state-of-the-art deep clustering methods, and experimental results demonstrate its effectiveness and superiority. (c) 2022 Elsevier Ltd. All rights reserved.
引用
收藏
页数:15
相关论文
共 56 条
[1]  
[Anonymous], 2009, Rep. TR-2009
[2]  
[Anonymous], 2020, INT C LEARN REPR
[3]   Deep self-representative subspace clustering network [J].
Baek, Sangwon ;
Yoon, Gangjoon ;
Song, Jinjoo ;
Yoon, Sang Min .
PATTERN RECOGNITION, 2021, 118
[4]  
Bromley J., 1993, International Journal of Pattern Recognition and Artificial Intelligence, V7, P669, DOI 10.1142/S0218001493000339
[5]   Document clustering using locality preserving indexing [J].
Cai, D ;
He, XF ;
Han, JW .
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (12) :1624-1637
[6]   Non-negative Matrix Factorization on Manifold [J].
Cai, Deng ;
He, Xiaofei ;
Wu, Xiaoyun ;
Han, Jiawei .
ICDM 2008: EIGHTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2008, :63-+
[7]   Unsupervised deep clustering via contractive feature representation and focal loss [J].
Cai, Jinyu ;
Wang, Shiping ;
Xu, Chaoyang ;
Guo, Wenzhong .
PATTERN RECOGNITION, 2022, 123
[8]   Deep Clustering for Unsupervised Learning of Visual Features [J].
Caron, Mathilde ;
Bojanowski, Piotr ;
Joulin, Armand ;
Douze, Matthijs .
COMPUTER VISION - ECCV 2018, PT XIV, 2018, 11218 :139-156
[9]  
Chang JL, 2017, IEEE I CONF COMP VIS, P5880, DOI [10.1109/ICCV.2017.626, 10.1109/ICCV.2017.627]
[10]  
Chen X, 2016, ADV NEUR IN, V29