K-Core Decomposition for Graph Representation Learning

About Graph Degeneracy, Representation Learning and Scalability

We present two techniques taking advantage of a degeneracy property of graphs-the k-coredecomposition - to reduce the time and memory consumption of walk-based 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.