马尔可夫过程在医学干预措施成本效用分析中的应用

马尔可夫过程(Markov Process)是由一种状态转移至另一种状态的随机过程。本文探讨了医学干预措施成本效用分析中马尔可夫状态转移模型构建和模型参数的确定方法,并以全髋关节置换术为例,将具有吸收状态的离散马尔可夫过程应用于医学干预措施成本效用分析。结果表明,利用模型得出的预测结果与目前的医学认识和临床实际相符,提示应用离散马尔可夫过程预测医学干预措施成本效用是可行的。     

投入产出分析的不确定性模型及其预测

本在不确定性系统理论、不确定性数学的基础上，对投入产出分析中的部门之间的流量xij、总产值Xi、最终产品Yi、直接消耗系数矩阵A、完全消耗系数矩阵B给出了不确定性表达式，利用不确定性数学对投入产出模型进行了拓广，并通过实例说明了它的应用。     

基于先验信息的社会碳成本贝叶斯不确定性分析

针对气候变化及经济影响存在的巨大不确定性,研究了气候变化不确定性以及先验信息对社会碳成本的影响.在贝叶斯理论框架下,采用指数分布刻画气候变化的分布特征,假设尾部变化率是一个随机变量,给出其伽玛先验分布,推导了气候变化分布的贝叶斯先验预测分布.并分别基于指数分布以及帕累托先验预测分布计算了社会碳排放成本.模拟分析发现,在未融合先验信息的情况下,由于尾部概率很小,不管是否修正消费与气候变化之间的关系,截尾社会碳成本和未截尾社会碳成本几乎重合.然而,在利用贝叶斯方法融合先验信息的情况下,社会碳成本容易受到先验信息的影响.但是,通过修正消费与气候变化之间的关系后,发现社会碳成本受先验信息的影响比较少.     

治愈率模型在屏蔽数据可靠性分析中的应用研究

针对传统方法中的不足,在引入标准治愈率模型的基础上,提出在屏蔽数据可靠性分析中应用一种扩展的治愈率模型的建模方法;分析证明了利用该方法进行建模分析时仅需对模型作较少的前提假设,在信息不足的情况下能够识别出伴随变量对系统寿命分布的影响,进而有效提高模型估计的稳健性.通过运用基于Gibbs抽样的MCMC方法动态模拟出相关参数后验分布的马尔可夫链,给出随机截尾条件下模型参数的贝叶斯估计;实例分析的结果,证明了该模型在可靠性应用中的直观性与有效性.     

基于成本效用分析的电能替代实证研究

近年来的雾霾让人们逐渐意识到环境保护的重要性,国网公司基于我国“多煤、少气、贫油”的国情,提出了以电代煤的电能替代方案。本文以在电力和煤炭的使用过程中可获得的热值作为效用,以使用过程中所需要的年费用作为成本,建立了电能替代的成本效用模型,计算出实现电力和煤炭相互替代的排污费临界值,并通过一个算例进行了实证分析。分析结果表明:电价、单位电力排污量、燃煤设备寿命对排污费临界值有正向影响;煤价、单位燃煤排污量、电力设备寿命对其有负向影响。最后,在分析的基础上给出了电能替代的政策建议。     

隐马尔可夫模型在生物信息学中的应用

隐马尔可夫模型 ( HMM)是一个能够通过可观测的数据很好地捕捉真实空间统计性质的随机模型 ,该模型已成功地运用于语音识别 ,目前 HMM已开始应用于生物信息学 ( bioinformatics) ,已在生物序列分析中得到了广泛的应用 .本文首先介绍了 HMM的基本结构 ,然后着重讨论了 HMM在 DNA序列的多重比对 ,基因发现等生物序列分析中的应用     

逃税心理成本分析及其模型

1 问题的提出 对逃税问题进行经济分析的理论框架是由Allingham和Sandmo于1972年提出的预期效用最大化模型(简称A-S模型)([1]).该模型假设纳税人是在不确定情况下追求预期效用的最大化,同时假设纳税人不存在道德是非观念,逃税不会产生任何心理负担.     

隐非齐次马尔可夫模型的强大数定律

本文研究了一类隐非齐次马尔可夫模型的强极限定理.利用鞅差序列收敛定理,获得了观测链{Y_n,n≥0}的强大数定律,并给出了观测链的Shannon-McMillan定理.     

不确定性、实物期权与企业价值—基于简约Schwartz-Moon模型的分析

将实物期权理论引入传统现金流量折现法的应用框架,在不确定性条件下运用实物期权定价法来评估企业价值,提出了简约的Schwartz-Moon(2001)实物期权定价模型,并在此基础上运用蒙特卡罗模拟方法来计算了百度公司的价值.     

隐非齐次马尔可夫模型的强大数定律

在状态集都有限的情况下,给出了隐马尔可夫模型的一些性质定理．利用马氏链的强极限定理,得到了隐非齐次马尔可夫模型的强大数定律．     

Bayesian Analysis of a Two-State Markov Modulated Poisson Process

Abstract

We postulate observations from a Poisson process whose rate parameter modulates between two values determined by an unobserved Markov chain. The theory switches from continuous to discrete time by considering the intervals between observations as a sequence of dependent random variables. A result from hidden Markov models allows us to sample from the posterior distribution of the model parameters given the observed event times using a Gibbs sampler with only two steps per iteration.     

Bayesian Monte Carlo estimation for profile hidden Markov models

Hidden Markov models are used as tools for pattern recognition in a number of areas, ranging from speech processing to biological sequence analysis. Profile hidden Markov models represent a class of so-called “left–right” models that have an architecture that is specifically relevant to classification of proteins into structural families based on their amino acid sequences. Standard learning methods for such models employ a variety of heuristics applied to the expectation-maximization implementation of the maximum likelihood estimation procedure in order to find the global maximum of the likelihood function. Here, we compare maximum likelihood estimation to fully Bayesian estimation of parameters for profile hidden Markov models with a small number of parameters. We find that, relative to maximum likelihood methods, Bayesian methods assign higher scores to data sequences that are distantly related to the pattern consensus, show better performance in classifying these sequences correctly, and continue to perform robustly with regard to misspecification of the number of model parameters. Though our study is limited in scope, we expect our results to remain relevant for models with a large number of parameters and other types of left–right hidden Markov models.     

Bayesian Inference in Hidden Markov Random Fields for Binary Data Defined on Large Lattices

Hidden Markov random fields represent a complex hierarchical model, where the hidden latent process is an undirected graphical structure. Performing inference for such models is difficult primarily because the likelihood of the hidden states is often unavailable. The main contribution of this article is to present approximate methods to calculate the likelihood for large lattices based on exact methods for smaller lattices. We introduce approximate likelihood methods by relaxing some of the dependencies in the latent model, and also by extending tractable approximations to the likelihood, the so-called pseudolikelihood approximations, for a large lattice partitioned into smaller sublattices. Results are presented based on simulated data as well as inference for the temporal-spatial structure of the interaction between up- and down-regulated states within the mitochondrial chromosome of the Plasmodium falciparum organism. Supplemental material for this article is available online.     

Comparison of the Bayesian and Randomised Decision Tree Ensembles within an Uncertainty Envelope Technique

Multiple Classifier Systems (MCSs) allow evaluation of the uncertainty of classification outcomes that is of crucial importance for safety critical applications. The uncertainty of classification is determined by a trade-off between the amount of data available for training, the classifier diversity and the required performance. The interpretability of MCSs can also give useful information for experts responsible for making reliable classifications. For this reason Decision Trees (DTs) seem to be attractive classification models for experts. The required diversity of MCSs exploiting such classification models can be achieved by using two techniques, the Bayesian model averaging and the randomised DT ensemble. Both techniques have revealed promising results when applied to real-world problems. In this paper we experimentally compare the classification uncertainty of the Bayesian model averaging with a restarting strategy and the randomised DT ensemble on a synthetic dataset and some domain problems commonly used in the machine learning community. To make the Bayesian DT averaging feasible, we use a Markov Chain Monte Carlo technique. The classification uncertainty is evaluated within an Uncertainty Envelope technique dealing with the class posterior distribution and a given confidence probability. Exploring a full posterior distribution, this technique produces realistic estimates which can be easily interpreted in statistical terms. In our experiments we found out that the Bayesian DTs are superior to the randomised DT ensembles within the Uncertainty Envelope technique.     

Statistically Efficient Thinning of a Markov Chain Sampler

It is common to subsample Markov chain output to reduce the storage burden. Geyer shows that discarding k ? 1 out of every k observations will not improve statistical efficiency, as quantified through variance in a given computational budget. That observation is often taken to mean that thinning Markov chain Monte Carlo (MCMC) output cannot improve statistical efficiency. Here, we suppose that it costs one unit of time to advance a Markov chain and then θ > 0 units of time to compute a sampled quantity of interest. For a thinned process, that cost θ is incurred less often, so it can be advanced through more stages. Here, we provide examples to show that thinning will improve statistical efficiency if θ is large and the sample autocorrelations decay slowly enough. If the lag ? ? 1 autocorrelations of a scalar measurement satisfy ρ_? > ρ_{? + 1} > 0, then there is always a θ < ∞ at which thinning becomes more efficient for averages of that scalar. Many sample autocorrelation functions resemble first order AR(1) processes with ρ_? = ρ^|?| for some ? 1 < ρ < 1. For an AR(1) process, it is possible to compute the most efficient subsampling frequency k. The optimal k grows rapidly as ρ increases toward 1. The resulting efficiency gain depends primarily on θ, not ρ. Taking k = 1 (no thinning) is optimal when ρ ? 0. For ρ > 0, it is optimal if and only if θ ? (1 ? ρ)²/(2ρ). This efficiency gain never exceeds 1 + θ. This article also gives efficiency bounds for autocorrelations bounded between those of two AR(1) processes. Supplementary materials for this article are available online.     

Markov Chain Monte Carlo Convergence Assessment via Two-Way Analysis of Variance

Abstract

In this article we discuss the problem of assessing the performance of Markov chain Monte Carlo (MCMC) algorithms on the basis of simulation output. In essence, we extend the original ideas of Gelman and Rubin and, more recently, Brooks and Gelman, to problems where we are able to split the variation inherent within the MCMC simulation output into two distinct groups. We show how such a diagnostic may be useful in assessing the performance of MCMC samplers addressing model choice problems, such as the reversible jump MCMC algorithm. In the model choice context, we show how the reversible jump MCMC simulation output for parameters that retain a coherent interpretation throughout the simulation, can be used to assess convergence. By considering various decompositions of the sampling variance of this parameter, we can assess the performance of our MCMC sampler in terms of its mixing properties both within and between models and we illustrate our approach in both the graphical Gaussian models and normal mixtures context. Finally, we provide an example of the application of our diagnostic to the assessment of the influence of different starting values on MCMC simulation output, thereby illustrating the wider utility of our method beyond the Bayesian model choice and reversible jump MCMC context.     

Markov Chain Sampling Methods for Dirichlet Process Mixture Models

Abstract

This article reviews Markov chain methods for sampling from the posterior distribution of a Dirichlet process mixture model and presents two new classes of methods. One new approach is to make Metropolis—Hastings updates of the indicators specifying which mixture component is associated with each observation, perhaps supplemented with a partial form of Gibbs sampling. The other new approach extends Gibbs sampling for these indicators by using a set of auxiliary parameters. These methods are simple to implement and are more efficient than previous ways of handling general Dirichlet process mixture models with non-conjugate priors.     

Some characterizations of minimal Markov basis for sampling from discrete conditional distributions

In this paper we given some basic characterizations of minimal Markov basis for a connected Markov chain, which is used for performing exact tests in discrete exponential families given a sufficient statistic. We also give a necessary and sufficient condition for uniqueness of minimal Markov basis. A general algebraic algorithm for constructing a connected Markov chain was given by Diaconis and Sturmfels (1998,The Annals of Statistics,26, 363–397). Their algorithm is based on computing Gröbner basis for a certain ideal in a polynomial ring, which can be carried out by using available computer algebra packages. However structure and interpretation of Gröbner basis produced by the packages are sometimes not clear, due to the lack of symmetry and minimality in Gröbner basis computation. Our approach clarifies partially ordered structure of minimal Markov basis.     

A Novel Approach for Markov Random Field With Intractable Normalizing Constant on Large Lattices

The pseudo likelihood method of Besag (1974) has remained a popular method for estimating Markov random field on a very large lattice, despite various documented deficiencies. This is partly because it remains the only computationally tractable method for large lattices. We introduce a novel method to estimate Markov random fields defined on a regular lattice. The method takes advantage of conditional independence structures and recursively decomposes a large lattice into smaller sublattices. An approximation is made at each decomposition. Doing so completely avoids the need to compute the troublesome normalizing constant. The computational complexity is O(N), where N is the number of pixels in the lattice, making it computationally attractive for very large lattices. We show through simulations, that the proposed method performs well, even when compared with methods using exact likelihoods. Supplementary material for this article is available online.