Learning Large-scale Network Embedding from Representative Subgraph
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.
Code (0)
등록된 구현이 없습니다.
Tasks
Graph SamplingNetwork EmbeddingMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
SubGCache: Accelerating Graph-based RAG with Subgraph-level KV Cache
Graph-based retrieval-augmented generation (RAG) enables large language models (LLMs) to incorporate structured knowledge via graph retrieval as contextual input, enhancing more accurate and context-aware reasoning. We o…
RAGRetrievalRetrieval-augmented GenerationRevisiting Graph Neural Networks for Link Prediction
Graph neural networks (GNNs) have achieved great success in recent years. Three most common applications include node classification, link prediction, and graph classification. While there is rich literature on node clas…
ClassificationGraph ClassificationLink PredictionNode Classification+1AdaGCL: Adaptive Subgraph Contrastive Learning to Generalize Large-scale Graph Training
Training graph neural networks (GNNs) with good generalizability on large-scale graphs is a challenging problem. Existing methods mainly divide the input graph into multiple subgraphs and train them in different batches …
Contrastive LearningData AugmentationNode ClassificationSUGAR: Subgraph Neural Network with Reinforcement Pooling and Self-Supervised Mutual Information Mechanism
Graph representation learning has attracted increasing research attention. However, most existing studies fuse all structural features and node attributes to provide an overarching view of graphs, neglecting finer substr…
Graph ClassificationGraph Neural NetworkGraph Representation LearningRepresentation LearningTarget Circuit Matching in Large-Scale Netlists using GNN-Based Region Prediction
Subgraph matching plays an important role in electronic design automation (EDA) and circuit verification. Traditional rule-based methods have limitations in generalizing to arbitrary target circuits. Furthermore, node-to…
Graph Matching