https://github.com/hse-dyngraph-research-team/dyngraphmodelling
공식 코드Temporal Graph Network Embedding with Causal Anonymous Walks Representations
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
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>
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Temporal Graph Network Embedding with Causal Anonymous Walks Representations
DyG2Vec: Efficient Representation Learning for Dynamic Graphs
DyG2Vec: Efficient Representation Learning for Dynamic Graphs
Deep Iterative and Adaptive Learning for Graph Neural Networks
Hierarchical graph sampling based minibatch learning with chain preservation and variance reduction
GraphGAN: Graph Representation Learning with Generative Adversarial Nets
Mixture of Scope Experts at Test: Generalizing Deeper Graph Neural Networks with Shallow Variants
Shoestring: Graph-Based Semi-Supervised Learning with Severely Limited Labeled Data
GraphReach: Position-Aware Graph Neural Network using Reachability Estimations
Efficient and Privacy-Preserved Link Prediction via Condensed Graphs
VideoSAGE: Video Summarization with Graph Representation Learning
A Meta-Learning Approach for Training Explainable Graph Neural Networks
BernNet: Learning Arbitrary Graph Spectral Filters via Bernstein Approximation
Convolutional Neural Networks on Graphs with Chebyshev Approximation, Revisited
Spectral Heterogeneous Graph Convolutions via Positive Noncommutative Polynomials
Similarity-Navigated Conformal Prediction for Graph Neural Networks
Exploiting Neighbor Effect: Conv-Agnostic GNNs Framework for Graphs with Heterophily
SA-MLP: Distilling Graph Knowledge from GNNs into Structure-Aware MLP
Understanding over-squashing and bottlenecks on graphs via curvature
Long-range Meta-path Search on Large-scale Heterogeneous Graphs
Long-range Meta-path Search on Large-scale Heterogeneous Graphs
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.