Distributed-Memory Vertex-Centric Network Embedding for Large-Scale Graphs

06/07/2020
by   Sara Riazi, et al.
0

Network embedding is an important step in many different computations based on graph data. However, existing approaches are limited to small or middle size graphs with fewer than a million edges. In practice, web or social network graphs are orders of magnitude larger, thus making most current methods impractical for very large graphs. To address this problem, we introduce a new distributed-memory parallel network embedding method based on Apache Spark and GraphX. We demonstrate the scalability of our method as well as its ability to generate meaningful embeddings for vertex classification and link prediction on both real-world and synthetic graphs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/28/2019

PyTorch-BigGraph: A Large-scale Graph Embedding System

Graph embedding methods produce unsupervised node features from graphs t...
research
07/26/2023

HUGE: Huge Unsupervised Graph Embeddings with TPUs

Graphs are a representation of structured data that captures the relatio...
research
03/28/2023

Distributed Graph Embedding with Information-Oriented Random Walks

Graph embedding maps graph nodes to low-dimensional vectors, and is wide...
research
03/28/2019

Distributed Algorithms for Fully Personalized PageRank on Large Graphs

Personalized PageRank (PPR) has enormous applications, such as link pred...
research
06/20/2021

Large-Scale Network Embedding in Apache Spark

Network embedding has been widely used in social recommendation and netw...
research
03/13/2018

VERSE: Versatile Graph Embeddings from Similarity Measures

Embedding a web-scale information network into a low-dimensional vector ...
research
05/26/2023

Link Residual Closeness of Harary Graphs

The study of networks characteristics is an important subject in differe...

Please sign up or login with your details

Forgot password? Click here to reset