arrow
返回

GRAPE for fast and scalable graph processing and random-walk-based embedding

delete2023-06-26
delete14
delete
OA
AI
L
Luca Cappelletti
T
Tommaso Fontana
E
Elena Casiraghi
V
Vida Ravanmehr
T
Tiffany J. Callahan
C
Carlos Cano
M
Marcin P. Joachimiak
M
Mungall, Christopher J. J.
P
Peter N. Robinson
J
Justin Reese
G
Giorgio Valentini *
DOI:10.1038/s43588-023-00465-8delete
delete原文链接
delete分享
delete收藏
查看原文
摘要

摘要

En 中文
Graph representation learning methods opened new avenues for addressing complex, real-world problems represented by graphs. However, many graphs used in these applications comprise millions of nodes and billions of edges and are beyond the capabilities of current methods and software implementations. We present GRAPE (Graph Representation Learning, Prediction and Evaluation), a software resource for graph processing and embedding that is able to scale with big graphs by using specialized and smart data structures, algorithms, and a fast parallel implementation of random-walk-based methods. Compared with state-of-the-art software resources, GRAPE shows an improvement of orders of magnitude in empirical space and time complexity, as well as competitive edge- and node-label prediction performance. GRAPE comprises approximately 1.7 million well-documented lines of Python and Rust code and provides 69 node-embedding methods, 25 inference models, a collection of efficient graph-processing utilities, and over 80,000 graphs from the literature and other sources. Standardized interfaces allow a seamless integration of third-party libraries, while ready-to-use and modular pipelines permit an easy-to-use evaluation of graph-representation-learning methods, therefore also positioning GRAPE as a software resource that performs a fair comparison between methods and libraries for graph processing and embedding. GRAPE is a software resource for graph learning and embedding that is orders of magnitude faster than existing state-of-the-art libraries, making large-graph analysis feasible in a wide range of real-world applications.
AI总结

AI总结

对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。

期刊

Nature Computational Science 封面图
Nature Computational Science
IF:
18.3
论文数:
3.1K
被引数:
4.0K

机构

U
utmd anderson cancer center
学者数:
3.0W
论文数: 2.4W
被引数: 27
J
Jackson Laboratory
学者数:
3.0K
论文数: 2.0K
被引数: 5.5K
L
Lawrence Berkeley National Laboratory
学者数:
1.5W
论文数: 1.1W
被引数: 6.1W
N
newyork-presbyterian hospital
学者数:
1.6W
论文数: 9.8K
被引数: 15
U
University of Milan
学者数:
5.1W
论文数: 3.9W
被引数: 5.0W
学者 查看更多机构
引用论文

引用论文

Prostate-derived Ets factor, an oncogenic driver in breast cancer
err2017-05-04
err0
errOAAI
errAshwani K Sood; Joseph Geradts; Jessica Young
err分享
err收藏
Insurance activity and economic performance: Fresh evidence from asymmetric panel causality tests
err2018-10-24
err0
errOAAI
errAbdulnasser Hatemi‐J; Chi‐Chuan Lee; Chien‐Chiang Lee; Rangan Gupta
err分享
err收藏
Involvement of reactive oxygen species in adaphostin-induced cytotoxicity in human leukemia cells
err2003-12-15
err0
errOAAI
errJoya Chandra; Jennifer Hackbarth; Son Le; David Loegering; Nancy Bone; Laura M. Bruzek; Ven L. Narayanan; Alex A. Adjei; Neil E. Kay; Ayalew Tefferi; Judith E. Karp; Edward A. Sausville; Scott H. Kaufmann
err分享
err收藏
学者 查看更多内容