arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1402.1213cs.SIstat.AP
收藏

一种基于统计建模的网络社区发现方法

A Statistical Modelling Approach to Detecting Community in Networks

Adrien Ickowicz

摘要:

最近有相当大的兴趣在算法中寻找社区网络-组的顶点内的连接是密集的(频繁),但之间的连接是稀疏的(罕见)。大多数当前文献提倡一种去除边缘的启发式方法(即,使用精心设计的函数移除不太重要的链接)。在这篇文章中,我们将研究一种使用新的建模方法来发现潜在社区的技术,该方法基于信息如何在网络中传播。它将被证明是易于使用,强大和可扩展的。它使与网络/社区结构有关的补充信息(不同的来文、连续的观察)更容易整合。我们将通过提供一些示例性的真实应用程序来展示我们方法的效率,例如著名的Zachary空手道俱乐部或亚马逊政治书籍购买者网络。

英文摘要:

There has been considerable recent interest in algorithms for finding communities in networks - groups of vertex within which connections are dense (frequent), but between which connections are sparser (rare). Most of the current literature advocates an heuristic approach to the removal of the edges (i.e., removing the links that are less significant using a well-designed function). In this article, we will investigate a technique for uncovering latent communities using a new modelling approach, based on how information spread within a network. It will prove to be easy to use, robust and scalable. It makes supplementary information related to the network/community structure (different communications, consecutive observations) easier to integrate. We will demonstrate the efficiency of our approach by providing some illustrating real-world applications, like the famous Zachary karate club, or the Amazon political books buyers network.

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

↑