Publications

Detailed Information

DEEP LEARNING ON GRAPHS : 그래프 심층학습

DC Field Value Language
dc.contributor.advisor윤성로-
dc.contributor.author이재구-
dc.date.accessioned2018-05-28T16:21:22Z-
dc.date.available2018-05-28T16:21:22Z-
dc.date.issued2018-02-
dc.identifier.other000000149865-
dc.identifier.urihttps://hdl.handle.net/10371/140673-
dc.description학위논문 (박사)-- 서울대학교 대학원 : 공과대학 전기·컴퓨터공학부, 2018. 2. 윤성로.-
dc.description.abstractIn this dissertation, deep learning on graph is proposed theoretically and experimentally as a new research approach that applies machine learning, deep learning in particular, on complex and dynamic relational data that can be expressed properly by a graph. Social network services that are closely related to our lives, such as Facebook, and organisms that comprise numerous proteins with various structures, indicate the importance of graph representation and its analysis, including not only individual entity information but also comprehensive structural information among entity relationships.
Unlike traditional data representation and its analysis, graph-based representation and analysis that include intrinsic geometric information will be able to facilitate further analysis through an interdisciplinary approach with deep learning, which has recently achieved remarkable results in various fields. This new approach also provides research diversity, assisting in the ultimate goal of achieving true artificial intelligence. Along these lines, proposed new approaches of machine learning to extract data-driven features more effectively and to discover new facts from complex and dynamic relational data.
Throughout this dissertation, four approaches to apply machine learning are presented, specifically deep learning to graphs, spatial learning, spatial-temporal learning, and efficient learning and sampling. These approaches are described in detail in their corresponding chapters. First, a spatial learning approach is proposed to quantitatively extract the structural features of a graph and measure the similarity between graphs. The spatial learning approach is extended to a spatial-temporal learning approach that learns and predicts not only the data-driven structural features but also the dynamically changing features of graphs through deep learning. In order to improve the graph learning approaches described above, an efficiency learning approach attempts to advance deep learning for graphs by incorporating a transfer learning and sampling approach that identifies the possibility of efficient learning for large scale data having graph representation.
The proposed deep learning on graph provides a comprehensive data analysis tool that is differentiated from existing data representation and analysis methods, and is validated through experimental results. It also embraces diversity of research by expanding the leverage of deep learning, which has produced remarkable results in various fields such as image, speech, and text, and is potentially of value in other unexplored domains.
-
dc.description.tableofcontents1 INTRODUCTION 1
2 BACKGROUND 8
2.1 Graph Representation and its Analysis 8
2.1.1 Graph Similarity Measure 8
2.1.2 Random Walk-based Analysis 10
2.1.3 Graph Sampling 12
2.1.4 Matrix Computations 14
2.2 Learning Method 16
2.2.1 Machine Learning and Deep Learning 16
2.2.2 Learning on Graph 17
2.2.3 Spatio-Temporal Learning 18
3 SPATIAL LEARNING APPROACH 19
3.1 Motivation 19
3.2 Method 21
3.2.1 Representing Graph DataSet 24
3.2.2 Union Graph 24
3.2.3 Reordering Nodes 24
3.2.4 Forming Matrix P0 for RWR 26
3.2.5 Calculating RWR Matrix by Schur Complement 27
3.2.6 Calculating Matrix Distance and Similarity Score 28
3.3 Experiments 28
3.4 Discussions 32
3.5 Summary 33
4 SPATIAL-TEMPORAL LEARNING APPROACH 35
4.1 Motivation 35
4.2 Method 38
4.2.1 Problem Statement 38
4.2.2 Step 1: Extracting Spatial Features (Graph Embedding) 39
4.2.3 Step 2: Learning Temporal Features 41
4.2.4 Executing Personalized RWR 43
4.3 Experiments and Discussion 44
4.4 Summary 46
5 EFFICIENT LEARNING APPROACH 48
5.1 Motivation 48
5.2 Method 51
5.2.1 Step A: Graph Production 52
5.2.2 Step B: Representation of Graphs in Spectral Domain 52
5.2.3 Step C: Applying Convolutional Networks to Graphs 55
5.2.4 Step D: Learning Transferable Features 55
5.2.5 Step E: Transfer Learning in Spectral Domain 55
5.3 Results and Discussion 56
5.4 Summary 62
6 SAMPLING APPROACH 63
6.1 Motivation 63
6.2 Our Graph Sampling Approach 67
6.2.1 Random-walk-based Sampling 68
6.3 Method 69
6.3.1 Details of Graph Sampling Agent 71
6.4 Experimental Evaluation 78
6.4.1 Evaluation Methodology 78
6.4.2 Simulation Results 80
6.5 Discussion 84
6.6 Summary 89
7 CONCLUSION 90
Bibliography 92
Abstract (In Korean) 105
-
dc.formatapplication/pdf-
dc.format.extent13821611 bytes-
dc.format.mediumapplication/pdf-
dc.language.isoen-
dc.publisher서울대학교 대학원-
dc.subjectMachine Learning-
dc.subjectDeep Learning-
dc.subjectArtificial Intelligence-
dc.subjectData Mining-
dc.subjectGraph-
dc.subjectNetwork-
dc.subject.ddc621.3-
dc.titleDEEP LEARNING ON GRAPHS-
dc.title.alternative그래프 심층학습-
dc.typeThesis-
dc.description.degreeDoctor-
dc.contributor.affiliation공과대학 전기·컴퓨터공학부-
dc.date.awarded2018-02-
Appears in Collections:
Files in This Item:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share