Learning latent features for multi-view clustering based on NMF

Abstract

Multi-view data coming from multiple ways or being presented in multiple forms, have more information than single-view data. So multi-view clustering benefits from exploiting the more information. Nonnegative matrix factorization (NMF) is an efficient method to learn low-rank approximation of nonnegative matrix of nonnegative data, but it may not be good at clustering. This paper presents a novel multiview clustering algorithm (called MVCS) which properly combines the similarity and NMF. It aims to obtain latent features shared by multiple views with factorizations, which is a common factor matrix attained from the views and the common similarity matrix. Besides, according to the reconstruction precisions of data matrices, MVCS could adaptively learn the weight. Experiments on real-world data sets demonstrate that our approach may effectively facilitate multi-view clustering and induce superior clustering results.