Constructing Graph Node Embeddings via Discrimination of Similarity Distributions
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Link PredictionSimilar Papers 제목 키워드 기반
Graph-Graph Similarity Network
Graph classification aims to predict the class label for an entire graph. Recently, Graph Neural Networks (GNNs)-based approaches become an essential strand to learn low-dimensional continuous embeddings of the entire gr…
ClassificationGeneral ClassificationGraph ClassificationGraph Similarity+1Graph-Level Embedding for Time-Evolving Graphs
Graph representation learning (also known as network embedding) has been extensively researched with varying levels of granularity, ranging from nodes to graphs. While most prior work in this area focuses on node-level r…
Anomaly DetectionGraph Representation LearningGraph SimilarityLanguage Modeling+4Federated Graph Semantic and Structural Learning
Federated graph learning collaboratively learns a global graph neural network with distributed graphs, where the non-independent and identically distributed property is one of the major challenges. Most relative arts foc…
Graph LearningGraph Neural NetworkReconciling Competing Sampling Strategies of Network Embedding
Network embedding plays a significant role in a variety of applications. To capture the topology of the network, most of the existing network embedding algorithms follow a sampling training procedure, which maximizes the…
Edgeless-GNN: Unsupervised Representation Learning for Edgeless Nodes
We study the problem of embedding edgeless nodes such as users who newly enter the underlying network, while using graph neural networks (GNNs) widely studied for effective representation learning of graphs. Our study is…
Network EmbeddingRepresentation Learning