https://github.com/jhl-hust/nagphormer
공식 코드NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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>
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
NAGphormer: A Tokenized Graph Transformer for Node Classification in Large Graphs
Higher-Order GNNs Meet Efficiency: Sparse Sobolev Graph Neural Networks
LLM-Based Multi-Agent Systems are Scalable Graph Generative Models
You are AllSet: A Multiset Function Framework for Hypergraph Neural Networks
Adaptive Universal Generalized PageRank Graph Neural Network
Leveraging Large Language Models for Node Generation in Few-Shot Learning on Text-Attributed Graphs
A Flexible Generative Framework for Graph-based Semi-supervised Learning
Semi-supervised Domain Adaptation on Graphs with Contrastive Learning and Minimax Entropy
TAGLAS: An atlas of text-attributed graph datasets in the era of large graph and language models
Deep Graph Neural Networks via Posteriori-Sampling-based Node-Adaptive Residual Module
LGD-GCN: Local and Global Disentangled Graph Convolutional Networks
Mold into a Graph: Efficient Bayesian Optimization over Mixed-Spaces
Joint Graph Rewiring and Feature Denoising via Spectral Resonance
Training-free Graph Neural Networks and the Power of Labels as Features
Curriculum-Enhanced Residual Soft An-Isotropic Normalization for Over-smoothness in Deep GNNs
Reproducibility Study Of Learning Fair Graph Representations Via Automated Data Augmentations
Multi-task Self-supervised Graph Neural Networks Enable Stronger Task Generalization
When Heterophily Meets Heterogeneity: Challenges and a New Large-Scale Graph Benchmark
Explanation-Preserving Augmentation for Semi-Supervised Graph Representation Learning
Deperturbation of Online Social Networks via Bayesian Label Transition
DEMO-Net: Degree-specific Graph Neural Networks for Node and Graph Classification
Graph-Bert: Only Attention is Needed for Learning Graph Representations
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.