https://github.com/dongkwan-kim/SuperGAT
공식 코드How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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>
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
How to Find Your Friendly Neighborhood: Graph Attention Design with Self-Supervision
Node Representation Learning in Graph via Node-to-Neighbourhood Mutual Information Maximization
Fast Graph Sharpness-Aware Minimization for Enhancing and Accelerating Few-Shot Node Classification
LSGNN: Towards General Graph Neural Network in Node Classification by Local Similarity
Utilizing Description Logics for Global Explanations of Heterogeneous Graph Neural Networks
Addressing Heterophily in Node Classification with Graph Echo State Networks
Contrast Similarity-Aware Dual-Pathway Mamba for Multivariate Time Series Node Classification
Bridging the Gap between Community and Node Representations: Graph Embedding via Community Detection
NoisyGL: A Comprehensive Benchmark for Graph Neural Networks under Label Noise
What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoders
Scaling Up Dynamic Graph Representation Learning via Spiking Neural Networks
Less Can Be More: Unsupervised Graph Pruning for Large-scale Dynamic Graphs
Edge Directionality Improves Learning on Heterophilic Graphs
GC4NC: A Benchmark Framework for Graph Condensation on Node Classification with New Insights
A Tale of Two Graphs: Freezing and Denoising Graph Structures for Multimodal Recommendation
Label-Wise Graph Convolutional Network for Heterophilic Graphs
ERASE: Error-Resilient Representation Learning on Graphs for Label Noise Tolerance
Bag of Tricks for Node Classification with Graph Neural Networks
PGB: A PubMed Graph Benchmark for Heterogeneous Network Representation Learning
Labeling Trick: A Theory of Using Graph Neural Networks for Multi-Node Representation Learning
GLEMOS: Benchmark for Instantaneous Graph Learning Model Selection
Towards Explanation for Unsupervised Graph-Level Representation Learning
Symmetric Spaces for Graph Embeddings: A Finsler-Riemannian Approach
FedGraph: A Research Library and Benchmark for Federated Graph Learning
Semi-supervised Credit Card Fraud Detection via Attribute-Driven Graph Representation
End-to-End Learning from Complex Multigraphs with Latent-Graph Convolutional Networks
The Split Matters: Flat Minima Methods for Improving the Performance of GNNs
HyperAggregation: Aggregating over Graph Edges with Hypernetworks
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.