Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/63425
Title: Combination forecasts based on markov chain monte carlo estimation of the mode
Authors: Pang, WK
Wong, H 
Chan, CK 
Troutt, MD
Issue Date: 2003
Publisher: Idea Group Publishing
Source: In PC Pendharkar (Ed.), Managing data mining technologies in organizations : techniques and applications, p. 219-238. Hershey, PA: Idea Group Publishing, 2003 How to cite?
Abstract: This chapter proposes an approach to the combination of forecasts from a new perspective and uses a new estimation methodology. Concepts from optimization and statistics are combined in order to cast the problem as one of estimating the minimizer of a loss function, which is assumed to be not explicitly known. Using weak assumptions on the unknown loss function, and on the performance distribution of the experts, a density for the expert estimates may be derived. Sufficient conditions are then obtained for reducing the problem to that of statistical mode estimation. By regarding individual forecasts as expert estimates of the minimizer of the decision maker's loss function, the mode of these forecasts becomes a combination forecast. Using the Bayesian approach and the Markov chain Monte Carlo method, an empirical distribution corresponding to the predictive density of the expert estimates can be constructed. Hence the mode can be estimated and a probability interval for the forecast value can also be obtained. The probability interval associated with a combination forecast has not previously been studied in the literature. Thus, the construction of the probability interval is a new contribution. Simulation studies as well as an empirical example are presented to illustrate our method.
URI: http://hdl.handle.net/10397/63425
ISBN: 1-59140-057-0
Appears in Collections:Book Chapter

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

18
Last Week
2
Last month
Checked on Jul 10, 2017

Google ScholarTM

Check



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.