首页> 外文会议>2012 IEEE Statistical Signal Processing Workshop. >On-line gossip-based distributed expectation maximization algorithm
【24h】

On-line gossip-based distributed expectation maximization algorithm

机译:基于在线八卦的分布式期望最大化算法

获取原文
获取原文并翻译 | 示例

摘要

In this paper, we introduce a novel on-line Distributed Expectation- Maximization (DEM) algorithm for latent data models including Gaussian Mixtures as a special case. We consider a network of agents whose mission is to estimate a parameter from the time series locally observed by the agents. Our estimator works online and asynchronously: it starts processing data as they arrive with no need of a reference clock, common to all the agents. Agents update some local summary statistics using recent data (E-step), then share these statistics with theirs neighbors in order to eventually reach a consensus (gossip step), and finally use them to generate individual estimates of the unknown parameter (M-step). Our algorithm is shown to converge under mild conditions on the gossip protocol, freeing the network from feedback communications; hence making this DEM algorithm particularly well suited to Wireless Sensor Networks (WSN).
机译:在本文中,我们针对潜在数据模型(包括高斯混合)引入了一种新颖的在线分布式期望最大化(DEM)算法。我们考虑了一个代理商网络,其任务是根据代理商本地观察到的时间序列估算参数。我们的估算器在线且异步运行:它在到达数据时就开始处理数据,而不需要所有座席共用的参考时钟。代理使用最近的数据更新一些本地摘要统计信息(E步骤),然后与邻居共享这些统计信息以最终达成共识(闲话步骤),最后使用它们生成未知参数的单独估计值(M步骤) )。我们的算法显示可以在温和的条件下在八卦协议上收敛,从而使网络摆脱反馈通信的束缚。因此,使这种DEM算法特别适合无线传感器网络(WSN)。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号