https://github.com/bgu-cs-vil/im-mpnn
공식 코드Improving the Effective Receptive Field of Message-Passing Neural Networks
태스크의 하위 분류와 논문·코드·평가·기법·데이터셋을 탐색하세요.
Graph Classification is a task that involves classifying a graph-structured data into different classes or categories. Graphs are a powerful way to represent relationships and interactions between different entities, and graph classification can be applied to a wide range of applications, such as social network analysis, bioinformatics, and recommendation systems. In graph classification, the input is a graph, and the goal is to learn a classifier that can accurately predict the class of the graph.
<span style="color:grey; opacity: 0.6">( Image credit: Hierarchical Graph Pooling with Structure Learning )</span>
관련 논문과 평가 결과에 연결된 구현입니다. 출처에서 확인된 저자 구현에는 공식 코드 표시가 있습니다.
Improving the Effective Receptive Field of Message-Passing Neural Networks
BSAL: A Framework of Bi-component Structure and Attribute Learning for Link Prediction
Understanding Attention and Generalization in Graph Neural Networks
Rethinking Kernel Methods for Node Representation Learning on Graphs
Higher-Order Message Passing for Glycan Representation Learning
Fast Tree-Field Integrators: From Low Displacement Rank to Topological Transformers
Hard Label Black Box Node Injection Attack on Graph Neural Networks
Smart Vectorizations for Single and Multiparameter Persistence
Counterfactual Explanations for Graph Classification Through the Lenses of Density
Evaluating Link Prediction Explanations for Graph Neural Networks
Template based Graph Neural Network with Optimal Transport Distances
Few-Shot Learning on Graphs via Super-Classes based on Graph Spectral Measures
Are Powerful Graph Neural Nets Necessary? A Dissection on Graph Classification
Tree Mover's Distance: Bridging Graph Metrics and Stability of Graph Neural Networks
Verifying message-passing neural networks via topology-based bounds tightening
Weisfeiler and Leman Go Neural: Higher-order Graph Neural Networks
Weisfeiler and Leman go sparse: Towards scalable higher-order graph embeddings
TUDataset: A collection of benchmark datasets for learning with graphs
Harnessing the Power of Large Language Model for Uncertainty Aware Graph Processing
Orthogonal Gromov-Wasserstein Discrepancy with Efficient Lower Bound
출처: Papers with Code · CC BY-SA 4.0. 아카이브 자료와 새로 수집한 논문은 별도로 관리합니다.