EUVIMEDEUVIMED entdecken
Crossref

Distributed Graph Embedding with Information-Oriented Random Walks

Peng Fang, Arijit Khan, Siqiang Luo, Fang Wang, Dan Feng, Zhenli Li, Wei Yin, Yuchao Cao

Proceedings of the VLDB Endowment · 2023-03 · 16 (7) · 1643-1656

DOI: 10.14778/3587136.3587140 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Proceedings of the VLDB Endowment, online erschienen am 08.05.2023. Verfasst von Peng Fang und 7 weiteren Autor:innen. Die Arbeit wurde bisher 16-mal zitiert (Crossref) und nennt 70 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

Graph embedding maps graph nodes to low-dimensional vectors, and is widely adopted in machine learning tasks. The increasing availability of billion-edge graphs underscores the importance of learning efficient and effective embeddings on large graphs, such as link prediction on Twitter with over one billion edges. Most existing graph embedding methods fall short of reaching high data scalability. In this paper, we present a general-purpose, distributed, information-centric random walk-based graph embedding framework, DistGER, which can scale to embed billion-edge graphs. DistGER incrementally computes information-centric random walks. It further leverages a multi-proximity-aware, streaming, parallel graph partitioning strategy, simultaneously achieving high local partition quality and excellent workload balancing across machines. DistGER also improves the distributed Skip-Gram learning model to generate node embeddings by optimizing the access locality, CPU throughput, and synchronization efficiency. Experiments on real-world graphs demonstrate that compared to state-of-the-art distributed graph embedding frameworks, including KnightKing, DistDGL, and Pytorch-BigGraph, DistGER exhibits 2.33×--129× acceleration, 45% reduction in cross-machines communication, and >10% effectiveness improvement in downstream tasks.

Zitieren

APA

Fang, P., Khan, A., Luo, S., Wang, F., Feng, D., Li, Z., Yin, W., & Cao, Y. (2023). Distributed Graph Embedding with Information-Oriented Random Walks. Proceedings of the VLDB Endowment, 16(7), 1643-1656. https://doi.org/10.14778/3587136.3587140

Vancouver

Fang P, Khan A, Luo S, Wang F, Feng D, Li Z, et al. Distributed Graph Embedding with Information-Oriented Random Walks. Proceedings of the VLDB Endowment. 2023;16(7):1643-1656. doi:10.14778/3587136.3587140

BibTeX
@article{Fang2023,
  author = {Fang, Peng and Khan, Arijit and Luo, Siqiang and Wang, Fang and Feng, Dan and Li, Zhenli and Yin, Wei and Cao, Yuchao},
  title = {Distributed Graph Embedding with Information-Oriented Random Walks},
  journal = {Proceedings of the VLDB Endowment},
  year = {2023},
  volume = {16},
  number = {7},
  pages = {1643--1656},
  doi = {10.14778/3587136.3587140}
}
Kostenlos starten →