基于混合高斯过程模型的高光谱图像分类算法

提出了一种基于混合高斯过程模型的高光谱遥感图像分类算法,它不同于传统的基于多元统计的分类方法.为更好利用高光谱遥感图像的高谱分辨率特点,首先将函数数据分析的思想引进高光谱数据的分类问题,分类对象视为像元对应的谱线,故它们是函数型数据.为了有效模拟地物在空间上的分片聚集特性,则将混合高斯分布模型推广到混合高斯过程模型并用于高光谱数据分类算法中.数值实验表明,混合高斯过程模型是处理函数型数据的有效方法.     

风电功率波动特性的概率分布模型研究

为保证电网安全稳定运行,在大规模风电并网运行控制过程中,准确构建风电出力波动特性的概率分布模型具有重要意义.基于数据驱动的方法,采用加权高斯混合概率分布模型来拟合大规模风电基地的波动特性,模型拟合参数可采用基于期望最大化(Expectation Maximization,EM)的极大似然估计算法来获得,并提出了拟合评价指标来与其它多种概率分布模型进行对比,结果验证了加权高斯混合概率模型的有效性和适用性.     

基于混合高斯模型的指标优化方法

借鉴混合高斯模型的方法,提出了基于混合高斯模型的非参数检验法用于评价指标体系的构建.首先运用混合高斯模型对现有指标体系进行聚类分析,然后运用非参数检验的秩相关系数对分类后的指标体系进行筛选,最终确定评价指标体系的构成,保证指标体系的全面性和代表性.实例结果表明,方法分类精度高、简便、实用,在指标优化中具有应用价值.     

基于正态混合模型的贝叶斯分类方法及其应用

本文主要研究正态混合模型的贝叶斯分类方法.贝叶斯分类以后验概率最大为准则,后验概率需要估计相关的条件分布.对于连续型数据的分类,其数据由多个类别混合而成,仅用单一分布难以描述,此时混合模型是一个较好的选择,并且可由EM算法获得.模拟实验表明,基于正态混合模型的贝叶斯分类方法是可行有效的.对于特征较多的分类,不同特征对分类的影响不同,本文对每个特征应用基于正态混合模型的贝叶斯分类方法构建基本分类器,然后结合集成学习,用AdaBoost算法赋予每个分类器权重,再线性组合它们得到最终分类器.通过UCI数据库中实际的Wine Data Set验证表明,本文分类方法与集成学习的结合可以得到高准确率和稳定的分类.     

基于偏正态数据下联合位置与尺度混合专家回归模型的参数估计北大核心CSCD

混合专家回归模型广泛应用于异质总体数据的分类,聚类及回归分析中.研究基于偏正态数据,提出了联合位置与尺度混合专家回归模型,该模型同时对位置,尺度和混合比例参数建模,应用MM算法和EM算法研究了该模型参数的极大似然估计.通过随机模拟和实例分析说明了该模型和方法的有效性与实用性.     

基于偏正态数据下联合位置与尺度混合专家回归模型的参数估计

混合专家回归模型广泛应用于异质总体数据的分类,聚类及回归分析中.研究基于偏正态数据,提出了联合位置与尺度混合专家回归模型,该模型同时对位置,尺度和混合比例参数建模,应用MM算法和EM算法研究了该模型参数的极大似然估计.通过随机模拟和实例分析说明了该模型和方法的有效性与实用性.     

混合高斯Heston资产定价模型及统计模拟分析

经典Heston模型没有考虑资产的长相依性,金融实践证明其不能很好的刻画资产的真实情况.本文建立了混合高斯Heston资产定价模型,利用股票数据进行实证分析.首先,得到了混合高斯Heston模型满足的随机偏微分方程,并讨论了解的存在性和唯一性以及p阶矩性质.其次,对模型中未知参数进行估计和敏感性分析,通过3只股票的实际数据对Heston模型、混合高斯Heston模型满足的价格路径与真实路径做了对比.研究表明:混合高斯Heston模型比经典的Heston模型更能够刻画资产标的价格.     

正态分布和瑞利分布混合情形下的参数估计及分类问题

学者往往用单一的分布模拟和拟合杂波,如正态分布、瑞利分布和威布尔分布等。然而在实际中,雷达杂波由多种类型的杂波组成,单一分布通常不能精确刻画雷达杂波规律,因此,应用混合分布模型对雷达杂波数据建模更准确。本文考虑用正态分布和瑞利分布的混合分布拟合杂波,并应用矩估计方法和基于EM算法的极大似然估计方法估计模型参数,最后,应用最大后验概率分类准则验证2种估计方法的分类准确率。通过数据模拟,得出极大似然估计的效果和分类准确率都要优于矩估计的估计效果和分类准确率。     

泊松逆高斯回归模型的贝叶斯统计推断

本文研究泊松逆高斯回归模型的贝叶斯统计推断.基于应用Gibbs抽样,Metropolis-Hastings算法以及Multiple-Try Metropolis算法等MCMC统计方法计算模型未知参数和潜变量的联合贝叶斯估计,并引入两个拟合优度统计量来评价提出的泊松逆高斯回归模型的合理性.若干模拟研究与一个实证分析说明方法的可行性.     

定数截尾场合下混合指数威布尔分布的参数估计

混合指数威布尔分布是寿命数据分析中一个重要的统计模型.但是利用传统的矩法估计,极大似然估计等估计模型的参数比较困难.应用ECM算法,研究了混合指数威布尔分布在定数截尾数据场合下的参数估计问题,并以数值模拟验证用ECM算法来估计混合指数威布尔分布在定数截尾数据场合下的有效性.     

Variational Approximation for Mixtures of Linear Mixed Models

Mixtures of linear mixed models (MLMMs) are useful for clustering grouped data and can be estimated by likelihood maximization through the Expectation–Maximization algorithm. A suitable number of components is then determined conventionally by comparing different mixture models using penalized log-likelihood criteria such as Bayesian information criterion. We propose fitting MLMMs with variational methods, which can perform parameter estimation and model selection simultaneously. We describe a variational approximation for MLMMs where the variational lower bound is in closed form, allowing for fast evaluation and develop a novel variational greedy algorithm for model selection and learning of the mixture components. This approach handles algorithm initialization and returns a plausible number of mixture components automatically. In cases of weak identifiability of certain model parameters, we use hierarchical centering to reparameterize the model and show empirically that there is a gain in efficiency in variational algorithms similar to that in Markov chain Monte Carlo (MCMC) algorithms. Related to this, we prove that the approximate rate of convergence of variational algorithms by Gaussian approximation is equal to that of the corresponding Gibbs sampler, which suggests that reparameterizations can lead to improved convergence in variational algorithms just as in MCMC algorithms. Supplementary materials for the article are available online.     

High breakdown mixture discriminant analysis

Robust S-estimation is proposed for multivariate Gaussian mixture models generalizing the work of Hastie and Tibshirani (J. Roy. Statist. Soc. Ser. B 58 (1996) 155). In the case of Gaussian Mixture models, the unknown location and scale parameters are estimated by the EM algorithm. In the presence of outliers, the maximum likelihood estimators of the unknown parameters are affected, resulting in the misclassification of the observations. The robust S-estimators of the unknown parameters replace the non-robust estimators from M-step of the EM algorithm. The results were compared with the standard mixture discriminant analysis approach using the probability of misclassification criterion. This comparison showed a slight reduction in the average probability of misclassification using robust S-estimators as compared to the standard maximum likelihood estimators.     

GPU-Powered Shotgun Stochastic Search for Dirichlet Process Mixtures of Gaussian Graphical Models

Gaussian graphical models (GGMs) are popular for modeling high-dimensional multivariate data with sparse conditional dependencies. A mixture of GGMs extends this model to the more realistic scenario where observations come from a heterogenous population composed of a small number of homogeneous subgroups. In this article, we present a novel stochastic search algorithm for finding the posterior mode of high-dimensional Dirichlet process mixtures of decomposable GGMs. Further, we investigate how to harness the massive thread-parallelization capabilities of graphical processing units to accelerate computation. The computational advantages of our algorithms are demonstrated with various simulated data examples in which we compare our stochastic search with a Markov chain Monte Carlo (MCMC) algorithm in moderate dimensional data examples. These experiments show that our stochastic search largely outperforms the MCMC algorithm in terms of computing-times and in terms of the quality of the posterior mode discovered. Finally, we analyze a gene expression dataset in which MCMC algorithms are too slow to be practically useful.     

A Gaussian Mixed Model for Learning Discrete Bayesian Networks

In this paper, we address the problem of learning discrete Bayesian networks from noisy data. A graphical model based on a mixture of Gaussian distributions with categorical mixing structure coming from a discrete Bayesian network is considered. The network learning is formulated as a maximum likelihood estimation problem and performed by employing an EM algorithm. The proposed approach is relevant to a variety of statistical problems for which Bayesian network models are suitable—from simple regression analysis to learning gene/protein regulatory networks from microarray data.     

A Bayesian nonparametric model and its application in insurance loss prediction

Predicting insurance losses is an eternal focus of actuarial science in the insurance sector. Due to the existence of complicated features such as skewness, heavy tail, and multi-modality, traditional parametric models are often inadequate to describe the distribution of losses, calling for a mature application of Bayesian methods. In this study we explore a Gaussian mixture model based on Dirichlet process priors. Using three automobile insurance datasets, we employ the probit stick-breaking method to incorporate the effect of covariates into the weight of the mixture component, improve its hierarchical structure, and propose a Bayesian nonparametric model that can identify the unique regression pattern of different samples. Moreover, an advanced updating algorithm of slice sampling is integrated to apply an improved approximation to the infinite mixture model. We compare our framework with four common regression techniques: three generalized linear models and a dependent Dirichlet process ANOVA model. The empirical results show that the proposed framework flexibly characterizes the actual loss distribution in the insurance datasets and demonstrates superior performance in the accuracy of data fitting and extrapolating predictions, thus greatly extending the application of Bayesian methods in the insurance sector.     

��˹ͼģ�͵Ļ����������Ľ���IPSP�㷨

The IPSP algorithm is an efficient algorithm for computing maximum likelihood estimation of Gaussian graphical models. It first divides clique marginals of graphical models into several groups, and then it adjusts clique marginals in each group locally. This paper uses the IIPS algorithm on junction tree to replace local adjustment on each group in the IPSP algorithm and propose a resulting algorithm called IPSP-JT to reduce the complexity of the IPSP algorithm. Moreover, we give a graph with minimum edges used by IIPS to adjust locally, and we prove its existence and uniqueness and construct a local junction tree. Numerical experiments show that the IPSP-JT algorithm runs faster than the IPSP algorithm for large Gaussian graphical models.     

Two New Mixture Models Related to the Inverse Gaussian Distribution

This article presents a new family of logarithmic distributions to be called the sinh mixture inverse Gaussian model and its associated life distribution referred as the extended mixture inverse Gaussian model. Specifically, the density, distribution function, and moments are developed for the sinh mixture inverse Gaussian distribution. Next, the extended mixture inverse Gaussian distribution is characterized. A graphical analysis of the densities of the new models is also provided. In addition, a lifetime analysis is presented for the extended mixture inverse Gaussian distribution. Finally, an example with a real data set is given to illustrate the methodology, which indicates that the new models result in a better fit to the data than some other well-known distributions.     

基于特殊混料模型D-最优设计搜索的交换点式门限接受算法

在搜索混料模型D-最优设计的计算机算法领域,主流算法包括经典的Fedorov算法,以及元启发类算法,但两者在一些特定的优化问题上,分别在收敛速度和收敛精度方面有进一步提升的空间.文章分别探讨了可能造成这种情况的两类算法各自的局限性,并采取优势互补的策略,构建了交换点式门限接受算法,即ETA (exchange threshold accepting)算法.以含倒数项混料模型为例,文章验证了ETA算法生成设计的D-最优性,并分别与Fedorov算法和元启发类的ProjPSO算法作比较.结果表明,至少在某些特殊的混料模型D-最优设计的搜索方面,ETA算法在收敛速度和精度方面均具有一定的优势.     

A novel PDE based image restoration: Convection-diffusion equation for image denoising

In this paper we present a convection-diffusion equation for processing image denoising, edge preservation and compression. We compare it with a popular nonlinear diffusion model which has been widely implemented in image denoising for Gaussian white noise. Here we show that this convection-diffusion model effectively removes noise, especially for the mixture of Gaussian and salt-and-pepper noises. We propose the modified streamline diffusion method [Y. Shih, H.C. Elman, Modified streamline diffusion schemes for convection-diffusion problems, Comput. Methods Appl. Mech. Eng, 1998.] for the discretization of this convection-diffusion model to prevent internal layers because of the discontinuities while using the coarsening algorithm for the image compression. Numerical experiments have shown that our convection-diffusion model for removing both Gaussian and salt-and-pepper noises, efficiently and reliably preserves edges quite satisfactorily.