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.
toiselle kielelle
lähdeaineistosta
arxiv.org
Tärkeimmät oivallukset
by Weikai Li,Zh... klo arxiv.org 03-14-2024
https://arxiv.org/pdf/2403.08333.pdfSyvällisempiä Kysymyksiä