Bayesian CART Model Search

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hierarchical priors for Bayesian CART shrinkage

The Bayesian CART (classiication and regression tree) approach proposed by Chipman, George and McCulloch (1998) entails putting a prior distribution on the set of all CART models and then using stochastic search to select a model. The main thrust of this paper is to propose a new class of hierarchical priors which enhance the potential of this Bayesian approach. These priors indicate a preferen...

متن کامل

Bayesian CART – Prior Specification and Posterior Simulation –

We present advances in Bayesian modeling and computation for CART (classification and regression tree) models. The modeling innovations include a formal prior distributional structure for tree generation – the pinball prior – that allows for the combination of an explicit specification of a distribution for both the tree size and the tree shape. The core computational innovations involve a nove...

متن کامل

Bayesian Stochastic Search for VAR Model Restrictions

We propose a Bayesian stochastic search approach to selecting restrictions for Vector Autoregressive (VAR) models. For this purpose, we develop a Markov Chain Monte Carlo (MCMC) algorithm that visits high posterior probability restrictions on the elements of both the VAR regression coefficients and the error variance matrix. Numerical simulations show that stochastic search based on this algori...

متن کامل

Bayesian stochastic model specification search for seasonal and calendar effects

We apply a recent methodology, Bayesian stochastic model specification search (SMSS), for the selection of the unobserved components (level, slope, seasonal cycles, trading days effects) that are stochastically evolving over time. SMSS hinges on two basic ingredients: the non-centered representation of the unobserved components and the reparameterization of the hyperparameters representing stan...

متن کامل

A Bayesian model for efficient visual search and recognition

Humans employ interacting bottom-up and top-down processes to significantly speed up search and recognition of particular targets. We describe a new model of attention guidance for efficient and scalable first-stage search and recognition with many objects (117,174 images of 1147 objects were tested, and 40 satellite images). Performance for recognition is on par or better than SIFT and HMAX, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the American Statistical Association

سال: 1998

ISSN: 0162-1459,1537-274X

DOI: 10.1080/01621459.1998.10473750