Please use this identifier to cite or link to this item:
https://hdl.handle.net/10356/139448
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Ew, Jo Ee | en_US |
dc.date.accessioned | 2020-05-19T08:51:36Z | - |
dc.date.available | 2020-05-19T08:51:36Z | - |
dc.date.issued | 2020 | - |
dc.identifier.uri | https://hdl.handle.net/10356/139448 | - |
dc.description.abstract | Graph Neural Networks (GNNs) show impressive performance in link-prediction analysis and node classification problems as compared to other neural network approaches. In this paper, the geometric and topological structures of various kinds of node embedding GNNs such as basic GNN, Graph Convolutional Network (GCN), Graph SAmple and aggreGatE (Graph SAGE), and Gated GNN are investigated. Interpretation and comparison between these models are made to provide better comprehension. Sub-graph embedding which is a relatively recent approach is also mentioned in the paper. In particular, two GCN models, i.e. Decagon and convolution spatial graph embedding network (C-SGEN), are studied. In order to enhance the models mentioned, some future works are suggested. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Nanyang Technological University | en_US |
dc.subject | Science::Mathematics::Geometry | en_US |
dc.subject | Science::Mathematics::Topology | en_US |
dc.title | Geometric and topological representations in graph neural networks | en_US |
dc.type | Final Year Project (FYP) | en_US |
dc.contributor.supervisor | Xia Kelin | en_US |
dc.contributor.school | School of Physical and Mathematical Sciences | en_US |
dc.description.degree | Bachelor of Science in Mathematical Sciences | en_US |
dc.contributor.supervisoremail | xiakelin@ntu.edu.sg | en_US |
item.grantfulltext | restricted | - |
item.fulltext | With Fulltext | - |
Appears in Collections: | SPMS Student Reports (FYP/IA/PA/PI) |
Page view(s)
241
Updated on Jun 28, 2022
Download(s) 50
58
Updated on Jun 28, 2022
Google ScholarTM
Check
Items in DR-NTU are protected by copyright, with all rights reserved, unless otherwise indicated.