English

Gaussian Embedding of Large-scale Attributed Graphs

Machine Learning 2019-12-03 v1 Machine Learning

Abstract

Graph embedding methods transform high-dimensional and complex graph contents into low-dimensional representations. They are useful for a wide range of graph analysis tasks including link prediction, node classification, recommendation and visualization. Most existing approaches represent graph nodes as point vectors in a low-dimensional embedding space, ignoring the uncertainty present in the real-world graphs. Furthermore, many real-world graphs are large-scale and rich in content (e.g. node attributes). In this work, we propose GLACE, a novel, scalable graph embedding method that preserves both graph structure and node attributes effectively and efficiently in an end-to-end manner. GLACE effectively models uncertainty through Gaussian embeddings, and supports inductive inference of new nodes based on their attributes. In our comprehensive experiments, we evaluate GLACE on real-world graphs, and the results demonstrate that GLACE significantly outperforms state-of-the-art embedding methods on multiple graph analysis tasks.

Keywords

Cite

@article{arxiv.1912.00536,
  title  = {Gaussian Embedding of Large-scale Attributed Graphs},
  author = {Bhagya Hettige and Yuan-Fang Li and Weiqing Wang and Wray Buntine},
  journal= {arXiv preprint arXiv:1912.00536},
  year   = {2019}
}
R2 v1 2026-06-23T12:32:35.339Z