Contrastive self-representation learning for data clustering

Wenhui Zhao

doi:10.1016/j.neunet.2023.08.050

Contrastive self-representation learning for data clustering

2023-10-01

9

PRE

AI

DOI：10.1016/j.neunet.2023.08.050

Original

Original request for help

Save

Abstract

En 中文

This paper is concerned with self-representation subspace learning. It is one of the most representative subspace techniques, which has attracted considerable attention for clustering due to its good performance. Among these methods, low-rank representation (LRR) has achieved impressive results for subspace clustering. However, it only considers the similarity between the data itself, while neglecting the differences with other samples. Besides, it cannot well deal with noise and portray cluster-to -cluster relationships well. To solve these problems, we propose a Contrastive Self-representation model for Clustering (CSC). CSC simultaneously takes into account the similarity/dissimilarity between positive/negative pairs when learning the self-representation coefficient matrix of data while the form of the loss function can reduce the effect of noise on the results. Moreover, We use the l1,2- norm regularizer on the coefficient matrix to achieve its sparsity to better characterize the cluster structure. Thus, the learned self-representation coefficient matrix well encodes both the discriminative information and cluster structure. Extensive experiments on seven benchmark databases indicate the superiority of our proposed method.(c) 2023 Elsevier Ltd. All rights reserved.

Keywords:

Self-representation

Contrastive learning

Subspace clustering

Contrastive self-representation learning for data clustering

Abstract

Journal

Organization