Linkage Based Dirichlet Processes
| dc.contributor.author | Song, Yuhyun | en |
| dc.contributor.committeechair | Leman, Scotland C. | en |
| dc.contributor.committeemember | Terrell, George R. | en |
| dc.contributor.committeemember | House, Leanna L. | en |
| dc.contributor.committeemember | Kim, Inyoung | en |
| dc.contributor.department | Statistics | en |
| dc.date.accessioned | 2017-02-09T09:00:29Z | en |
| dc.date.available | 2017-02-09T09:00:29Z | en |
| dc.date.issued | 2017-02-08 | en |
| dc.description.abstract | We live in the era of textit{Big Data} with significantly richer computational resources than the last two decades. The concurrence of computation resources and a large volume of data has boosted researchers' desire for developing feasible Markov Chain Monte Carlo (MCMC) algorithms for large parameter spaces. Dirichlet Process Mixture Models (DPMMs) have become a Bayesian mainstay for modeling heterogeneous structures, namely clusters, especially when the quantity of clusters is not known with the established MCMC methods. As opposed to many ad-hoc clustering methods, using Dirichlet Processes (DPs) in models provide a flexible and probabilistic approach for automatically estimating both cluster structure and quantity. While DPs are not fully parameterized, they depend on both a base measure and a concentration parameter that can heavily impact inferences. Determining the concentration parameter is critical and essential, since it adjusts the a-priori cluster expectation, but typical approaches for specifying this parameter are rather cavalier. In this work, we propose a new method for automatically and adaptively determining this parameter, which directly calibrates distances between clusters through an explicit link function within the DP. Furthermore, we extend our method to mixture models with Nested Dirichlet Processes (NDPs) that cluster the multilevel data and depend on the specification of a vector of concentration parameters. In this work, we detail how to incorporate our method in Markov chain Monte Carlo algorithms, and illustrate our findings through a series of comparative simulation studies and applications. | en |
| dc.description.degree | Ph. D. | en |
| dc.format.medium | ETD | en |
| dc.identifier.other | vt_gsexam:9752 | en |
| dc.identifier.uri | http://hdl.handle.net/10919/74970 | en |
| dc.publisher | Virginia Tech | en |
| dc.rights | In Copyright | en |
| dc.rights.uri | http://rightsstatements.org/vocab/InC/1.0/ | en |
| dc.subject | concentration parameter | en |
| dc.subject | Dirichlet processes | en |
| dc.subject | nested Dirichlet processes | en |
| dc.title | Linkage Based Dirichlet Processes | en |
| dc.type | Dissertation | en |
| thesis.degree.discipline | Statistics | en |
| thesis.degree.grantor | Virginia Polytechnic Institute and State University | en |
| thesis.degree.level | doctoral | en |
| thesis.degree.name | Ph. D. | en |
Files
Original bundle
1 - 1 of 1