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

状态密度图核

Density of States Graph Kernels

Cornell University(康奈尔大学)

Leo Huang, Andrew Graven, David Bindel

摘要:

图结构数据的一个基本问题是量化图之间的相似性。图核是用于此类任务的既定技术;特别是,那些基于随机游走和返回概率的技术已被证明在从生物信息学到社交网络再到计算机视觉的广泛应用中是有效的。然而,随机游走核通常会受到缓慢和摇晃的影响,这种影响导致游走过度强调局部图拓扑,削弱了全局结构的重要性。为了纠正这些问题,我们在更一般的状态密度框架下重铸了返回概率图内核-一个使用谱分析的镜头来揭示隐藏在谱内部的图形图案和属性的框架-并使用我们的解释来构建可扩展的,基于状态的复合密度的图形内核,它平衡了局部和全局信息,从而在大量基准数据集上实现更高的分类精度。

英文摘要:

A fundamental problem on graph-structured data is that of quantifying similarity between graphs. Graph kernels are an established technique for such tasks; in particular, those based on random walks and return probabilities have proven to be effective in wide-ranging applications, from bioinformatics to social networks to computer vision. However, random walk kernels generally suffer from slowness and tottering, an effect which causes walks to overemphasize local graph topology, undercutting the importance of global structure. To correct for these issues, we recast return probability graph kernels under the more general framework of density of states -- a framework which uses the lens of spectral analysis to uncover graph motifs and properties hidden within the interior of the spectrum -- and use our interpretation to construct scalable, composite density of states based graph kernels which balance local and global information, leading to higher classification accuracies on a host of benchmark datasets.

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

↑