https://github.com/phd-lanyu/mhnf
공식 코드MHNF: Multi-hop Heterogeneous Neighborhood information Fusion graph representation learning
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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>
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
MHNF: Multi-hop Heterogeneous Neighborhood information Fusion graph representation learning
TME-BNA: Temporal Motif-Preserving Network Embedding with Bicomponent Neighbor Aggregation
Architecture Matters: Uncovering Implicit Mechanisms in Graph Contrastive Learning
Enhancing Graph Representation Learning with Localized Topological Features
Wiki-CS: A Wikipedia-Based Benchmark for Graph Neural Networks
Conformal Prediction: A Theoretical Note and Benchmarking Transductive Node Classification in Graphs
Low-bit Quantization for Deep Graph Neural Networks with Smoothness-aware Message Propagation
What's Behind the Mask: Understanding Masked Graph Modeling for Graph Autoencoders
BenchTemp: A General Benchmark for Evaluating Temporal Graph Neural Networks
LOGIN: A Large Language Model Consulted Graph Neural Network Training Framework
DIFFormer: Scalable (Graph) Transformers Induced by Energy Constrained Diffusion
NodeFormer: A Scalable Graph Structure Learning Transformer for Node Classification
Finding Global Homophily in Graph Neural Networks When Meeting Heterophily
Spectral Graph Pruning Against Over-Squashing and Over-Smoothing
SMGRL: Scalable Multi-resolution Graph Representation Learning
Hyperbolic Geometric Graph Representation Learning for Hierarchy-imbalance Node Classification
Graph Structure Learning with Variational Information Bottleneck
Unsupervised Graph Poisoning Attack via Contrastive Loss Back-propagation
Distilling Influences to Mitigate Prediction Churn in Graph Neural Networks
Rank Collapse Causes Over-Smoothing and Over-Correlation in Graph Neural Networks
Preventing Representational Rank Collapse in MPNNs by Splitting the Computational Graph
Training a Label-Noise-Resistant GNN with Reduced Complexity
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.