Graph Classification
381 papers with code • 65 benchmarks • 46 datasets
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.
( Image credit: Hierarchical Graph Pooling with Structure Learning )
Libraries
Use these libraries to find Graph Classification models and implementationsLatest papers with no code
Molecular Classification Using Hyperdimensional Graph Classification
Our work introduces an innovative approach to graph learning by leveraging Hyperdimensional Computing.
Generation is better than Modification: Combating High Class Homophily Variance in Graph Anomaly Detection
We find that in graph anomaly detection, the homophily distribution differences between different classes are significantly greater than those in homophilic and heterophilic graphs.
A Differential Geometric View and Explainability of GNN on Evolving Graphs
Graphs are ubiquitous in social networks and biochemistry, where Graph Neural Networks (GNN) are the state-of-the-art models for prediction.
HDReason: Algorithm-Hardware Codesign for Hyperdimensional Knowledge Graph Reasoning
When conducting cross-models and cross-platforms comparison, HDReason yields an average 4. 2x higher performance and 3. 4x better energy efficiency with similar accuracy versus the state-of-the-art FPGA-based GCN training platform.
Multi-Scale Subgraph Contrastive Learning
By an experimental analysis, we discover the semantic information of an augmented graph structure may be not consistent as original graph structure, and whether two augmented graphs are positive or negative pairs is highly related with the multi-scale structures.
Verifying message-passing neural networks via topology-based bounds tightening
Since graph neural networks (GNNs) are often vulnerable to attack, we need to know when we can trust them.
Inductive Graph Alignment Prompt: Bridging the Gap between Graph Pre-training and Inductive Fine-tuning From Spectral Perspective
Based on the insight of graph pre-training, we propose to bridge the graph signal gap and the graph structure gap with learnable prompts in the spectral space.
Class-Balanced and Reinforced Active Learning on Graphs
It learns an optimal policy to acquire class-balanced and informative nodes for annotation, maximizing the performance of GNNs trained with selected labeled nodes.
Message Detouring: A Simple Yet Effective Cycle Representation for Expressive Graph Learning
Graph learning is crucial in the fields of bioinformatics, social networks, and chemicals.
Generalization Error of Graph Neural Networks in the Mean-field Regime
This work provides a theoretical framework for assessing the generalization error of graph classification tasks via graph neural networks in the over-parameterized regime, where the number of parameters surpasses the quantity of data points.