The content discusses the importance of evaluating node influence in graphs and introduces a novel method, NORA, to efficiently calculate the impact of removing nodes. By decomposing the calculation into three parts and using gradient approximation, NORA outperforms traditional brute-force methods in terms of time and complexity. Extensive experiments on various datasets validate the effectiveness of NORA in evaluating node influence.
他の言語に翻訳
原文コンテンツから
arxiv.org
深掘り質問