Graph sampling for node embedding
Node embedding is a central topic in graph representation learning. Computational efficiency and scalability can be challenging to any method that requires full-graph operations. We propose sampling approaches to node embedding, with or without explicit modelling of the feature vector, which aim to extract useful information from both the eigenvectors related to the graph Laplacien and the given values associated with the graph.
Code (0)
등록된 구현이 없습니다.
Tasks
Computational EfficiencyGraph Representation LearningGraph SamplingRepresentation LearningSimilar Papers 제목 키워드 기반
Hierarchical Estimation for Effective and Efficient Sampling Graph Neural Network
Improving the scalability of GNNs is critical for large graphs. Existing methods leverage three sampling paradigms including node-wise, layer-wise and subgraph sampling, then design unbiased estimator for scalability. Ho…
Graph Neural NetworkTime SeriesTime Series AnalysisImproving Skip-Gram based Graph Embeddings via Centrality-Weighted Sampling
Network embedding techniques inspired by word2vec represent an effective unsupervised relational learning model. Commonly, by means of a Skip-Gram procedure, these techniques learn low dimensional vector representations …
Graph EmbeddingNetwork EmbeddingNode ClassificationRelational ReasoningFeLoG: Scalable and Efficient Distributed Graph Embedding with Feedback Loop Mechanism
Graph embedding maps graph nodes into low-dimensional vectors to support applications such as recommendation, fraud detection, and graph-based retrieval-augmented generation (GraphRAG). As graphs scale to billions of edg…
Fraud DetectionGraph EmbeddingLoNe Sampler: Graph node embeddings by coordinated local neighborhood sampling
Local graph neighborhood sampling is a fundamental computational problem that is at the heart of algorithms for node representation learning. Several works have presented algorithms for learning discrete node embeddings …
Representation LearningSampled in Pairs and Driven by Text: A New Graph Embedding Framework
In graphs with rich texts, incorporating textual information with structural information would benefit constructing expressive graph embeddings. Among various graph embedding models, random walk (RW)-based is one of the …
Graph EmbeddingLink Prediction