DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Kim, Myoung Ho | - |
dc.contributor.advisor | 김명호 | - |
dc.contributor.author | Ahn, Seongjin | - |
dc.date.accessioned | 2022-04-27T19:31:53Z | - |
dc.date.available | 2022-04-27T19:31:53Z | - |
dc.date.issued | 2021 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=948456&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/296102 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전산학부, 2021.2,[iv, 31 p. :] | - |
dc.description.abstract | Link prediction is to predict whether there is a link between two nodes in a network. Graph Convolutional Networks have outperformed existing works in many graph analysis tasks. Most previous methods propagate neighbor nodes without normalization for graph convolutions. This makes optimization during the learning process tends to be more affected by the norms of embedding vectors while treat directions of embedding vectors lightly. In this paper, we devised a novel graph convolutional network to which the normalization technique was applied to prevent the result from being biased against the size of the norm of the embedding vector during link prediction. To leverage the information of higher-order relationships for link prediction. We also propose a new communicability filter that can effectively reflect higher order information. Our proposed higher-order graph convolutional networks can perform link prediction more accurately. Through extensive experiments with various relational datasets, we show that the proposed methods outperforms the state-of-the-art link prediction methods on heterogeneous graphs as well as homogeneous graphs. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | link prediction▼agraph embedding▼agraph convolutional network▼ahigher-order graph convolutional network▼anormalization▼acommunicability filter | - |
dc.subject | 연결 관계 예측▼a그래프 임베딩▼a그래프 컨볼루션 네트워크▼a고차 그래프 컨볼루션 네트워크▼a정규화▼a의사소통성 필터 | - |
dc.title | Link prediction based on graph convolutional networks utilizing normalization and a communicability kernel | - |
dc.title.alternative | 정규화와 전달성 커널을 활용한 그래프 컨벌루션 네트워크 기반 링크 예측 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :전산학부, | - |
dc.contributor.alternativeauthor | 안성진 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.