Node Classification
782 papers with code • 122 benchmarks • 69 datasets
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.
( Image credit: Fast Graph Representation Learning With PyTorch Geometric )
Libraries
Use these libraries to find Node Classification models and implementationsSubtasks
Latest papers with no code
HeteroMILE: a Multi-Level Graph Representation Learning Framework for Heterogeneous Graphs
To address this issue, we propose a Multi-Level Embedding framework of nodes on a heterogeneous graph (HeteroMILE) - a generic methodology that allows contemporary graph embedding methods to scale to large graphs.
Graph Neural Aggregation-diffusion with Metastability
Due to the connection between graph diffusion and message passing, diffusion-based models have been widely studied.
Beyond the Known: Novel Class Discovery for Open-world Graph Learning
Inter-class correlations are subsequently eliminated by the prototypical attention network, leading to distinctive representations for different classes.
Variational Graph Auto-Encoder Based Inductive Learning Method for Semi-Supervised Classification
Graph representation learning is a fundamental research issue in various domains of applications, of which the inductive learning problem is particularly challenging as it requires models to generalize to unseen graph structures during inference.
Learn from Heterophily: Heterophilous Information-enhanced Graph Neural Network
Under circumstances of heterophily, where nodes with different labels tend to be connected based on semantic meanings, Graph Neural Networks (GNNs) often exhibit suboptimal performance.
ChebMixer: Efficient Graph Representation Learning with MLP Mixer
In this paper, we present a novel architecture named ChebMixer, a newly graph MLP Mixer that uses fast Chebyshev polynomials-based spectral filtering to extract a sequence of tokens.
A Federated Parameter Aggregation Method for Node Classification Tasks with Different Graph Network Structures
Additionally, for the privacy security of FLGNN, this paper designs membership inference attack experiments and differential privacy defense experiments.
Node Classification via Semantic-Structural Attention-Enhanced Graph Convolutional Networks
Graph data, also known as complex network data, is omnipresent across various domains and applications.
Exploring the Potential of Large Language Models in Graph Generation
In this paper, we propose LLM4GraphGen to explore the ability of LLMs for graph generation with systematical task designs and extensive experiments.
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.