Markov Chain Monte Carlo on optimal adaptive sampling selections

被引:0
|
作者
Chang-Tai Chao
机构
[1] National Cheng-Kung University,Department of Statistics, School of Management
来源
Environmental and Ecological Statistics | 2003年 / 10卷
关键词
Gibbs sampling; Markov chain Monte Carlo; adaptive sampling; model-based sampling; optimal design; multivariate lognormal distribution;
D O I
暂无
中图分类号
学科分类号
摘要
Under a Bayesian population model with a given prior distribution, the optimal sampling strategy with a fixed sample size n is an n-phase adaptive one. That is, the selection of the next sampling units should sequentially depend on the information obtained from the previously selected units, including the observed values of interest. Such an optimal strategy is in general not executable in practice due to its intensive computation. In many survey sampling situations, an important problem is that one would like to select a set of units in addition to a certain number of sampling units which have been observed. If the optimal strategy is an adaptive one, the selection of the additional units should take both the labels and the observed values of the already selected units into account. Hence, a simpler optimal two-phase adaptive sampling strategy under a Bayesian population model is proposed in this article for practical interest. A Markov chain Monte Carlo method is used to approximate the posterior joint distribution of the unobserved population units after the first phase sampling, for the optimal selection of the second phase sample. This approximation method is found to be successful to select the optimal second-phase sample. Finally, this optimal strategy is applied to a set of data from a study of geothermal CO2 emissions in Yellowstone National Park as a practical illustrative example.
引用
收藏
页码:129 / 151
页数:22
相关论文
共 50 条
  • [31] ON THE CONTAINMENT CONDITION FOR ADAPTIVE MARKOV CHAIN MONTE CARLO ALGORITHMS
    Bai, Yan
    Roberts, Gareth O.
    Rosenthal, Jeffrey S.
    ADVANCES AND APPLICATIONS IN STATISTICS, 2011, 21 (01) : 1 - 54
  • [32] An Adaptive Markov Chain Monte Carlo Method for GARCH Model
    Takaishi, Tetsuya
    COMPLEX SCIENCES, PT 2, 2009, 5 : 1424 - 1434
  • [33] Most Likely Optimal Subsampled Markov Chain Monte Carlo
    Hu, Guanyu
    Wang, Haiying
    JOURNAL OF SYSTEMS SCIENCE & COMPLEXITY, 2021, 34 (03) : 1121 - 1134
  • [34] CONVERGENCE OF ADAPTIVE AND INTERACTING MARKOV CHAIN MONTE CARLO ALGORITHMS
    Fort, G.
    Moulines, E.
    Priouret, P.
    ANNALS OF STATISTICS, 2011, 39 (06): : 3262 - 3289
  • [35] ENHANCED MIXTURE POPULATION MONTE CARLO VIA STOCHASTIC OPTIMIZATION AND MARKOV CHAIN MONTE CARLO SAMPLING
    El-Laham, Yousef
    Djuric, Petar M.
    Bugallo, Monica F.
    2020 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING, 2020, : 5475 - 5479
  • [36] Markov Chain Monte Carlo
    Henry, Ronnie
    EMERGING INFECTIOUS DISEASES, 2019, 25 (12) : 2298 - 2298
  • [37] Sampling from complicated and unknown distributions Monte Carlo and Markov Chain Monte Carlo methods for redistricting
    Cho, Wendy K. Tam
    Liu, Yan Y.
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2018, 506 : 170 - 178
  • [38] Bayesian penalized empirical likelihood and Markov Chain Monte Carlo sampling
    Chang, Jinyuan
    Tang, Cheng Yong
    Zhu, Yuanzheng
    JOURNAL OF THE ROYAL STATISTICAL SOCIETY SERIES B-STATISTICAL METHODOLOGY, 2025,
  • [39] Cool walking: A new Markov chain Monte Carlo sampling method
    Brown, S
    Head-Gordon, T
    JOURNAL OF COMPUTATIONAL CHEMISTRY, 2003, 24 (01) : 68 - 76
  • [40] Automated Parameter Blocking for Efficient Markov Chain Monte Carlo Sampling
    Turek, Daniel
    de Valpine, Perry
    Paciorek, Christopher J.
    Anderson-Bergman, Clifford
    BAYESIAN ANALYSIS, 2017, 12 (02): : 465 - 490