论文标题
边缘重叠到加权网络的新概括
A new generalization of edge overlap to weighted networks
论文作者
论文摘要
在网络中找到优势的强度一直是一个很大的需求。在社交网络的背景下，它允许估计用户之间的关系强度。计算边缘强度的最著名方法是社区重叠。它计算了Edge终端节点的所有邻居与所有邻居的比率。该方法最初是针对未加权网络提出的，后来扩展了加权网络。该方法的这两个版本在数学上不是等效的：实际上，一个未加权的网络通常被认为是用等于一个的所有边缘权重的加权。在此类网络上使用两个存在的邻域重叠的版本会产生完全不同的值。在本文中，我们解决了这个问题，并提出了针对社区重叠的新概括，该重叠适用于未加权和加权网络。在具有各种参数的网络上执行的实验表明，我们的度量与现有措施的表现相似。
Finding the strength of an edge in a network has always been a big demand. In the context of social networks, it allows to estimate the relationship strength between users. The best-known method to compute edge strength is the Neighbourhood Overlap. It computes the ratio of common neighbours to all neighbours of an edge terminal nodes. This method has been initially proposed for unweighted networks and later extended for weighted ones. These two versions of the method are not mathematically equivalent: In fact, an unweighted network is commonly considered as weighted with all edge weights equal to one. Using both existent versions of Neighbourhood Overlap on such network produce completely different values. In this paper, we tackle this problem and propose a new generalization for Neighbourhood Overlap that works equally for unweighted and weighted networks. Experiment performed on networks with various parameters showed similar performance of our measure to the existing measures.
