no code implementations • 25 Oct 2023 • See Hian Lee, Feng Ji, Kelin Xia, Wee Peng Tay
Traditionally, graph neural networks have been trained using a single observed graph.
1 code implementation • 29 Apr 2023 • Feng Ji, See Hian Lee, Hanyang Meng, Kai Zhao, Jielong Yang, Wee Peng Tay
We introduce the key notion of label non-uniformity, which is derived from the Wasserstein distance between the softmax distribution of the logits and the uniform distribution.
no code implementations • 7 Apr 2023 • Feng Ji, See Hian Lee, Kai Zhao, Wee Peng Tay, Jielong Yang
In graph neural networks (GNNs), both node features and labels are examples of graph signals, a key notion in graph signal processing (GSP).
no code implementations • 3 Mar 2023 • See Hian Lee, Feng Ji, Wee Peng Tay
However, a graph can have hyperbolic and Euclidean geometries at different regions of the graph.
no code implementations • 28 Sep 2022 • Feng Ji, See Hian Lee, Wee Peng Tay
In graph signal processing, one of the most important subjects is the study of filters, i. e., linear transformations that capture relations between graph signals.
1 code implementation • 24 Jul 2022 • See Hian Lee, Feng Ji, Wee Peng Tay
In this paper, we present Simplicial Graph Attention Network (SGAT), a simplicial complex approach to represent such high-order interactions by placing features from non-target nodes on the simplices.
no code implementations • 29 Mar 2021 • See Hian Lee, Feng Ji, Wee Peng Tay
A heterogeneous graph consists of different vertices and edges types.