Self-weighted multi-view clustering with soft capped norm

作者:

Highlights:

摘要

Real-world data sets are often comprised of multiple representations or modalities which provide different and complementary aspects of information. Multi-view clustering plays an indispensable role in analyzing multi-view data. In multi-view learning, one key step is assigning a reasonable weight to each view according to the view importance. Most existing work learn the weights by introducing a hyperparameter, which is undesired in practice. In this paper, our proposed model learns an optimal weight for each view automatically without introducing an additive parameter as previous methods do. Furthermore, to deal with different level noises and outliers, we propose to use ‘soft’ capped norm, which caps the residual of outliers as a constant value and provides a probability for certain data point being an outlier. An efficient updating algorithm is designed to solve our model and its convergence is also guaranteed theoretically. Extensive experimental results on several real-world data sets show that our proposed model outperforms state-of-the-art multi-view clustering algorithms.

论文关键词:Multi-view clustering,Soft capped norm,Self-weighted strategy,Nonnegative matrix factorization

论文评审过程:Received 21 October 2017, Revised 9 May 2018, Accepted 12 May 2018, Available online 25 May 2018, Version of Record 6 July 2018.

论文官网地址:https://doi.org/10.1016/j.knosys.2018.05.017