Graph Learning for Clustering Multi-view Data
share
In this paper, we focus on graph learning from multi-view data of shared entities for clustering. We can explain interactions between the entities in multi-view data using a multi-layer graph with a common vertex set representing the shared entities. The edges on different layers capture the relationships of the entities. Assuming a smoothness data model, we estimate the graph Laplacian matrices of the individual graph layers by constraining their ranks to obtain multi-component graph layers for clustering. We also learn low-dimensional node embeddings, common to all the views, that assimilate the complementary information present in the views. We propose an efficient solver based on alternating minimization to solve the proposed multi-layer multi-component graph learning problem. Numerical experiments on synthetic and real datasets demonstrate that the proposed algorithm outperforms state-of-the-art multi-view clustering techniques.
READ FULL TEXT