arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1206.6416cs.LGstat.ML
收藏

网络数据的无限潜在属性模型

An Infinite Latent Attribute Model for Network Data

University of Cambridge(剑桥大学)

Konstantina Palla, David Knowles, Zoubin Ghahramani

摘要:

网络数据的潜变量模型提取了所观察网络的关系结构的摘要。最简单的可能模型将网络的节点细分为簇;任何两个节点之间的链接概率仅取决于它们的簇分配。目前可用的模型可以通过聚类是不相交的还是允许重叠来分类。这些模型可以解释“扁平”的集群结构。分层贝叶斯模型提供了一种自然的方法来捕获更复杂的依赖关系。我们提出了一个模型,其中对象的特点是由一个潜在的特征向量。每个特征本身被划分为不相交的组(子聚类),对应于层次结构的第二层。在实验比较中,该模型在社会和生物链接预测任务上实现了显著改善的预测性能。结果表明,单层层次模型过度简化了真实网络。

英文摘要:

Latent variable models for network data extract a summary of the relational structure underlying an observed network. The simplest possible models subdivide nodes of the network into clusters; the probability of a link between any two nodes then depends only on their cluster assignment. Currently available models can be classified by whether clusters are disjoint or are allowed to overlap. These models can explain a "flat" clustering structure. Hierarchical Bayesian models provide a natural approach to capture more complex dependencies. We propose a model in which objects are characterised by a latent feature vector. Each feature is itself partitioned into disjoint groups (subclusters), corresponding to a second layer of hierarchy. In experimental comparisons, the model achieves significantly improved predictive performance on social and biological link prediction tasks. The results indicate that models with a single layer hierarchy over-simplify real networks.

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

↑