Multi-view spectral clustering via common structure maximization of local and global representations

Neural Netw. 2021 Nov:143:595-606. doi: 10.1016/j.neunet.2021.07.020. Epub 2021 Jul 21.

Abstract

The essential problem of multi-view spectral clustering is to learn a good common representation by effectively utilizing multi-view information. A popular strategy for improving the quality of the common representation is utilizing global and local information jointly. Most existing methods capture local manifold information by graph regularization. However, once local graphs are constructed, they do not change during the whole optimization process. This may lead to a degenerated common representation in the case of existing unreliable graphs. To address this problem, rather than directly using fixed local representations, we propose a dynamic strategy to construct a common local representation. Then, we impose a fusion term to maximize the common structure of the local and global representations so that they can boost each other in a mutually reinforcing manner. With this fusion term, we integrate local and global representation learning in a unified framework and design an alternative iteration based optimization procedure to solve it. Extensive experiments conducted on a number of benchmark datasets support the superiority of our algorithm over several state-of-the-art methods.

Keywords: Affinity matrix; Multi-view; Spectral clustering.

MeSH terms

  • Algorithms*
  • Benchmarking*
  • Cluster Analysis
  • Learning