Self-Supervised Clustering Models Based on BYOL Network Structure
-
Published:2023-11-21
Issue:23
Volume:12
Page:4723
-
ISSN:2079-9292
-
Container-title:Electronics
-
language:en
-
Short-container-title:Electronics
Author:
Chen Xuehao12,
Zhou Jin12,
Chen Yuehui1,
Han Shiyuan1ORCID,
Wang Yingxu12,
Du Tao1,
Yang Cheng12,
Liu Bowen12
Affiliation:
1. Shandong Provincial Key Laboratory of Network-Based Intelligent Computing, University of Jinan, Jinan 250022, China
2. Quancheng Laboratory, Jinan 250103, China
Abstract
Contrastive-based clustering models usually rely on a large number of negative pairs to capture uniform representations, which requires a large batch size and high computational complexity. In contrast, some self-supervised methods perform non-contrastive learning to capture discriminative representations only with positive pairs, but suffer from the collapse of clustering. To solve these issues, a novel end-to-end self-supervised clustering model is proposed in this paper. The basic self-supervised learning network is first modified, followed by the incorporation of a Softmax layer to obtain cluster assignments as data representation. Then, adversarial learning on the cluster assignments is integrated into the methods to further enhance discrimination across different clusters and mitigate the collapse between clusters. To further encourage clustering-oriented guidance, a new cluster-level discrimination is assembled to promote clustering performance by measuring the self-correlation between the learned cluster assignments. Experimental results on real-world datasets exhibit better performance of the proposed model compared with the existing deep clustering methods.
Funder
National Natural Science Foundation of China
Key Research Project of Quancheng Laboratory, China
Research Project of Provincial Laboratory of Shandong, China
Subject
Electrical and Electronic Engineering,Computer Networks and Communications,Hardware and Architecture,Signal Processing,Control and Systems Engineering
Reference55 articles.
1. Low-complexity fuzzy relational clustering algorithms for web mining;Krishnapuram;IEEE Trans. Fuzzy Syst.,2001
2. Berkhin, P. (2006). Grouping Multidimensional Data: Recent Advances in Clustering, Springer.
3. Gulati, H., and Singh, P.K. (2015, January 11–13). Clustering techniques in data mining: A comparison. Proceedings of the 2015 2nd International Conference on Computing for Sustainable Global Development (INDIACom), New Delhi, India.
4. Statistical analysis of galaxy surveys—I. Robust error estimation for two-point clustering statistics;Norberg;Mon. Not. R. Astron. Soc.,2009
5. The application of a text clustering statistical analysis to aid the interpretation of focus group interviews;Dransfield;Food Qual. Prefer.,2004
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献