arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1608.02797stat.COcs.DC
收藏

多元斜正态和斜t-混合模型的块期望最大化算法

A block EM algorithm for multivariate skew normal and skew t-mixture models

Sharon X Lee, Kaleb L Leemaqz, Geoffrey J McLachlan

摘要:

偏斜分布的有限混合为具有非对称分布特征的异构数据建模提供了灵活的工具。然而,通过期望最大化(EM)算法的参数估计可能变得非常耗时,这是由于E步骤中涉及的复杂表达式在数值上评估起来是昂贵的。最近提出了一种更节省时间的期望最大化算法的实现,它允许并行地评估混合模型的每个分量。在本文中,我们开发了一个块实现的期望最大化算法,便于计算中的E-和M-步骤被分散在大量的线程。我们专注于多变量斜正态分布和斜t-分布的有限混合物的拟合,并表明,在期望最大化算法的E-和M-步骤可以修改,以允许数据被分割成块。该方法可以很容易地实现,以供多核和多处理器机器使用。它也可以同时应用于最近提出的多线程期望最大化算法,以实现进一步减少计算时间。在一些真实的数据集上说明了时间性能的改善。

英文摘要:

Finite mixtures of skew distributions provide a flexible tool for modelling heterogeneous data with asymmetric distributional features. However, parameter estimation via the Expectation-Maximization (EM) algorithm can become very time-consuming due to the complicated expressions involved in the E-step that are numerically expensive to evaluate. A more time-efficient implementation of the EM algorithm was recently proposed which allows each component of the mixture model to be evaluated in parallel. In this paper, we develop a block implementation of the EM algorithm that facilitates the calculations in the E- and M-steps to be spread across a larger number of threads. We focus on the fitting of finite mixtures of multivariate skew normal and skew t-distributions, and show that both the E- and M-steps in the EM algorithm can be modified to allow the data to be split into blocks. The approach can be easily implemented for use by multicore and multi-processor machines. It can also be applied concurrently with the recently proposed multithreaded EM algorithm to achieve further reduction in computation time. The improvement in time performance is illustrated on some real datasets.

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

↑