首页> 外文期刊>Pattern recognition letters >An exact algorithm for time-dependent variational inference for the dynamic stochastic block model
【24h】

An exact algorithm for time-dependent variational inference for the dynamic stochastic block model

机译:动态随机块模型的时间依赖变分推理的精确算法

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

摘要

An exact algorithm for estimating the dynamic stochastic block model is proposed. This model assumes a hidden Markov chain for the evolution of the social behavior of a group of individuals at repeated time occasions and may be used to assign these individuals to the latent blocks in a dynamic fashion. For the estimation of this model, the proposed exact algorithm maximizes the target function introduced by Matias and Miele [7]. This function is derived from a variational approximation of the model log-likelihood, based on the assumption that the latent variables identifying the blocks are a posteriori independent across individuals, but not across time occasions. A simulation study is performed to compare the exact algorithm with the approximate maximization algorithm proposed by Matias and Miele [7]. Results show that there is a certain advantage of the first in terms of dynamic assignment of individuals to the latent blocks in comparison to the true blocking structure, as measured by the adjusted Rand index. (C) 2020 Elsevier B.V. All rights reserved.
机译:提出了一种用于估计动态随机块模型的精确算法。该模型假设一个隐藏的马尔可夫链条,用于在重复的时间场合的一群人的社交行为的演变,并且可以用于以动态方式将这些个人分配给潜在的块。为了估计该模型,所提出的精确算法最大化了Matias和Miele引入的目标函数[7]。该函数源自模型对数似然的变化近似,基于识别块的潜在变量是跨越各个独立的后验变量,而不是在时间场合的假设。进行仿真研究以比较Matias和Miele提出的近似最大化算法的精确算法[7]。结果表明,与真正的阻塞结构相比,在潜在块的动态分配的情况下,首先具有一定的优点,与真正的rand指标测量。 (c)2020 Elsevier B.v.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号