Information-Enhanced Graph Neural Network for Transcending Homophily Barriers
Homophily and heterophily are intrinsic properties of graphs that describe whether linked nodes share similar properties. While Message Passing Neural Networks (MPNNs) have shown remarkable success in node classification tasks, their performance often deteriorates within specific homophily ranges, w...
Saved in:
Main Authors: | Xiao Liu, Lijun Zhang, Hui Guan |
---|---|
Format: | Article |
Language: | English |
Published: |
IEEE
2024-01-01
|
Series: | IEEE Access |
Subjects: | |
Online Access: | https://ieeexplore.ieee.org/document/10810421/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Limits of Depth: Over-Smoothing and Over-Squashing in GNNs
by: Aafaq Mohi ud din, et al.
Published: (2024-03-01) -
Graph Geometric Algebra networks for graph representation learning
by: Jianqi Zhong, et al.
Published: (2025-01-01) -
Node Classification on The Citation Network Using Graph Neural Network
by: Irani Hoeronis, et al.
Published: (2023-06-01) -
SViG: A Similarity-Thresholded Approach for Vision Graph Neural Networks
by: Ismael Elsharkawi, et al.
Published: (2025-01-01) -
Graph Neural Networks in Brain Connectivity Studies: Methods, Challenges, and Future Directions
by: Hamed Mohammadi, et al.
Published: (2024-12-01)