New data-driven approaches to improve probabilistic model structure learning

To learn the network structures used in probabilistic models (e.g., Bayesian network), many researchers proposed structure learning algorithms to extract the network structure from data. However, structure learning is a challenging problem due to the extremely large number of possible structure cand...

全面介紹

Saved in:
書目詳細資料
主要作者: Zhao, Jianjun
其他作者: Pan Jialin, Sinno
格式: Theses and Dissertations
語言:English
出版: 2019
主題:
在線閱讀:https://hdl.handle.net/10356/84123
http://hdl.handle.net/10220/50443
標簽: 添加標簽
沒有標簽, 成為第一個標記此記錄!
機構: Nanyang Technological University
語言: English
id sg-ntu-dr.10356-84123
record_format dspace
spelling sg-ntu-dr.10356-841232020-10-28T08:40:48Z New data-driven approaches to improve probabilistic model structure learning Zhao, Jianjun Pan Jialin, Sinno School of Computer Science and Engineering A*STAR (SINGA) Centre for Computational Intelligence Science::Mathematics::Statistics Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence To learn the network structures used in probabilistic models (e.g., Bayesian network), many researchers proposed structure learning algorithms to extract the network structure from data. However, structure learning is a challenging problem due to the extremely large number of possible structure candidates. One challenge relates to structure learning in Bayesian network is the conflicts among local structures obtained from the local structure learning algorithms. This is the so-called symmetry correction problem. Another challenge is the V-structure selection problem, which is related to the determination of edge orientation in Bayesian network. In this thesis, we investigate the above two challenges in structure learning and propose novel data-driven approaches to overcome these challenges when building a Bayesian network. First, two new data-driven symmetry correction methods are developed to learn an undirected graph of Bayesian network. The proposed methods outperform the existing heuristic rule. Second, a weighted maximum satisfiability (MAX-SAT) problem is formulated to solve the V-structures selection problem. The weights are learned from data to quantify the strength of the V-structures. Our proposed solution outperforms existing methods. Besides, we investigate how transfer learning can be used for structure learning with limited training examples and a source structure. In particular, we propose a transfer learning approach to learn the structure of a Sum-Product Network (SPN) which can be converted to a Bayesian network under certain conditions. Our novel approach allows one to construct the target SPN with limited training examples, given an existing source SPN from a similar domain. Doctor of Philosophy 2019-11-19T12:07:54Z 2019-12-06T15:38:48Z 2019-11-19T12:07:54Z 2019-12-06T15:38:48Z 2019 Thesis Zhao, J. (2019). New data-driven approaches to improve probabilistic model structure learning. Doctoral thesis, Nanyang Technological University, Singapore. https://hdl.handle.net/10356/84123 http://hdl.handle.net/10220/50443 10.32657/10356/84123 en 125 p. application/pdf
institution Nanyang Technological University
building NTU Library
continent Asia
country Singapore
Singapore
content_provider NTU Library
collection DR-NTU
language English
topic Science::Mathematics::Statistics
Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
spellingShingle Science::Mathematics::Statistics
Engineering::Computer science and engineering::Computing methodologies::Artificial intelligence
Zhao, Jianjun
New data-driven approaches to improve probabilistic model structure learning
description To learn the network structures used in probabilistic models (e.g., Bayesian network), many researchers proposed structure learning algorithms to extract the network structure from data. However, structure learning is a challenging problem due to the extremely large number of possible structure candidates. One challenge relates to structure learning in Bayesian network is the conflicts among local structures obtained from the local structure learning algorithms. This is the so-called symmetry correction problem. Another challenge is the V-structure selection problem, which is related to the determination of edge orientation in Bayesian network. In this thesis, we investigate the above two challenges in structure learning and propose novel data-driven approaches to overcome these challenges when building a Bayesian network. First, two new data-driven symmetry correction methods are developed to learn an undirected graph of Bayesian network. The proposed methods outperform the existing heuristic rule. Second, a weighted maximum satisfiability (MAX-SAT) problem is formulated to solve the V-structures selection problem. The weights are learned from data to quantify the strength of the V-structures. Our proposed solution outperforms existing methods. Besides, we investigate how transfer learning can be used for structure learning with limited training examples and a source structure. In particular, we propose a transfer learning approach to learn the structure of a Sum-Product Network (SPN) which can be converted to a Bayesian network under certain conditions. Our novel approach allows one to construct the target SPN with limited training examples, given an existing source SPN from a similar domain.
author2 Pan Jialin, Sinno
author_facet Pan Jialin, Sinno
Zhao, Jianjun
format Theses and Dissertations
author Zhao, Jianjun
author_sort Zhao, Jianjun
title New data-driven approaches to improve probabilistic model structure learning
title_short New data-driven approaches to improve probabilistic model structure learning
title_full New data-driven approaches to improve probabilistic model structure learning
title_fullStr New data-driven approaches to improve probabilistic model structure learning
title_full_unstemmed New data-driven approaches to improve probabilistic model structure learning
title_sort new data-driven approaches to improve probabilistic model structure learning
publishDate 2019
url https://hdl.handle.net/10356/84123
http://hdl.handle.net/10220/50443
_version_ 1683494232159944704