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

随机块模型的变分贝叶斯推断与复杂性控制

Variational Bayesian Inference and Complexity Control for Stochastic Block Models

Pierre Latouche, Etienne Birmele, Christophe Ambroise

摘要:

现在人们普遍认为,知识可以从网络中获得聚类的顶点根据连接配置文件。许多方法已经被提出,在本文中,我们集中在随机块模型(SBM)。顶点的聚类和SBM模型参数的估计已经受到以前的工作和许多推理策略,如变分期望最大化(EM)和分类EM已被提出。然而,SBM仍然缺乏估计混合物中组分数量的标准。据我们所知,只有一个模型为基础的标准,ICL,已推导出SBM在文献中。它依赖于一个渐近近似的综合完全数据的李克图和最近的研究表明,它往往是过于保守的情况下,小网络。为了解决这个问题,我们提出了一个新的标准,我们称之为ILVb,基于非渐近近似的边际似然。我们描述了如何通过变分贝叶斯期望最大化算法计算的标准。

英文摘要:

It is now widely accepted that knowledge can be acquired from networks by clustering their vertices according to connection profiles. Many methods have been proposed and in this paper we concentrate on the Stochastic Block Model (SBM). The clustering of vertices and the estimation of SBM model parameters have been subject to previous work and numerous inference strategies such as variational Expectation Maximization (EM) and classification EM have been proposed. However, SBM still suffers from a lack of criteria to estimate the number of components in the mixture. To our knowledge, only one model based criterion, ICL, has been derived for SBM in the literature. It relies on an asymptotic approximation of the Integrated Complete-data Likelihood and recent studies have shown that it tends to be too conservative in the case of small networks. To tackle this issue, we propose a new criterion that we call ILvb, based on a non asymptotic approximation of the marginal likelihood. We describe how the criterion can be computed through a variational Bayes EM algorithm.

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

↑