关键词: 协同训练, 谱聚类, 子空间聚类, 关联矩阵

Abstract:

Subspace clustering is a hot research topic in machine learning. It aims at clustering data according to its potential subspace. Inspired by the collaborative training algorithm in multi-view learning, a subspace clustering algorithm induced by adaptive graph learning is proposed. The single-view data is multi-viewed by two different ways. Regularization term of the graph is iteratively updated according to the information of different views. Block diagonal affinity matrix is obtained which better reflect the clustering performance, so as to describe the data clustering results more accurately. Compared with other clustering algorithms on four standard datasets, the experimental results show the better clustering performance of the proposed method.

Key words: collaborative training, spectral clustering, subspace clustering, affinity matrix