English

Robust Localized Multi-view Subspace Clustering

Computer Vision and Pattern Recognition 2017-05-23 v1

Abstract

In multi-view clustering, different views may have different confidence levels when learning a consensus representation. Existing methods usually address this by assigning distinctive weights to different views. However, due to noisy nature of real-world applications, the confidence levels of samples in the same view may also vary. Thus considering a unified weight for a view may lead to suboptimal solutions. In this paper, we propose a novel localized multi-view subspace clustering model that considers the confidence levels of both views and samples. By assigning weight to each sample under each view properly, we can obtain a robust consensus representation via fusing the noiseless structures among views and samples. We further develop a regularizer on weight parameters based on the convex conjugacy theory, and samples weights are determined in an adaptive manner. An efficient iterative algorithm is developed with a convergence guarantee. Experimental results on four benchmarks demonstrate the correctness and effectiveness of the proposed model.

Keywords

Cite

@article{arxiv.1705.07777,
  title  = {Robust Localized Multi-view Subspace Clustering},
  author = {Yanbo Fan and Jian Liang and Ran He and Bao-Gang Hu and Siwei Lyu},
  journal= {arXiv preprint arXiv:1705.07777},
  year   = {2017}
}

Comments

7 pages

R2 v1 2026-06-22T19:54:50.479Z