EnD: Enhanced Dedensification for Graph Compressing and Embedding

Abstract

Graph representation learning is essential in applying machine learning methods on large-scale networks. Several embedding approaches have shown promising outcomes in recent years. Nonetheless, on massive graphs, it may be time-consuming and space inefficient for direct applications of existing embedding methods. This paper presents a novel graph compression approach based on dedensification called Enhanced Dedensification with degree-based compression (EnD). The principal goal of our system is to assure decent compression of large graphs that eloquently favor their representation learning. For this purpose, we first compress the low-degree nodes and dedensify them to reduce the high-degree nodes' loads. Then, we embed the compressed graph instead of the original graph to decrease the representation learning cost. Our approach is a general meta-strategy that attains time and space efficiency over the original graph by applying the state-of-the-art graph embedding methods: Node2vec, DeepWalk, RiWalk, and xNetMf. Comprehensive ex-periments on large-scale real-world graphs validate the viability of our method, which shows sound performance on single and multi-label node classification tasks without losing accuracy.