https://github.com/cf020031308/LinkDist
공식 코드Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Node Classification is a machine learning task in graph-based data analysis, where the goal is to assign labels to nodes in a graph based on the properties of nodes and the relationships between them.
Node Classification models aim to predict non-existing node properties (known as the target property) based on other node properties. Typical models used for node classification consists of a large family of graph neural networks. Model performance can be measured using benchmark datasets like Cora, Citeseer, and Pubmed, among others, typically using Accuracy and F1.
<span style="color:grey; opacity: 0.6">( Image credit: Fast Graph Representation Learning With PyTorch Geometric )</span>
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Distilling Self-Knowledge From Contrastive Links to Classify Graph Nodes Without Passing Messages
Graph Entropy Minimization for Semi-supervised Node Classification
Unifying Label-inputted Graph Neural Networks with Deep Equilibrium Models
Unifying Label-inputted Graph Neural Networks with Deep Equilibrium Models
Node Feature Kernels Increase Graph Convolutional Network Robustness
Discrete Graph Structure Learning for Forecasting Multiple Time Series
Learning Representations using Spectral-Biased Random Walks on Graphs
Tracing Hyperparameter Dependencies for Model Parsing via Learnable Graph Pooling Network
Causality and Independence Enhancement for Biased Node Classification
PolyGNN: Polyhedron-based Graph Neural Network for 3D Building Reconstruction from Point Clouds
The Map Equation Goes Neural: Mapping Network Flows with Graph Neural Networks
Enhancing Trustworthiness of Graph Neural Networks with Rank-Based Conformal Training
Bootstrap Latents of Nodes and Neighbors for Graph Self-Supervised Learning
Train Your Own GNN Teacher: Graph-Aware Distillation on Textual Graphs
Task-Oriented GNNs Training on Large Knowledge Graphs for Accurate and Efficient Modeling
Adaptive Spatiotemporal Augmentation for Improving Dynamic Graph Learning
Cooperative Network Learning for Large-Scale and Decentralized Graphs
Polynormer: Polynomial-Expressive Graph Transformer in Linear Time
Linear Opinion Pooling for Uncertainty Quantification on Graphs
Adversarial Contrastive Learning for Evidence-aware Fake News Detection with Graph Neural Networks
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
Label-free Node Classification on Graphs with Large Language Models (LLMS)
Resurrecting Label Propagation for Graphs with Heterophily and Label Noise
MECCH: Metapath Context Convolution-based Heterogeneous Graph Neural Networks
Graph Propagation Transformer for Graph Representation Learning
Confidence-Based Feature Imputation for Graphs with Partially Known Features
Graph Transfer Learning via Adversarial Domain Adaptation with Graph Convolution
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.