Please use this identifier to cite or link to this item: https://hdl.handle.net/10356/176770
Title: Gradient boosted graph convolutional network on heterophilic graph
Authors: Seah, Ming Yang
Keywords: Engineering
Issue Date: 2024
Publisher: Nanyang Technological University
Source: Seah, M. Y. (2024). Gradient boosted graph convolutional network on heterophilic graph. Final Year Project (FYP), Nanyang Technological University, Singapore. https://hdl.handle.net/10356/176770
Project: A3205-231 
Abstract: Graph Neural Networks (GNNs) are impressive models that have been highly successful in performing graphical analysis and learning. However, GNNs are known to be outstanding in learning from homophilic graphs but are subpar in learning from heterophilic graphs. On the other hand, Gradient Boosted Decision Trees (GBDTs) have become the best-performing model in dealing with heterogeneous tabular data. But will GBDTs retain that superiority when working with heterophilic graphs? This project proposes an alternative model to learn from heterophilic graphs, combining both GNNs and GBDTs. GBDTs will only focus on training the node features of the heterophilic graphs, passing the refined node features to the GNN to improve on the graph structure. After experimentation and comparison with GNN models, Graph Convolutional Network (GCN) in the case of this project, the proposed alternative model has shown a reasonable increase in performance in learning from heterophilic graphs.
URI: https://hdl.handle.net/10356/176770
Schools: School of Electrical and Electronic Engineering 
Fulltext Permission: restricted
Fulltext Availability: With Fulltext
Appears in Collections:EEE Student Reports (FYP/IA/PA/PI)

Files in This Item:
File Description SizeFormat 
ACTUAL FYP FINAL REPORT.pdf
  Restricted Access
1.78 MBAdobe PDFView/Open

Page view(s)

91
Updated on May 5, 2025

Download(s)

4
Updated on May 5, 2025

Google ScholarTM

Check

Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.