Multi-view clustering in latent embedding space

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

Abstract

Previous multi-view clustering algorithms mostly partition the multi-view data in their original feature space, the efficacy of which heavily and implicitly relies on the quality of the original feature presentation. In light of this, this paper proposes a novel approach termed Multi-view Clustering in Latent Embedding Space (MCLES), which is able to cluster the multi-view data in a learned latent embedding space while simultaneously learning the global structure and the cluster indicator matrix in a unified optimization framework. Specifically, in our framework, a latent embedding representation is firstly discovered which can effectively exploit the complementary information from different views. The global structure learning is then performed based on the learned latent embedding representation. Further, the cluster indicator matrix can be acquired directly with the learned global structure. An alternating optimization scheme is introduced to solve the optimization problem. Extensive experiments conducted on several real-world multi-view datasets have demonstrated the superiority of our approach.

Cite

CITATION STYLE

APA

Chen, M. S., Huang, L., Wang, C. D., & Huang, D. (2020). Multi-view clustering in latent embedding space. In AAAI 2020 - 34th AAAI Conference on Artificial Intelligence (pp. 3513–3520). AAAI press. https://doi.org/10.1609/aaai.v34i04.5756

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