Bayesian solutions to high-dimensional data challenges using hybrid search
dc.contributor.author | Jin, Shiqiang | |
dc.date.accessioned | 2021-02-10T18:16:41Z | |
dc.date.available | 2021-02-10T18:16:41Z | |
dc.date.graduationmonth | May | |
dc.date.issued | 2021-05-01 | |
dc.description.abstract | In the era of Big Data, variable selection with high-dimensional data has drawn increasing attention. With a large number of predictors, there rises a big challenge for model fitting and prediction. In this dissertation, we propose three different yet interconnected methodologies, which include theory, computation, and real applications for various scenarios of regression analysis. The primary goal in this dissertation is to develop powerful Bayesian solutions to high-dimensional data challenges using a new variable selection strategy, called hybrid search. To effectively reduce computation costs in high-dimensional data analysis, we propose novel computational strategies that can quickly evaluate a large number of marginal likelihoods simultaneously within a single computation. In Chapter 1, we discuss background and current challenges in high-dimensional variable selection. The motivation of our study is also justified. In Chapter 2, we introduce a new Bayesian method of best subset selection in the context of linear regression. The proposed method rapidly finds the best subset via a hybrid search algorithm that combines deterministic local search and stochastic global search. In Chapter 3, on the basis of the approach in Chapter 2, we extend it to a framework of multivariate linear regression model, which analyzes the relationship between multiple response variables and a common set of predictors. In Chapter 4, we propose a general Bayesian method to perform high-dimensional variable selection for various data types, such as binary, count, continuous and time-to-event (survival) data. Using Bayesian approximation techniques, we develop a general computing strategy that enables us to assess the marginal likelihoods of many candidate models within a single computation. In addition, to accelerate the convergence, we employ a hybrid search algorithm that can quickly explore the model spaces and accurately obtain the global maximum of marginal posterior probabilities. | |
dc.description.advisor | Gyuhyeong Goh | |
dc.description.degree | Doctor of Philosophy | |
dc.description.department | Department of Statistics | |
dc.description.level | Doctoral | |
dc.identifier.uri | https://hdl.handle.net/2097/41018 | |
dc.language.iso | en_US | |
dc.publisher | Kansas State University | |
dc.rights | © the author. This Item is protected by copyright and/or related rights. You are free to use this Item in any way that is permitted by the copyright and related rights legislation that applies to your use. For other uses you need to obtain permission from the rights-holder(s). | |
dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | |
dc.subject | Bayesian variable selection | |
dc.subject | High-dimensional regression analysis | |
dc.subject | Best subset selection | |
dc.subject | Hybrid search algorithm | |
dc.subject | Multivariate regression analysis | |
dc.subject | Laplace approximation | |
dc.title | Bayesian solutions to high-dimensional data challenges using hybrid search | |
dc.type | Dissertation |