异构信息网络上用于估计节点重要性值的深层结构知识利用与协同
Deep Structural Knowledge Exploitation and Synergy for Estimating Node Importance Value on Heterogeneous Information Networks
AI总结:
本文提出SKES框架,通过利用异构结构知识并量化节点与参考节点的差异来估计节点重要性,在三个基准上优于现有方法。
摘要:
节点重要性估计问题传统上通过同构网络拓扑分析进行研究。为了处理网络异构性,近期一些方法采用图神经模型来自动学习多样化的信息来源。然而,主要问题在于,它们完全自适应的学习过程可能导致信息探索不足,从而将该问题表述为孤立的节点价值预测,性能欠佳且可解释性较差。本文提出了一种新颖的学习框架:SKES。与以往的自动学习设计不同,SKES 利用异构结构知识来丰富节点表示的信息量。基于一个信息量足够不足的参考节点,SKES 通过量化任意输入节点与该参考节点之间的差异来估计其重要性值,从而建立了一种可解释的节点重要性计算范式。此外,SKES 深入理解“具有相似特征的节点往往具有相似的重要性值”这一规律,同时保证任意不同节点之间的信息量差异能够有序地反映在其潜在特征嵌入距离上。在三个广泛使用的基准数据集上的大量实验表明,SKES 在性能上优于近期多个竞争方法。
英文摘要:
Node importance estimation problem has been studied conventionally with homogeneous network topology analysis. To deal with network heterogeneity, a few recent methods employ graph neural models to automatically learn diverse sources of information. However, the major concern revolves around that their full adaptive learning process may lead to insufficient information exploration, thereby formulating the problem as the isolated node value prediction with underperformance and less interpretability. In this work, we propose a novel learning framework: SKES. Different from previous automatic learning designs, SKES exploits heterogeneous structural knowledge to enrich the informativeness of node representations. Based on a sufficiently uninformative reference, SKES estimates the importance value for any input node, by quantifying its disparity against the reference. This establishes an interpretable node importance computation paradigm. Furthermore, SKES dives deep into the understanding that "nodes with similar characteristics are prone to have similar importance values" whilst guaranteeing that such informativeness disparity between any different nodes is orderly reflected by the embedding distance of their associated latent features. Extensive experiments on three widely-evaluated benchmarks demonstrate the performance superiority of SKES over several recent competing methods.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。