Robust multi-view learning via half-quadratic minimization

6Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

Although multi-view clustering is capable to use more information than single view clustering, existing multi-view clustering methods still have issues to be addressed, such as initialization sensitivity, the specification of the number of clusters, and the influence of outliers. In this paper, we propose a robust multi-view clustering method to address these issues. Specifically, we first propose a multi-view based sum-of-square error estimation to make the initialization easy and simple as well as use a sum-of-norm regularization to automatically learn the number of clusters according to data distribution. We further employ robust estimators constructed by the half-quadratic theory to avoid the influence of outliers for conducting robust estimations of both sum-of-square error and the number of clusters. Experimental results on both synthetic and real datasets demonstrate that our method outperforms the state-of-the-art methods.

Cite

CITATION STYLE

APA

Zhu, Y., Zhu, X., & Zheng, W. (2018). Robust multi-view learning via half-quadratic minimization. In IJCAI International Joint Conference on Artificial Intelligence (Vol. 2018-July, pp. 3278–3284). International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2018/455

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free