• Refine Query
  • Source
  • Publication year
  • to
  • Language
  • 197
  • 120
  • 72
  • 26
  • 16
  • 10
  • 10
  • 10
  • 7
  • 7
  • 4
  • 3
  • 2
  • 2
  • 2
  • Tagged with
  • 531
  • 97
  • 89
  • 73
  • 70
  • 65
  • 62
  • 59
  • 55
  • 53
  • 45
  • 41
  • 39
  • 37
  • 34
  • About
  • The Global ETD Search service is a free service for researchers to find electronic theses and dissertations. This service is provided by the Networked Digital Library of Theses and Dissertations.
    Our metadata is collected from universities around the world. If you manage a university/consortium/country archive and want to be added, details can be found on the NDLTD website.
331

A Latent Dirichlet Allocation/N-gram Composite Language Model

Kulhanek, Raymond Daniel 08 November 2013 (has links)
No description available.
332

An Invariant Embedding Approach to Domain Decomposition

Volzer, Joseph R. 12 June 2014 (has links)
No description available.
333

Transformations and Bayesian Estimation of Skewed and Heavy-Tailed Densities

Bean, Andrew Taylor January 2017 (has links)
No description available.
334

A Non-parametric Bayesian Method for Hierarchical Clustering of Longitudinal Data

Ren, Yan 23 October 2012 (has links)
No description available.
335

Approaches to Find the Functionally Related Experiments Based on Enrichment Scores: Infinite Mixture Model Based Cluster Analysis for Gene Expression Data

Li, Qian 18 October 2013 (has links)
No description available.
336

Bayesian Nonparametric Methods with Applications in Longitudinal, Heterogeneous and Spatiotemporal Data

Duan, Li 19 October 2015 (has links)
No description available.
337

Benchmark estimation for Markov Chain Monte Carlo samplers

Guha, Subharup 18 June 2004 (has links)
No description available.
338

Semi-parametric Bayesian Models Extending Weighted Least Squares

Wang, Zhen 31 August 2009 (has links)
No description available.
339

A Bayesian Semi-parametric Model for Realized Volatility

Feng, Tian 10 1900 (has links)
<p>Due to the advancements in computing power and the availability of high-frequency data, the analyses of the high frequency stock data and market microstructure has become more and more important in econometrics. In the high frequency data setting, volatility is a very important indicator on the movement of stock prices and measure of risk. It is a key input in pricing of assets, portfolio reallocation, and risk management. In this thesis, we use the Heterogeneous Autoregressive model of realized volatility, combined with Bayesian inference as well as Markov chain Monte Carlo method’s to estimate the innovation density of the daily realized volatility. A Dirichlet process is used as the prior in a countably infinite mixture model. The semi-parametric model provides a robust alternative to the models used in the literature. I find evidence of thick tails in the density of innovations to log-realized volatility.</p> / Master of Science (MSc)
340

Bayesian Modeling of Complex High-Dimensional Data

Huo, Shuning 07 December 2020 (has links)
With the rapid development of modern high-throughput technologies, scientists can now collect high-dimensional complex data in different forms, such as medical images, genomics measurements. However, acquisition of more data does not automatically lead to better knowledge discovery. One needs efficient and reliable analytical tools to extract useful information from complex datasets. The main objective of this dissertation is to develop innovative Bayesian methodologies to enable effective and efficient knowledge discovery from complex high-dimensional data. It contains two parts—the development of computationally efficient functional mixed models and the modeling of data heterogeneity via Dirichlet Diffusion Tree. The first part focuses on tackling the computational bottleneck in Bayesian functional mixed models. We propose a computational framework called variational functional mixed model (VFMM). This new method facilitates efficient data compression and high-performance computing in basis space. We also propose a new multiple testing procedure in basis space, which can be used to detect significant local regions. The effectiveness of the proposed model is demonstrated through two datasets, a mass spectrometry dataset in a cancer study and a neuroimaging dataset in an Alzheimer's disease study. The second part is about modeling data heterogeneity by using Dirichlet Diffusion Trees. We propose a Bayesian latent tree model that incorporates covariates of subjects to characterize the heterogeneity and uncover the latent tree structure underlying data. This innovative model may reveal the hierarchical evolution process through branch structures and estimate systematic differences between groups of samples. We demonstrate the effectiveness of the model through the simulation study and a brain tumor real data. / Doctor of Philosophy / With the rapid development of modern high-throughput technologies, scientists can now collect high-dimensional data in different forms, such as engineering signals, medical images, and genomics measurements. However, acquisition of such data does not automatically lead to efficient knowledge discovery. The main objective of this dissertation is to develop novel Bayesian methods to extract useful knowledge from complex high-dimensional data. It has two parts—the development of an ultra-fast functional mixed model and the modeling of data heterogeneity via Dirichlet Diffusion Trees. The first part focuses on developing approximate Bayesian methods in functional mixed models to estimate parameters and detect significant regions. Two datasets demonstrate the effectiveness of proposed method—a mass spectrometry dataset in a cancer study and a neuroimaging dataset in an Alzheimer's disease study. The second part focuses on modeling data heterogeneity via Dirichlet Diffusion Trees. The method helps uncover the underlying hierarchical tree structures and estimate systematic differences between the group of samples. We demonstrate the effectiveness of the method through the brain tumor imaging data.

Page generated in 0.2158 seconds