Papers with Code 아카이브
Graph Representation Learning
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
- 하위 태스크
- 1
- 평가표
- 1
- 보존된 평가 기록
- 1
The goal of Graph Representation Learning is to construct a set of features (‘embeddings’) representing the structure of the graph and the data thereon. We can distinguish among Node-wise embeddings, representing each node of the graph, Edge-wise embeddings, representing each edge in the graph, and Graph-wise embeddings representing the graph as a whole.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
ClassContrast: Bridging the Spatial and Contextual Gaps for Node Representations
Diss-l-ECT: Dissecting Graph Data with Local Euler Characteristic Transforms
Verbalized Graph Representation Learning: A Fully Interpretable Graph Model Based on Large Language Models Throughout the Entire Process
TopER: Topological Embeddings in Graph Representation Learning
PROXI: Challenging the GNNs for Link Prediction
Knowledge Graph Embedding by Normalizing Flows
Whole-Graph Representation Learning For the Classification of Signed Networks
Heterogeneous Hyper-Graph Neural Networks for Context-aware Human Activity Recognition
NeuroPath: A Neural Pathway Transformer for Joining the Dots of Human Connectomes
Embedding Knowledge Graph in Function Spaces
MDL-Pool: Adaptive Multilevel Graph Pooling Based on Minimum Description Length
Molecular Graph Representation Learning via Structural Similarity Information
GRE^2-MDCL: Graph Representation Embedding Enhanced via Multidimensional Contrastive Learning
Multi-object event graph representation learning for Video Question Answering
Graffin: Stand for Tails in Imbalanced Node Classification
MTLSO: A Multi-Task Learning Approach for Logic Synthesis Optimization
Ethereum Fraud Detection via Joint Transaction Language Model and Graph Representation Learning
The Role of Graph Topology in the Performance of Biomedical Knowledge Graph Completion Models
Debiasing Graph Representation Learning based on Information Bottleneck
When Heterophily Meets Heterogeneous Graphs: Latent Graphs Guided Unsupervised Representation Learning
PSLF: A PID Controller-incorporated Second-order Latent Factor Analysis Model for Recommender System
CL4KGE: A Curriculum Learning Method for Knowledge Graph Embedding
SiHGNN: Leveraging Properties of Semantic Graphs for Efficient HGNN Acceleration
Neural Spacetimes for DAG Representation Learning
Disentangled Generative Graph Representation Learning
Disentangling, Amplifying, and Debiasing: Learning Disentangled Representations for Fair Graph Neural Networks
Molecular Graph Representation Learning Integrating Large Language Models with Domain-specific Small Models
Dynamic Graph Representation Learning for Passenger Behavior Prediction
CEGRL-TKGR: A Causal Enhanced Graph Representation Learning Framework for Temporal Knowledge Graph Reasoning
Predictive Multiplicity of Knowledge Graph Embeddings in Link Prediction
Conformalized Answer Set Prediction for Knowledge Graph Embedding
Simple but Effective Compound Geometric Operations for Temporal Knowledge Graph Completion
Low-Dimensional Federated Knowledge Graph Embedding via Knowledge Distillation
Path-LLM: A Shortest-Path-based LLM Learning for Unified Graph Representation
Node Level Graph Autoencoder: Unified Pretraining for Textual Graph Learning
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.