arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1405.4332cs.SIcs.CYcs.ITmath.ITphysics.soc-ph
收藏

基于信息流压缩的节点属性网络划分

Partitioning Networks with Node Attributes by Compressing Information Flow

Laura M. Smith, Linhong Zhu, Kristina Lerman, Allon G. Percus

摘要:

现实世界的网络通常被组织为模块或类似节点的社区,这些节点作为功能单元。这些网络的内容也很丰富,节点具有独特的特征或属性。为了发现网络的模块化结构,不仅需要考虑其链路,还需要考虑节点属性。我们描述了一个信息理论的方法,通过压缩描述的信息流在网络上识别模块。我们的公式将节点内容引入到信息流的描述中,然后我们将其最小化,以发现具有相似属性的节点组,这些节点组也倾向于捕获信息流。该方法有几个优点:它是概念上简单,不需要ad-hoc参数来指定模块的数量或控制链路和节点属性对网络结构的相对贡献。我们应用所提出的方法来划分具有已知社区结构的现实世界网络。我们证明,添加节点属性有助于恢复内容丰富的网络中的底层社区结构更有效地比单独使用链接。此外,我们表明,我们的方法比其他最先进的算法更快,更准确。

英文摘要:

Real-world networks are often organized as modules or communities of similar nodes that serve as functional units. These networks are also rich in content, with nodes having distinguishing features or attributes. In order to discover a network's modular structure, it is necessary to take into account not only its links but also node attributes. We describe an information-theoretic method that identifies modules by compressing descriptions of information flow on a network. Our formulation introduces node content into the description of information flow, which we then minimize to discover groups of nodes with similar attributes that also tend to trap the flow of information. The method has several advantages: it is conceptually simple and does not require ad-hoc parameters to specify the number of modules or to control the relative contribution of links and node attributes to network structure. We apply the proposed method to partition real-world networks with known community structure. We demonstrate that adding node attributes helps recover the underlying community structure in content-rich networks more effectively than using links alone. In addition, we show that our method is faster and more accurate than alternative state-of-the-art algorithms.

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

↑