.png){kind=icon}
.png){kind=icon}
Return
DGSD: Distributed graph representation via graph statistical properties
.png){kind=icon}
OA
AI
DOI：10.1016/j.future.2021.02.005.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Graph encoding methods have been proven exceptionally useful in many classification tasks - from molecule toxicity prediction to social network recommendations. However, most of the existing methods are designed to work in a centralized environment that requires the whole graph to be kept in memory. Moreover, scaling them on very large networks remains a challenge. In this work, we propose a distributed and permutation invariant graph embedding method denoted as Distributed Graph Statistical Distance (DGSD) that extracts graph representation on independently distributed machines. DGSD finds nodes' local proximity by considering only nodes' degree, common neighbors and direct connectivity that allows it to run in the distributed environment. On the other hand, the linear space complexity of DGSD makes it suitable for processing large graphs. We show the scalability of DGSD on sufficiently large random and real-world networks and evaluate its performance on various bioinformatics and social networks with the implementation in a distributed computing environment. (C) 2021 Elsevier B.V. All rights reserved.
Keywords:
Graph embedding
Distributed computing
Batch processing
Graph classification
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
F
IF:
6.1
Papers:
6.8K
Citations:
2.3W