Force2Vec: Parallel force-directed graph embedding

2020-09-17 · Md. Khaledur Rahman, Majedul Haque Sujon, Ariful Azad

A graph embedding algorithm embeds a graph into a low-dimensional space such that the embedding preserves the inherent properties of the graph. While graph embedding is fundamentally related to graph visualization, prior work did not exploit this connection explicitly. We develop Force2Vec that uses force-directed graph layout models in a graph embedding setting with an aim to excel in both machine learning (ML) and visualization tasks. We make Force2Vec highly parallel by mapping its core computations to linear algebra and utilizing multiple levels of parallelism available in modern processors. The resultant algorithm is an order of magnitude faster than existing methods (43x faster than DeepWalk, on average) and can generate embeddings from graphs with billions of edges in a few hours. In comparison to existing methods, Force2Vec is better in graph visualization and performs comparably or better in ML tasks such as link prediction, node classification, and clustering. Source code is available at https://github.com/HipGraph/Force2Vec.

📄 PDF Abstract BibTeX arXiv:2009.10035

Code (1)

HipGraph/Force2Vec 공식 구현

Tasks

ClusteringGraph Embedding Link Prediction Node Classification

Methods 이 논문이 사용한 방법론

DeepWalk DeepWalk learns embeddings (social representations) of a graph's vertices, by modeling a stream of short random walks. Social representations are latent features of the…

Force-directed graph embedding with hops distance

2023-09-11 · Hamidreza Lotfalizadeh, Mohammad Al Hasan

Graph embedding has become an increasingly important technique for analyzing graph-structured data. By representing nodes in a graph as vectors in a low-dimensional space, graph embedding enables efficient graph processi…

Graph Embedding Link Prediction Node Classification

A Scalable Deep Reinforcement Learning Model for Online Scheduling Coflows of Multi-Stage Jobs for High Performance Computing

2021-12-21 · Xin Wang, Hong Shen

Coflow is a recently proposed networking abstraction to help improve the communication performance of data-parallel computing jobs. In multi-stage jobs, each job consists of multiple coflows and is represented by a Direc…

Deep Reinforcement Learning Graph Neural Network Reinforcement Learning (RL)Scheduling

Adversarial Directed Graph Embedding

2020-08-09 · Shijie Zhu, JianXin Li, Hao Peng, Senzhang Wang 외

Node representation learning for directed graphs is critically important to facilitate many graph mining tasks. To capture the directed edges between nodes, existing methods mostly learn two embedding vectors for each no…

Generative Adversarial Network Graph Embedding Graph Mining Representation Learning

Decoding Molecular Graph Embeddings with Reinforcement Learning

2019-04-18 · Steven Kearnes, Li Li, Patrick Riley

We present RL-VAE, a graph-to-graph variational autoencoder that uses reinforcement learning to decode molecular graphs from latent embeddings. Methods have been described previously for graph-to-graph autoencoding, but …

Graph Matching reinforcement-learning Reinforcement Learning Reinforcement Learning (RL)

Pseudo-Euclidean Attract-Repel Embeddings for Undirected Graphs

2021-06-17 · Alexander Peysakhovich, Anna Klimovskaia Susmel, Leon Bottou

Dot product embeddings take a graph and construct vectors for nodes such that dot products between two vectors give the strength of the edge. Dot products make a strong transitivity assumption, however, many important fo…

Link Prediction Representation Learning