GraPE: fast and scalable Graph Processing and Embedding

10/12/2021
by   Luca Cappelletti, et al.
0

Graph Representation Learning methods have enabled a wide range of learning problems to be addressed for data that can be represented in graph form. Nevertheless, several real world problems in economy, biology, medicine and other fields raised relevant scaling problems with existing methods and their software implementation, due to the size of real world graphs characterized by millions of nodes and billions of edges. We present GraPE, a software resource for graph processing and random walk based embedding, that can scale with large and high-degree graphs and significantly speed up-computation. GraPE comprises specialized data structures, algorithms, and a fast parallel implementation that displays everal orders of magnitude improvement in empirical space and time complexity compared to state of the art software resources, with a corresponding boost in the performance of machine learning methods for edge and node label prediction and for the unsupervised analysis of graphs.GraPE is designed to run on laptop and desktop computers, as well as on high performance computing clusters

READ FULL TEXT

page 7

page 10

research
05/01/2018

Efficient Graph Computation for Node2Vec

Node2Vec is a state-of-the-art general-purpose feature learning method f...
research
05/28/2020

A Distributed Multi-GPU System for Large-Scale Node Embedding at Tencent

Scaling node embedding systems to efficiently process networks in real-w...
research
01/05/2019

Efficient Representation Learning Using Random Walks for Dynamic graphs

An important part of many machine learning workflows on graphs is vertex...
research
02/26/2018

MILE: A Multi-Level Framework for Scalable Graph Embedding

Recently there has been a surge of interest in designing graph embedding...
research
02/08/2021

Graph Traversal with Tensor Functionals: A Meta-Algorithm for Scalable Learning

Graph Representation Learning (GRL) methods have impacted fields from ch...
research
08/27/2023

SPEED: Streaming Partition and Parallel Acceleration for Temporal Interaction Graph Embedding

Temporal Interaction Graphs (TIGs) are widely employed to model intricat...
research
12/31/2022

UltraProp: Principled and Explainable Propagation on Large Graphs

Given a large graph with few node labels, how can we (a) identify the mi...

Please sign up or login with your details

Forgot password? Click here to reset