[edit]
Unsupervised Multi-view Nonlinear Graph Embedding
Proceedings of the 34th Conference on Uncertainty in Artificial Intelligence, PMLR R16:318-327, 2018.
Abstract
In this paper, we study the unsupervised multi-view graph embedding (UMGE) prob- lem, which aims to learn graph embedding from multiple perspectives in an unsupervised manner. However, the vast majority of multi- view learning work focuses on non-graph data, and surprisingly there are limited work on UMGE. By systematically analyzing different existing methods for UMGE, we discover that cross-view and nonlinearity play a vital role in efficiently improving graph embedding qual- ity. Motivated by this concept, we develop an unsupervised Multi-viEw nonlineaR Graph Embedding (MERGE) approach to model re- lational multi-view consistency. Experimen- tal results on five benchmark datasets demon- strate that MERGE significantly outperforms the state-of-the-art baselines in terms of accu- racy in node classification tasks without sacri- ficing the computational efficiency.