arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.04377stat.ME
收藏

秩数据经验Bayes分析的一种新的三明治算法

A novel sandwich algorithm for empirical Bayes analysis of rank data

Arnab Kumar Laha, Somak Dutta, Vivekananda Roy

摘要:

排名数据经常出现在市场营销,金融,组织行为学和心理学中。文献中报道的大多数等级数据分析都假设存在一个或多个变量(有时是潜在的),根据这些变量的值对项目进行排名。在本文中,我们分析秩数据使用一个纯粹的概率模型,其中所观察到的排名被假定为扰动版本的真实排名和每个扰动有一个特定的发生概率。我们考虑协变量信息存在并对排名产生影响的一般情况。采用经验贝叶斯方法估计模型参数。吉布斯采样收敛速度非常缓慢的目标后验分布,我们表明,一些广泛使用的经验收敛诊断工具可能无法检测到这种缺乏收敛。我们提出了一种新的,快速混合三明治算法探索的后验分布。提出了一种基于马尔可夫链蒙特卡罗(MCMC)抽样的期望最大化算法,用于先验超参数的估计.一个现实生活中的秩数据集进行了分析,使用本文开发的方法。所得结果表明,这些方法在分析具有协变量信息的秩数据时是有用的。

英文摘要:

Rank data arises frequently in marketing, finance, organizational behavior, and psychology. Most analysis of rank data reported in the literature assumes the presence of one or more variables (sometimes latent) based on whose values the items are ranked. In this paper we analyze rank data using a purely probabilistic model where the observed ranks are assumed to be perturbed versions of the true rank and each perturbation has a specific probability of occurring. We consider the general case when covariate information is present and has an impact on the rankings. An empirical Bayes approach is taken for estimating the model parameters. The Gibbs sampler is shown to converge very slowly to the target posterior distribution and we show that some of the widely used empirical convergence diagnostic tools may fail to detect this lack of convergence. We propose a novel, fast mixing sandwich algorithm for exploring the posterior distribution. An EM algorithm based on Markov chain Monte Carlo (MCMC) sampling is developed for estimating prior hyperparameters. A real life rank data set is analyzed using the methods developed in the paper. The results obtained indicate the usefulness of these methods in analyzing rank data with covariate information.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑