Constructing Graph Node Embeddings via Discrimination of Similarity Distributions
arXiv:1810.03032 · doi:10.1109/ICDMW.2018.00152
Abstract
The problem of unsupervised learning node embeddings in graphs is one of the important directions in modern network science. In this work we propose a novel framework, which is aimed to find embeddings by \textit{discriminating distributions of similarities (DDoS)} between nodes in the graph. The general idea is implemented by maximizing the \textit{earth mover distance} between distributions of decoded similarities of similar and dissimilar nodes. The resulting algorithm generates embeddings which give a state-of-the-art performance in the problem of link prediction in real-world graphs.
References in corpus (9)
- Distributed Representations of Words and Phrases and their Compositionality
- Finding and evaluating community structure in networks
- Community detection in graphs
- DeepWalk: Online Learning of Social Representations
- LINE: Large-scale Information Network Embedding
- VERSE: Versatile Graph Embeddings from Similarity Measures
- Learning Deep Embeddings with Histogram Loss
- A Comprehensive Survey of Graph Embedding: Problems, Techniques and Applications
- Supervised Random Walks: Predicting and Recommending Links in Social Networks