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

加权网络边重叠的一种新推广

A new generalization of edge overlap to weighted networks

Ali Choumane

摘要:

寻找网络中的优势一直是一个很大的需求。在社交网络的背景下,它允许估计用户之间的关系强度。计算边缘强度的最著名的方法是邻域重叠。它计算边缘终端节点的公共邻居与所有邻居的比率。这种方法最初是针对未加权网络提出的,后来扩展到加权网络。这两个版本的方法在数学上并不等价:事实上,一个未加权的网络通常被认为是加权的,所有边的权重都等于1。在这样的网络上使用两个现有版本的邻域重叠会产生完全不同的值。在本文中,我们解决了这个问题,并提出了一个新的推广邻域重叠,同样适用于未加权和加权网络。在具有各种参数的网络上进行的实验表明,我们的措施与现有措施的性能相似。

英文摘要:

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.

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

↑