重叠随机块模型及其在法国政治博客圈中的应用
Overlapping stochastic block models with application to the French political blogosphere
摘要:
自然界和社会中的复杂系统通常被表示为网络,描述感兴趣的对象之间的丰富交互。已经开发了许多确定性和概率性聚类方法来分析此类结构。给定一个网络,几乎所有的算法都是根据节点的连接特征将节点划分为互不相交的簇。然而,最近的研究表明,这些技术的限制太多,大多数现有的网络包含重叠的集群。为了解决这个问题,本文提出了重叠随机块模型。我们的方法允许顶点属于多个簇,并且在某种程度上推广了众所周知的随机块模型[Nowicki和Snijders(2001)]。我们表明,该模型是通用的等价类内识别,我们提出了一个近似的推理过程,基于全球和局部变分技术。使用玩具数据集以及法国政治博客圈网络和酿酒酵母的转录网络,我们比较我们的工作与其他方法。
英文摘要:
Complex systems in nature and in society are often represented as networks, describing the rich set of interactions between objects of interest. Many deterministic and probabilistic clustering methods have been developed to analyze such structures. Given a network, almost all of them partition the vertices into disjoint clusters, according to their connection profile. However, recent studies have shown that these techniques were too restrictive and that most of the existing networks contained overlapping clusters. To tackle this issue, we present in this paper the Overlapping Stochastic Block Model. Our approach allows the vertices to belong to multiple clusters, and, to some extent, generalizes the well-known Stochastic Block Model [Nowicki and Snijders (2001)]. We show that the model is generically identifiable within classes of equivalence and we propose an approximate inference procedure, based on global and local variational techniques. Using toy data sets as well as the French Political Blogosphere network and the transcriptional network of Saccharomyces cerevisiae, we compare our work with other approaches.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。