MRF和GM模型高光谱图像地物标记

利用马尔可夫随机场和高斯混合模型构造了一种对高光谱图像进行地物标记的新方法。该方法利用PCA降维后的高光谱图像及其差分图像的先验信息建立高光谱图像的随机模型,并把最大后验估计作为地物标记优化的评判标准,用模拟退火算法实现地物标记。实验结果显示该算法是一种精确、高效、稳定的图形标记算法。     

脑-机接口中新的脑电数据分类方法

根据自发脑电的特点,将HMM-AR模型算法运用到脑电状态的分类中,证明它是一种非常有用的分析脑-机接口方法。将Laplacian filter、ICA和HMM-AR方法相结合,用想象左右手运动的BCI数据进行识别,得到了很好的分类结果,有效地区分脑电中运动与非运动两种状态。该算法能够在运动开始后1 s内检验到脑电信号的变化,从而证明了该算法在BCI的实用性,达到了良好的识别效果。     

MAP segmentation in Bayesian hidden Markov models: a case study

We consider the problem of estimating the maximum posterior probability (MAP) state sequence for a finite state and finite emission alphabet hidden Markov model (HMM) in the Bayesian setup, where both emission and transition matrices have Dirichlet priors. We study a training set consisting of thousands of protein alignment pairs. The training data is used to set the prior hyperparameters for Bayesian MAP segmentation. Since the Viterbi algorithm is not applicable any more, there is no simple procedure to find the MAP path, and several iterative algorithms are considered and compared. The main goal of the paper is to test the Bayesian setup against the frequentist one, where the parameters of HMM are estimated using the training data.     

On the Flexibility of Metropolis–Hastings Acceptance Probabilities in Auxiliary Variable Proposal Generation

Abstract. Use of auxiliary variables for generating proposal variables within a Metropolis–Hastings setting has been suggested in many different settings. This has in particular been of interest for simulation from complex distributions such as multimodal distributions or in transdimensional approaches. For many of these approaches, the acceptance probabilities that are used turn up somewhat magic and different proofs for their validity have been given in each case. In this article, we will present a general framework for construction of acceptance probabilities in auxiliary variable proposal generation. In addition to showing the similarities between many of the proposed algorithms in the literature, the framework also demonstrates that there is a great flexibility in how to construct acceptance probabilities. With this flexibility, alternative acceptance probabilities are suggested. Some numerical experiments are also reported.     

Combining forecasts of electricity consumption in China with time-varying weights updated by a high-order Markov chain model

Electricity consumption forecasting has been always playing a vital role in power system management and planning. Inaccurate prediction may cause wastes of scarce energy resource or electricity shortages. However, forecasting electricity consumption has proven to be a challenging task due to various unstable factors. Especially, China is undergoing a period of economic transition, which highlights this difficulty. This paper proposes a time-varying-weight combining method, i.e. High-order Markov chain based Time-varying Weighted Average (HM-TWA) method to predict the monthly electricity consumption in China. HM-TWA first calculates the in-sample time-varying combining weights by quadratic programming for the individual forecasts. Then it predicts the out-of-sample time-varying adaptive weights through extrapolating these in-sample weights using a high-order Markov chain model. Finally, the combined forecasts can be obtained. In addition, to ensure that the sample data have the same properties as the required forecasts, a reasonable multi-step-ahead forecasting scheme is designed for HM-TWA. The out-of-sample forecasting performance evaluation shows that HM-TWA outperforms the component models and traditional combining methods, and its effectiveness is further verified by comparing it with some other existing models.     

A Bayesian approach to non-parametric monotone function estimation

Summary.  The paper proposes two Bayesian approaches to non-parametric monotone function estimation. The first approach uses a hierarchical Bayes framework and a characterization of smooth monotone functions given by Ramsay that allows unconstrained estimation. The second approach uses a Bayesian regression spline model of Smith and Kohn with a mixture distribution of constrained normal distributions as the prior for the regression coefficients to ensure the monotonicity of the resulting function estimate. The small sample properties of the two function estimators across a range of functions are provided via simulation and compared with existing methods. Asymptotic results are also given that show that Bayesian methods provide consistent function estimators for a large class of smooth functions. An example is provided involving economic demand functions that illustrates the application of the constrained regression spline estimator in the context of a multiple-regression model where two functions are constrained to be monotone.     

Stochastic Bounds with a Low Rank Decomposition

We investigate how we can bound a discrete time Markov chain (DTMC) by a stochastic matrix with a low rank decomposition. In the first part of the article, we show the links with previous results for matrices with a decomposition of size 1 or 2. Then we show how the complexity of the analysis for steady-state and transient distributions can be simplified when we take into account the decomposition. Finally, we show how we can obtain a monotone stochastic upper bound with a low rank decomposition.     

Bayesian inference of asymmetric stochastic conditional duration models

This paper extends stochastic conditional duration (SCD) models for financial transaction data to allow for correlation between error processes and innovations of observed duration process and latent log duration process. Suitable algorithms of Markov Chain Monte Carlo (MCMC) are developed to fit the resulting SCD models under various distributional assumptions about the innovation of the measurement equation. Unlike the estimation methods commonly used to estimate the SCD models in the literature, we work with the original specification of the model, without subjecting the observation equation to a logarithmic transformation. Results of simulation studies suggest that our proposed models and corresponding estimation methodology perform quite well. We also apply an auxiliary particle filter technique to construct one-step-ahead in-sample and out-of-sample duration forecasts of the fitted models. Applications to the IBM transaction data allow comparison of our models and methods to those existing in the literature.     

Bayesian multivariate GARCH models with dynamic correlations and asymmetric error distributions

The main goal in this paper is to develop and apply stochastic simulation techniques for GARCH models with multivariate skewed distributions using the Bayesian approach. Both parameter estimation and model comparison are not trivial tasks and several approximate and computationally intensive methods (Markov chain Monte Carlo) will be used to this end. We consider a flexible class of multivariate distributions which can model both skewness and heavy tails. Also, we do not fix tail behaviour when dealing with fat tail distributions but leave it subject to inference.     

Approximate Bayesian Computation for Exponential Random Graph Models for Large Social Networks

We consider the issue of sampling from the posterior distribution of exponential random graph (ERG) models and other statistical models with intractable normalizing constants. Existing methods based on exact sampling are either infeasible or require very long computing time. We study a class of approximate Markov chain Monte Carlo (MCMC) sampling schemes that deal with this issue. We also develop a new Metropolis–Hastings kernel to sample sparse large networks from ERG models. We illustrate the proposed methods on several examples.