Learning Large-scale Network Embedding from Representative Subgraph

by   Junsheng Kong, et al.
South China University of Technology International Student Union

We study the problem of large-scale network embedding, which aims to learn low-dimensional latent representations for network mining applications. Recent research in the field of network embedding has led to significant progress such as DeepWalk, LINE, NetMF, NetSMF. However, the huge size of many real-world networks makes it computationally expensive to learn network embedding from the entire network. In this work, we present a novel network embedding method called "NES", which learns network embedding from a small representative subgraph. NES leverages theories from graph sampling to efficiently construct representative subgraph with smaller size which can be used to make inferences about the full network, enabling significantly improved efficiency in embedding learning. Then, NES computes the network embedding from this representative subgraph, efficiently. Compared with well-known methods, extensive experiments on networks of various scales and types demonstrate that NES achieves comparable performance and significant efficiency superiority.


page 1

page 2

page 3

page 4


NetSMF: Large-Scale Network Embedding as Sparse Matrix Factorization

We study the problem of large-scale network embedding, which aims to lea...

Spectral Network Embedding: A Fast and Scalable Method via Sparsity

Network embedding aims to learn low-dimensional representations of nodes...

Simplifying Subgraph Representation Learning for Scalable Link Prediction

Link prediction on graphs is a fundamental problem in graph representati...

SepNE: Bringing Separability to Network Embedding

Many successful methods have been proposed for learning low dimensional ...

KGTuner: Efficient Hyper-parameter Search for Knowledge Graph Learning

While hyper-parameters (HPs) are important for knowledge graph (KG) lear...

Fast Graph Construction Using Auction Algorithm

In practical machine learning systems, graph based data representation h...

Ego-CNN: Distributed, Egocentric Representations of Graphs for Detecting Critical Structures

We study the problem of detecting critical structures using a graph embe...

Please sign up or login with your details

Forgot password? Click here to reset