BIGSAGE: unsupervised inductive representation learning of graph via bi-attended sampling and global-biased aggregating
Different kinds of representation learning techniques on graph have shown significant effect in downstream machine learning tasks. Recently, in order to inductively learn representations for graph structures that is unobservable during training, a general framework with sampling and aggregating (GraphSAGE) was proposed by Hamilton and Ying and had been proved more efficient than transductive methods on fileds like transfer learning or evolving dataset. However, GraphSAGE is uncapable of selective neighbor sampling and lack of memory of known nodes that've been trained. To address these problems, we present an unsupervised method that samples neighborhood information attended by co-occurring structures and optimizes a trainable global bias as a representation expectation for each node in the given graph. Experiments show that our approach outperforms the state-of-the-art inductive and unsupervised methods for representation learning on graphs.
Code (0)
등록된 구현이 없습니다.
Tasks
Representation LearningTransfer LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Inductive and Unsupervised Representation Learning on Graph Structured Objects
Inductive and unsupervised graph learning is a critical technique for predictive or information retrieval tasks where label information is difficult to obtain. It is also challenging to make graph learning inductive and …
Graph LearningGraph SimilarityInformation RetrievalRepresentation Learning+1Unsupervised Joint k-node Graph Representations with Compositional Energy-Based Models
Existing Graph Neural Network (GNN) methods that learn inductive unsupervised graph representations focus on learning node and edge representations by predicting observed edges in the graph. Although such approaches have…
Graph Neural NetworkNode ClassificationUnsupervised Joint $k$-node Graph Representations with Compositional Energy-Based Models
Existing Graph Neural Network (GNN) methods that learn inductive unsupervised graph representations focus on learning node and edge representations by predicting observed edges in the graph. Although such approaches have…
Graph Neural NetworkNode ClassificationUnsupervised Inductive Graph-Level Representation Learning via Graph-Graph Proximity
We introduce a novel approach to graph-level representation learning, which is to embed an entire graph into a vector space where the embeddings of two graphs preserve their graph-graph proximity. Our approach, UGRAPHEMB…
General ClassificationGraph ClassificationGraph EmbeddingGraph Similarity+1AttrE2vec: Unsupervised Attributed Edge Representation Learning
Representation learning has overcome the often arduous and manual featurization of networks through (unsupervised) feature learning as it results in embeddings that can apply to a variety of downstream learning tasks. Th…
ClusteringEdge ClassificationRepresentation Learning