arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2001.11181cs.SIcs.LG
收藏

在超图中我们需要多少以及何时需要高阶信息?超边缘预测的实例研究

How Much and When Do We Need Higher-order Information in Hypergraphs? A Case Study on Hyperedge Prediction

Korea Advanced Institute of Science and Technology(韩国科学技术院)

Se-eun Yoon, Hyungseok Song, Kijung Shin, Yung Yi

摘要:

超图提供了一种自然的方式来表示组关系,其复杂性促使大量的先前工作采用某种形式的抽象和简化高阶交互。然而,以下问题尚未得到解决:在解决超图任务时,对组交互的抽象程度是足够的,以及这些结果在不同的数据集之间会有多大的不同?这个问题,如果正确回答,提供了一个有用的工程指导方针,如何解决下游任务的复杂性和准确性之间的权衡。为此,我们提出了一种增量表示组交互的方法,使用n-投影图的概念,其累积包含多达n路交互的信息,并量化解决任务的准确性,因为n增长为各种数据集。作为一个下游任务,我们考虑超边缘预测,链接预测,这是一个典型的任务,用于评估图模型的扩展。通过对15个真实世界数据集的实验,我们得出了以下信息:(a)收益递减:小n足以达到与接近完美的近似相当的精度,(b)更大的n:随着任务变得更具挑战性,更大的n带来更多的好处,以及(c)不可约化:当被简化为成对抽象时,其成对交互不太能说明高阶交互的数据集损失了很多准确性。

英文摘要:

Hypergraphs provide a natural way of representing group relations, whose complexity motivates an extensive array of prior work to adopt some form of abstraction and simplification of higher-order interactions. However, the following question has yet to be addressed: How much abstraction of group interactions is sufficient in solving a hypergraph task, and how different such results become across datasets? This question, if properly answered, provides a useful engineering guideline on how to trade off between complexity and accuracy of solving a downstream task. To this end, we propose a method of incrementally representing group interactions using a notion of n-projected graph whose accumulation contains information on up to n-way interactions, and quantify the accuracy of solving a task as n grows for various datasets. As a downstream task, we consider hyperedge prediction, an extension of link prediction, which is a canonical task for evaluating graph models. Through experiments on 15 real-world datasets, we draw the following messages: (a) Diminishing returns: small n is enough to achieve accuracy comparable with near-perfect approximations, (b) Troubleshooter: as the task becomes more challenging, larger n brings more benefit, and (c) Irreducibility: datasets whose pairwise interactions do not tell much about higher-order interactions lose much accuracy when reduced to pairwise abstractions.

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

↑