About Graph Degeneracy, Representation Learning and Scalability

by   Simon Brandeis, et al.

Graphs or networks are a very convenient way to represent data with lots of interaction. Recently, Machine Learning on Graph data has gained a lot of traction. In particular, vertex classification and missing edge detection have very interesting applications, ranging from drug discovery to recommender systems. To achieve such tasks, tremendous work has been accomplished to learn embedding of nodes and edges into finite-dimension vector spaces. This task is called Graph Representation Learning. However, Graph Representation Learning techniques often display prohibitive time and memory complexities, preventing their use in real-time with business size graphs. In this paper, we address this issue by leveraging a degeneracy property of Graphs - the K-Core Decomposition. We present two techniques taking advantage of this decomposition to reduce the time and memory consumption of walk-based Graph Representation Learning algorithms. We evaluate the performances, expressed in terms of quality of embedding and computational resources, of the proposed techniques on several academic datasets. Our code is available at https://github.com/SBrandeis/kcore-embedding



There are no comments yet.


page 1

page 2

page 3

page 4


Efficient Representation Learning Using Random Walks for Dynamic graphs

An important part of many machine learning workflows on graphs is vertex...

On the Interpretability and Evaluation of Graph Representation Learning

With the rising interest in graph representation learning, a variety of ...

Disentangle-based Continual Graph Representation Learning

Graph embedding (GE) methods embed nodes (and/or edges) in graph into a ...

Molecular Graph Representation Learning via Heterogeneous Motif Graph Construction

We consider feature representation learning problem of molecular graphs....

Time-varying Graph Representation Learning via Higher-Order Skip-Gram with Negative Sampling

Representation learning models for graphs are a successful family of tec...

Sparse hierarchical representation learning on molecular graphs

Architectures for sparse hierarchical representation learning have recen...

GraPE: fast and scalable Graph Processing and Embedding

Graph Representation Learning methods have enabled a wide range of learn...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.