EDMC: Efficient Multi-View Clustering via Cluster and Instance Space Learning

doi:10.1109/TMM.2023.3331197

Return

EDMC: Efficient Multi-View Clustering via Cluster and Instance Space Learning

2024-01-01

PRE

Yalan Qin

Nan Pu *

Hanzhou Wu *

DOI：10.1109/TMM.2023.3331197

Original

Original request for help

Save

Abstract

En 中文

Multi-view subspace clustering aims to cluster the data lying in a union of subspaces with low dimensions. The commonly used spectral clustering performs the final clustering based on an n x n affinity graph, which suffers from relative high time and space complexity. Some existing works have chosen key anchors with uniform sampling strategy or K-means for dealing with large-scale datasets. However, few of them pay attention to the physical meaning of cluster representation in the column of the dataset for learning informative anchors, which is independent from the instance representation. In this paper, we propose efficient dual multi-view clustering (EDMC) with relative low complexity. To be specific, EDMC makes full use of cluster representation space in the column of the dataset to help produce informative anchors, which has a clear physical meaning and is independent of instance representation in the row. It simultaneously explores the cluster and instance subspace representations to learn anchors for large-scale datasets. We perform anchor learning and efficient multi-view clustering in a unified framework and then adopt an alternative optimization strategy for solving the formulated problem. Extensive experiments performed on different datasets in terms of several metrics validate the superiority of the proposed method.

Keywords:

Clustering algorithms

Tensors

Scalability

Representation learning

Optimization

Dimensionality reduction

Complexity theory

Multi-view subspace clustering

cluster representation

instance representation

anchor learning