.png){kind=icon}
返回
Graph-Based Semi-Supervised Deep Image Clustering With Adaptive Adjacency Matrix
.png){kind=icon}
PRE
AI
DOI：10.1109/TNNLS.2024.3367322.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Image clustering is a research hotspot in machine learning and computer vision. Existing graph-based semi-supervised deep clustering methods suffer from three problems: 1) because clustering uses only high-level features, the detailed information contained in shallow-level features is ignored; 2) most feature extraction networks employ the step odd convolutional kernel, which results in an uneven distribution of receptive field intensity; and 3) because the adjacency matrix is precomputed and fixed, it cannot adapt to changes in the relationship between samples. To solve the above problems, we propose a novel graph-based semi-supervised deep clustering method for image clustering. First, the parity cross-convolutional feature extraction and fusion module is used to extract high-quality image features. Then, the clustering constraint layer is designed to improve the clustering efficiency. And, the output layer is customized to achieve unsupervised regularization training. Finally, the adjacency matrix is inferred by actual network prediction. A graph-based regularization method is adopted for unsupervised training networks. Experimental results show that our method significantly outperforms state-of-the-art methods on USPS, MNIST, street view house numbers (SVHN), and fashion MNIST (FMNIST) datasets in terms of ACC, normalized mutual information (NMI), and ARI.
Keyword:
Deep clustering
image clustering
representation learning
semi-supervised learning
期刊
IF:
8.9
论文数:
7.6K
被引数:
7.2W
机构
暂无机构信息
引用论文
分享收藏
Unsupervised and semi-supervised learning: the next frontier in machine learning for plant systems biology无监督和半监督学习: 植物系统生物学机器学习的下一个前沿.png)
PLANT JOURNAL
PLANT JOURNALIF5.7
PREAI
分享收藏
查看更多内容