Open Access. Powered by Scholars. Published by Universities.®
Databases and Information Systems Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 5 of 5
Full-Text Articles in Databases and Information Systems
Topic-Aware Heterogeneous Graph Neural Network For Link Prediction, Siyong Xu, Cheng Yang, Yuan Fang, Yuan Fang, Yang Tianchi, Luhao Zhang
Topic-Aware Heterogeneous Graph Neural Network For Link Prediction, Siyong Xu, Cheng Yang, Yuan Fang, Yuan Fang, Yang Tianchi, Luhao Zhang
Research Collection School Of Computing and Information Systems
Heterogeneous graphs (HGs), consisting of multiple types of nodes and links, can characterize a variety of real-world complex systems. Recently, heterogeneous graph neural networks (HGNNs), as a powerful graph embedding method to aggregate heterogeneous structure and attribute information, has earned a lot of attention. Despite the ability of HGNNs in capturing rich semantics which reveal different aspects of nodes, they still stay at a coarse-grained level which simply exploits structural characteristics. In fact, rich unstructured text content of nodes also carries latent but more fine-grained semantics arising from multi-facet topic-aware factors, which fundamentally manifest why nodes of different types would …
Node-Wise Localization Of Graph Neural Networks, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C.H. Hoi
Node-Wise Localization Of Graph Neural Networks, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C.H. Hoi
Research Collection School Of Computing and Information Systems
Graph neural networks (GNNs) emerge as a powerful family of representation learning models on graphs. To derive node representations, they utilize a global model that recursively aggregates information from the neighboring nodes. However, different nodes reside at different parts of the graph in different local contexts, making their distributions vary across the graph. Ideally, how a node receives its neighborhood information should be a function of its local context, to diverge from the global GNN model shared by all nodes. To utilize node locality without overfitting, we propose a node-wise localization of GNNs by accounting for both global and local …
Meta-Inductive Node Classification Across Graphs, Zhihao Wen, Yuan Fang, Zemin Liu
Meta-Inductive Node Classification Across Graphs, Zhihao Wen, Yuan Fang, Zemin Liu
Research Collection School Of Computing and Information Systems
Semi-supervised node classification on graphs is an important research problem, with many real-world applications in information retrieval such as content classification on a social network and query intent classification on an e-commerce query graph. While traditional approaches are largely transductive, recent graph neural networks (GNNs) integrate node features with network structures, thus enabling inductive node classification models that can be applied to new nodes or even new graphs in the same feature space. However, inter-graph differences still exist across graphs within the same domain. Thus, training just one global model (e.g., a state-of-the-art GNN) to handle all new graphs, whilst …
Learning To Pre-Train Graph Neural Networks, Yuanfu Lu, Xunqiang Jiang, Yuan Fang, Chuan Shi
Learning To Pre-Train Graph Neural Networks, Yuanfu Lu, Xunqiang Jiang, Yuan Fang, Chuan Shi
Research Collection School Of Computing and Information Systems
Graph neural networks (GNNs) have become the de facto standard for representation learning on graphs, which derive effective node representations by recursively aggregating information from graph neighborhoods. While GNNs can be trained from scratch, pre-training GNNs to learn transferable knowledge for downstream tasks has recently been demonstrated to improve the state of the art. However, conventional GNN pre-training methods follow a two-step paradigm: 1) pre-training on abundant unlabeled data and 2) fine-tuning on downstream labeled data, between which there exists a significant gap due to the divergence of optimization objectives in the two steps. In this paper, we conduct an …
Relative And Absolute Location Embedding For Few-Shot Node Classification On Graph, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C. H. Hoi
Relative And Absolute Location Embedding For Few-Shot Node Classification On Graph, Zemin Liu, Yuan Fang, Chenghao Liu, Steven C. H. Hoi
Research Collection School Of Computing and Information Systems
Node classification is an important problem on graphs. While recent advances in graph neural networks achieve promising performance, they require abundant labeled nodes for training. However, in many practical scenarios there often exist novel classes in which only one or a few labeled nodes are available as supervision, known as few-shot node classification. Although meta-learning has been widely used in vision and language domains to address few-shot learning, its adoption on graphs has been limited. In particular, graph nodes in a few-shot task are not independent and relate to each other. To deal with this, we propose a novel model …