arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2412.09663cs.LGcs.DMcs.SI
收藏

重新审视图同质性度量

Revisiting Graph Homophily Measures

Yandex Research(Yandex研究院)

Mikhail Mironov, Liudmila Prokhorenkova

AI总结:

针对现有图同质性度量无法跨不同标签分布数据集可靠比较的缺陷,提出具备所有期望性质的无偏同质性度量,适用于无向带权图,并证明有向图中不存在满足全部期望性质的同质性度量。

摘要:

同质性是描述图中边倾向于连接相似节点的图属性。目前有多种用于评估同质性的度量方法,但已知所有方法都存在一定缺陷:尤其是它们无法可靠地用于比较类别数量不同、类别规模均衡性不同的数据集。为说明这一点,以往关于图同质性的研究提出了优良同质性度量应具备的若干性质,同时指出现有同质性度量均不满足所有这些性质。本文针对这一问题,提出了一种新的同质性度量——无偏同质性(unbiased homophily),它具备所有期望性质,因此可可靠地应用于标签分布不同的各类数据集。该度量适用于无向(可带权)图。我们通过理论推导和实证示例表明,现有同质性度量存在严重缺陷,而无偏同质性在所考虑的场景中表现出符合预期的特性。最后,针对有向图,我们证明部分期望性质相互矛盾,因此不存在能同时满足所有这些性质的度量方法。

英文摘要:

Homophily is a graph property describing the tendency of edges to connect similar nodes. There are several measures used for assessing homophily but all are known to have certain drawbacks: in particular, they cannot be reliably used for comparing datasets with varying numbers of classes and class size balance. To show this, previous works on graph homophily suggested several properties desirable for a good homophily measure, also noting that no existing homophily measure has all these properties. Our paper addresses this issue by introducing a new homophily measure - unbiased homophily - that has all the desirable properties and thus can be reliably used across datasets with different label distributions. The proposed measure is suitable for undirected (and possibly weighted) graphs. We show both theoretically and via empirical examples that the existing homophily measures have serious drawbacks while unbiased homophily has a desirable behavior for the considered scenarios. Finally, when it comes to directed graphs, we prove that some desirable properties contradict each other and thus a measure satisfying all of them cannot exist.

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

↑