Multi-View Learning a Decomposable Affinity Matrix via Tensor Self-Representation on Grassmann Manifold
Lists
Only you see this
Abstract
Multi-view clustering aims to partition objects into potential categories by utilizing cross-view information. One of the core issues is to sufficiently leverage different views to learn a latent subspace, within which the clustering task is performed. Recently, it has been shown that representing the multi-view data by a tensor and then learning a latent self-expressive tensor is effective. However, early works mainly focus on learning essential tensor representation from multi-view data and the resulted affinity matrix is considered as a byproduct or is computed by a simple average in Euclidean space, thereby destroying the intrinsic clustering structure. To that end, here we proposed a novel multi-view clustering method to directly learn a well-structured affinity matrix driven by the clustering task on Grassmann manifold. Specifically, we firstly employed a tensor learning model to unify multiple feature spaces into a latent low-rank tensor space. Then each individual view was merged on Grassmann manifold to obtain both an integrative subspace and a consensus affinity matrix, driven by clustering task. The two parts are modeled by a unified objective function and optimized jointly to mine a decomposable affinity matrix. Extensive experiments on eight real-world datasets show that our method achieves superior performances over other popular methods.
BibTeX
@article{wang2021multi,
author = {Haiyan Wang and Guoqiang Han and Bin Zhang and Guihua Tao and Hongmin Cai},
title = {{Multi-View Learning a Decomposable Affinity Matrix via Tensor Self-Representation on Grassmann Manifold}},
journal = {IEEE Trans. Image Process.},
year = {2021},
url = {https://openreview.net/forum?id=9B3nllnq2R},
}Loading related content...