Simple Truncated SVD based Model for Node Classification on Heterophilic Graphs
Graph Neural Networks (GNNs) have shown excellent performance on graphs that exhibit strong homophily with respect to the node labels i.e. connected nodes have same labels. However, they perform poorly on heterophilic graphs. Recent approaches have typically modified aggregation schemes, designed adaptive graph filters, etc. to address this limitation. In spite of this, the performance on heterophilic graphs can still be poor. We propose a simple alternative method that exploits Truncated Singular Value Decomposition (TSVD) of topological structure and node features. Our approach achieves up to ~30% improvement in performance over state-of-the-art methods on heterophilic graphs. This work is an early investigation into methods that differ from aggregation based approaches. Our experimental results suggest that it might be important to explore other alternatives to aggregation methods for heterophilic setting.
Code (0)
등록된 구현이 없습니다.
Tasks
Node ClassificationSimilar Papers 제목 키워드 기반
ScaleNet: Scale Invariance Learning in Directed Graphs
Graph Neural Networks (GNNs) have advanced relational data analysis but lack invariance learning techniques common in image classification. In node classification with GNNs, it is actually the ego-graph of the center nod…
ClassificationGraph Learningimage-classificationImage Classification+1Imbalanced Node Classification Beyond Homophilic Assumption
Imbalanced node classification widely exists in real-world networks where graph neural networks (GNNs) are usually highly inclined to majority classes and suffer from severe performance degradation on classifying minorit…
ClassificationNode ClassificationLabel-Wise Graph Convolutional Network for Heterophilic Graphs
Graph Neural Networks (GNNs) have achieved remarkable performance in modeling graphs for various applications. However, most existing GNNs assume the graphs exhibit strong homophily in node labels, i.e., nodes with simil…
Node ClassificationRepresentation LearningExploring the Potential of Large Language Models for Heterophilic Graphs
Large language models (LLMs) have presented significant opportunities to enhance various machine learning applications, including graph neural networks (GNNs). By leveraging the vast open-world knowledge within LLMs, we …
Node ClassificationWorld KnowledgeDemystifying Structural Disparity in Graph Neural Networks: Can One Size Fit All?
Recent studies on Graph Neural Networks(GNNs) provide both empirical and theoretical evidence supporting their effectiveness in capturing structural patterns on both homophilic and certain heterophilic graphs. Notably, m…
AllNode Classification