TY - GEN
T1 - Multi-Grained Semantics-Aware Graph Neural Networks (Extended abstract)
AU - Zhong, Zhiqiang
AU - Li, Cheng Te
AU - Pang, Jun
N1 - Publisher Copyright:
© 2024 IEEE.
PY - 2024
Y1 - 2024
N2 - Graph Neural Networks (GNNs) are powerful techniques in representation learning for graphs and have been increasingly deployed in a multitude of different applications that involve node-and graph-wise tasks. Most existing studies solve either the node-wise task or the graph-wise task independently while they are inherently correlated. This work proposes a unified model, AdamGNN, to interactively learn node and graph representations in a mutual-optimisation manner. Compared with existing GNN models and graph pooling methods, AdamGNN enhances the node representation with the learned multi-grained semantics and avoids losing node features and graph structure information during pooling. Experiments on 14 real-world graph datasets show that AdamGNN can significantly outperform 17 competing models on both node-and graph-wise tasks. The ablation studies confirm the effectiveness of AdamGNN's components, and the last empirical analysis further reveals the ingenious ability of AdamGNN in capturing long-range interactions. This work was published at IEEE TKDE11Full paper is available at https://ieeexplore.ieee.org/document/9844866/.
AB - Graph Neural Networks (GNNs) are powerful techniques in representation learning for graphs and have been increasingly deployed in a multitude of different applications that involve node-and graph-wise tasks. Most existing studies solve either the node-wise task or the graph-wise task independently while they are inherently correlated. This work proposes a unified model, AdamGNN, to interactively learn node and graph representations in a mutual-optimisation manner. Compared with existing GNN models and graph pooling methods, AdamGNN enhances the node representation with the learned multi-grained semantics and avoids losing node features and graph structure information during pooling. Experiments on 14 real-world graph datasets show that AdamGNN can significantly outperform 17 competing models on both node-and graph-wise tasks. The ablation studies confirm the effectiveness of AdamGNN's components, and the last empirical analysis further reveals the ingenious ability of AdamGNN in capturing long-range interactions. This work was published at IEEE TKDE11Full paper is available at https://ieeexplore.ieee.org/document/9844866/.
UR - http://www.scopus.com/inward/record.url?scp=85200435625&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85200435625&partnerID=8YFLogxK
U2 - 10.1109/ICDE60146.2024.00477
DO - 10.1109/ICDE60146.2024.00477
M3 - Conference contribution
AN - SCOPUS:85200435625
T3 - Proceedings - International Conference on Data Engineering
SP - 5691
EP - 5692
BT - Proceedings - 2024 IEEE 40th International Conference on Data Engineering, ICDE 2024
PB - IEEE Computer Society
T2 - 40th IEEE International Conference on Data Engineering, ICDE 2024
Y2 - 13 May 2024 through 17 May 2024
ER -