This thesis covers a variety of machine learning and deep learning methods for density estimation, sparse network estimation, and sample generation using Generative Adversarial Network (GAN), in complex and various types of biomedical data. While the ...
This thesis covers a variety of machine learning and deep learning methods for density estimation, sparse network estimation, and sample generation using Generative Adversarial Network (GAN), in complex and various types of biomedical data. While the density estimation is an essential task for the statistical learning process, the density estimation of multivariate categorical data that have many categorical options for each variable is not straightforward due to the relative sparsity in sample distributions, also known as the curse of dimensionality problem. To solve such a problem, a Bayesian approach that introduces an adaptive partitioning process is proposed in this thesis. In addition, a sparse network estimation method using penalized regression methods are proposed and evaluated with extensive simulations. A two-stage approach using the penalized regressions estimates the skeleton of Directed Acyclic Graphs (DAGs) in the first stage, then finds the directions of the edges. Since various methods can be used for both stages, the methods are compared and assessed in this thesis. Using the sparse network estimation methods, a survival associated gene network estimation method and a survival risk estimation method with the gene network are also proposed. The proposed methods are evaluated with various cancer genome datasets. Furthermore, GAN, a deep learning framework for sample synthesis, and its variants are addressed. Since an ordinary GAN has a limitation that one cannot generated desired samples, the proposed model, called Controllable GAN (ControlGAN), introduces an independent classifier to solve the problem. Evaluated by Inception score, ControlGAN demonstrates superior performance compared to the other conditional variants of GAN.