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

大规模地统计数据集的分层最近邻高斯过程模型

Hierarchical Nearest-Neighbor Gaussian Process Models for Large Geostatistical Datasets

Abhirup Datta, Sudipto Banerjee, Andrew O. Finley, Alan E. Gelfand

摘要:

用于分析地统计数据的空间过程模型需要随着空间位置的数量变大而变得令人望而却步的计算。本文提出了一类高度可扩展的最近邻高斯过程(NNGP)模型,为大型地统计数据集提供完全基于模型的推理。我们建立了NNGP是一个定义良好的空间过程,提供合法的有限维高斯密度稀疏精度矩阵。我们嵌入的NNGP作为一个稀疏诱导前丰富的分层建模框架内,并概述了如何计算效率高的马尔可夫链蒙特卡罗(MCMC)算法可以执行,而无需存储或分解大矩阵。该算法的每次迭代的浮点运算(触发器)在空间位置的数量上是线性的,从而呈现实质的可缩放性。我们说明了计算和推理的好处NNGP竞争的方法,使用模拟研究,还分析了森林生物量从一个庞大的美国森林资源清查数据集的规模,排除了其他降维方法。

英文摘要:

Spatial process models for analyzing geostatistical data entail computations that become prohibitive as the number of spatial locations become large. This manuscript develops a class of highly scalable Nearest Neighbor Gaussian Process (NNGP) models to provide fully model-based inference for large geostatistical datasets. We establish that the NNGP is a well-defined spatial process providing legitimate finite-dimensional Gaussian densities with sparse precision matrices. We embed the NNGP as a sparsity-inducing prior within a rich hierarchical modeling framework and outline how computationally efficient Markov chain Monte Carlo (MCMC) algorithms can be executed without storing or decomposing large matrices. The floating point operations (flops) per iteration of this algorithm is linear in the number of spatial locations, thereby rendering substantial scalability. We illustrate the computational and inferential benefits of the NNGP over competing methods using simulation studies and also analyze forest biomass from a massive United States Forest Inventory dataset at a scale that precludes alternative dimension-reducing methods.

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

↑