MiDaS:真实世界超图的代表性抽样
MiDaS: Representative Sampling from Real-world Hypergraphs
摘要:
图被广泛用于表示复杂系统中的成对相互作用。由于这样的真实世界的图是大的,往往不断增长,采样一个小的代表性的子图是必不可少的各种目的:模拟,可视化,流处理,表示学习,爬行,仅举几例。然而,许多复杂系统由群体相互作用组成(例如,研究人员的合作和在线Q&A平台上的讨论),并且因此它们可以由超图更自然和准确地表示(即,集合(sets of sets)比普通的图。受大规模超图流行的启发,我们研究了现实世界超图的代表性抽样问题,旨在回答(Q1)什么是代表性子超图以及(Q2)如何在不进行大量搜索的情况下快速找到代表性子超图.关于Q1,我们建议通过将子超图与整个超图在十个图级、超边级和节点级统计方面进行比较来衡量子超图的优劣。关于Q2,我们首先分析了11个现实世界超图的六种直观方法的特点。然后,基于分析,我们提出了MiDaS,它绘制了偏向于那些具有高度节点的超边。通过大量的实验,我们证明了MiDaS是(a)代表性的:在13种考虑的方法中找到最具代表性的样本,(b)快速:比最强的竞争对手快几个数量级,进行广泛的搜索,(c)自动:快速搜索适当程度的偏差。
英文摘要:
Graphs are widely used for representing pairwise interactions in complex systems. Since such real-world graphs are large and often evergrowing, sampling a small representative subgraph is indispensable for various purposes: simulation, visualization, stream processing, representation learning, crawling, to name a few. However, many complex systems consist of group interactions (e.g., collaborations of researchers and discussions on online Q&A platforms), and thus they can be represented more naturally and accurately by hypergraphs (i.e., sets of sets) than by ordinary graphs. Motivated by the prevalence of large-scale hypergraphs, we study the problem of representative sampling from real-world hypergraphs, aiming to answer (Q1) what a representative sub-hypergraph is and (Q2) how we can find a representative one rapidly without an extensive search. Regarding Q1, we propose to measure the goodness of a sub-hypergraph by comparing it with the entire hypergraph in terms of ten graph-level, hyperedge-level, and node-level statistics. Regarding Q2, we first analyze the characteristics of six intuitive approaches in 11 real-world hypergraphs. Then, based on the analysis, we propose MiDaS, which draws hyperedges with a bias towards those with high-degree nodes. Through extensive experiments, we demonstrate that MiDaS is (a) Representative: finding overall the most representative samples among 13 considered approaches, (b) Fast: several orders of magnitude faster than the strongest competitors, which performs an extensive search, and (c) Automatic: rapidly searching a proper degree of bias.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。