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.
논문
이 태스크와 하위 분야의 관련 논문입니다. 실제 성능 비교는 평가 결과에서 확인하세요.
Learning Long Range Dependencies on Graphs via Random Walks
GEFL: Extended Filtration Learning for Graph Classification
Enhancing Fairness in Unsupervised Graph Anomaly Detection through Disentanglement
From Latent to Lucid: Transforming Knowledge Graph Embeddings into Interpretable Structures with KGEPrisma
LinkLogic: A New Method and Benchmark for Explainable Knowledge Graph Predictions
Know Your Neighborhood: General and Zero-Shot Capable Binary Function Search Powered by Call Graphlets
Graph External Attention Enhanced Transformer
Augmentation-based Unsupervised Cross-Domain Functional MRI Adaptation for Major Depressive Disorder Identification
Learning-Based Link Anomaly Detection in Continuous-Time Dynamic Graphs
Port-Hamiltonian Architectural Bias for Long-Range Propagation in Deep Graph Networks
KG-FIT: Knowledge Graph Fine-Tuning Upon Open-World Knowledge
A Structure-Aware Framework for Learning Device Placements on Computation Graphs
Graphlets correct for the topological information missed by random walks
GCondenser: Benchmarking Graph Condensation
HC-GAE: The Hierarchical Cluster-based Graph Auto-Encoder for Graph Representation Learning
Harnessing Collective Structure Knowledge in Data Augmentation for Graph Neural Networks
Harmonizing Human Insights and AI Precision: Hand in Hand for Advancing Knowledge Graph Task
Generalizing Knowledge Graph Embedding with Universal Orthogonal Parameterization
Fair Graph Representation Learning via Sensitive Attribute Disentanglement
PAC-Bayesian Generalization Bounds for Knowledge Graph Representation Learning
Imbalanced Graph Classification with Multi-scale Oversampling Graph Neural Networks
Untargeted Adversarial Attack on Knowledge Graph Embeddings
Relating-Up: Advancing Graph Neural Networks through Inter-Graph Relationships
Towards Continual Knowledge Graph Embedding via Incremental Distillation
AnchorGT: Efficient and Flexible Attention Architecture for Scalable Graph Transformers
Arbitrary Time Information Modeling via Polynomial Approximation for Temporal Knowledge Graph Embedding
Temporal Graph ODEs for Irregularly-Sampled Time Series
SpherE: Expressive and Interpretable Knowledge Graph Embedding for Set Retrieval
Parameter-Efficient Tuning Large Language Models for Graph Representation Learning
Deep Representation Learning for Forecasting Recursive and Multi-Relational Events in Temporal Networks
Bounding the Expected Robustness of Graph Neural Networks Subject to Node Feature Attacks
Unleashing the Potential of Fractional Calculus in Graph Neural Networks with FROND
Delayed Bottlenecking: Alleviating Forgetting in Pre-trained Graph Neural Networks
CausalLP: Learning causal relations with weighted knowledge graph link prediction
GraphMatcher: A Graph Representation Learning Approach for Ontology Matching
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.