arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1006.5367cs.LGphysics.soc-ph
收藏

二分网络中的链接预测问题

The Link Prediction Problem in Bipartite Networks

Technische Universität Berlin(柏林工业大学)

Jérôme Kunegis, Ernesto W. De Luca, Sahin Albayrak

摘要:

我们定义并研究了二分网络中的链接预测问题,将一般的链接预测算法应用于二分网络。在图中,两个顶点的链接预测函数表示顶点的相似性或接近性。一般图的公共链接预测函数使用两个节点之间的长度为2的路径来定义。由于在二部图中,邻接点只能由奇数长度的路径连接,因此这些函数不适用于二部图。相反,当半正定核约束放松时,某类图核(谱变换核)可以推广到二分图。这种推广是通过基础谱变换的奇分量来实现的。这种结构导致了几个新的链接预测伪内核,如矩阵双曲正弦,我们检查评级图,作者图,大众分类法,文档-功能网络和其他类型的二分网络。

英文摘要:

We define and study the link prediction problem in bipartite networks, specializing general link prediction algorithms to the bipartite case. In a graph, a link prediction function of two vertices denotes the similarity or proximity of the vertices. Common link prediction functions for general graphs are defined using paths of length two between two nodes. Since in a bipartite graph adjacency vertices can only be connected by paths of odd lengths, these functions do not apply to bipartite graphs. Instead, a certain class of graph kernels (spectral transformation kernels) can be generalized to bipartite graphs when the positive-semidefinite kernel constraint is relaxed. This generalization is realized by the odd component of the underlying spectral transformation. This construction leads to several new link prediction pseudokernels such as the matrix hyperbolic sine, which we examine for rating graphs, authorship graphs, folksonomies, document--feature networks and other types of bipartite networks.

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

↑