Machine Learning based Graph Enhancement by Complementation, Fusion, and Transferring
DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | 신현정 | - |
dc.contributor.author | 남용현 | - |
dc.date.accessioned | 2019-08-13T16:41:20Z | - |
dc.date.available | 2019-08-13T16:41:20Z | - |
dc.date.issued | 2019-08 | - |
dc.identifier.other | 29319 | - |
dc.identifier.uri | https://dspace.ajou.ac.kr/handle/2018.oak/15584 | - |
dc.description | 학위논문(박사)--아주대학교 일반대학원 :산업공학과,2019. 8 | - |
dc.description.tableofcontents | 1. Introduction 2. Fundamentals: Biomedical Graph 2.1. Disease Network 2.2. Drug Target-Protein Network 2.3. Gene Network 3.Fundamentals: Graph-based Semi-Supervised Learning 3.1. Semi-Supervised Classification 3.2. Semi-Supervised Scoring 4. Edge Complementation 4.1. Complementation algorithm 4.2. Experiment I: Disease Network 4.3. Experiment II: Drug Network 5. Partial Graph Fusion 5.1. Graph Fusion with useful partial graphs 5.2. Semi-Supervised Scoring with integrated graph 5.3. Experiment: Gene Network 6. Label Transferring 6.1. Pseudo-label propagation with graph abstraction 6.2. Experiment: Benchmark dataset 7. Conclusion References | - |
dc.language.iso | eng | - |
dc.publisher | The Graduate School, Ajou University | - |
dc.rights | 아주대학교 논문은 저작권에 의해 보호받습니다. | - |
dc.title | Machine Learning based Graph Enhancement by Complementation, Fusion, and Transferring | - |
dc.title.alternative | Yonghyun Nam | - |
dc.type | Thesis | - |
dc.contributor.affiliation | 아주대학교 일반대학원 | - |
dc.contributor.alternativeName | Yonghyun Nam | - |
dc.contributor.department | 일반대학원 산업공학과 | - |
dc.date.awarded | 2019. 8 | - |
dc.description.degree | Doctoral | - |
dc.identifier.localId | 951950 | - |
dc.identifier.uci | I804:41038-000000029319 | - |
dc.identifier.url | http://dcoll.ajou.ac.kr:9080/dcollection/common/orgView/000000029319 | - |
dc.description.alternativeAbstract | When data is expressed in a graph which consists of nodes and edges, there is an advantage that a relationship of data can be visually expressed. With a graph, machine learning can perform the prediction tasks. However, most of the real world data is sparse, and the number of labeled data is very small. In this case, machine learning cannot provide sufficient inference. In order to make prediction performance better in machine learning using graph, the graph should contain a lot of information (dense graph), or a lot of label information. To motivate this, we propose a graph enhancement learning. It consists of three algorithm; (1) edge complementation, (2) partial graph fusion, and (3) label transferring. Edge complementation is incremental learning to enhance disconnected edges in a sparse graph. Partial graph fusion is one of graph integration method. Combinations of many partial graphs help prediction tasks. To circumvent deficiency of lack of labeled data, we propose label transferring algorithms which generate pseudo-labels. The graph enhancement learning was applied to the biomedical graph. The edges of the disease network were complemented to find co-occurrence disease. In addition, the edge of the drug network was complemented to find the candidate drug. Gene networks combined with partial gene networks to identify key target genes for immune disease. To circumvent deficiency of lack of labeled data, we propose label transferring algorithms which generate pseudo-labels. And it is applied five benchmark dataset. When edges are not enough or labeled data is insufficient, the prediction performance of machine learning can be improved through graph enhancement learning. | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.