Metraipolis › archive › dc_2c145dcb2ff5

Do All Nodes Benefit Equally from Knowledge Graphs? Adaptive Node-Aware KG Fusion for Recommendation — arXiv:2609.05909

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.05909
License (as archived)
CC0-1.0
Archived
2026-10-16T15:05:18.519Z
SHA-256 of the archived text
12304ac52c33036318a70ae53f669d40cce39e5c7f387576770d67fde229e368
Stable URL of this page
https://metraipolis.com/documento/dc_2c145dcb2ff5

How to cite

Do All Nodes Benefit Equally from Knowledge Graphs? Adaptive Node-Aware KG Fusion for Recommendation — arXiv:2609.05909 — arXiv (en), https://arxiv.org/abs/2609.05909 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_2c145dcb2ff5 (Metraipolis archive dc_2c145dcb2ff5, sha256 12304ac52c33036318a70ae53f669d40cce39e5c7f387576770d67fde229e368)
BibTeX
@misc{dc2c145dcb2ff5,
  title = {Do All Nodes Benefit Equally from Knowledge Graphs? Adaptive Node-Aware KG Fusion for Recommendation — arXiv:2609.05909},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.05909},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_2c145dcb2ff5; sha256 12304ac52c33036318a70ae53f669d40cce39e5c7f387576770d67fde229e368},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.05909. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

KG-aware recommendation has been widely studied to alleviate data sparsity by using knowledge graphs (KGs), which represent items, entities, and their relations as graphs and provide item-side knowledge. However, existing methods incorporate item knowledge without considering how much each user or item node should rely on it. As a result, they apply KG signals indiscriminately across nodes, even to nodes whose collaborative filtering (CF) signals from the interaction graph (IG) are already reliable. In this paper, we propose AdaKG (Adaptive Node-Aware KG Fusion), a novel KG-aware recommendation method that adaptively adjusts the contribution of auxiliary knowledge for each node. Since user-item interactions and item knowledge provide different types of signals, directly mixing them can distort the CF signals. To avoid this, AdaKG separately encodes the IG and KG with view-specific encoders, allowing each view to capture its own information. It then estimates how strongly each node should rely on item knowledge by measuring the stability of its CF signals under small adversarial perturbations, assigning a larger KG contribution to less stable nodes. Finally, AdaKG adaptively aligns the IG and KG embeddings in a shared space and fuses them according to the estimated node-wise reliance. Through experiments, we show that AdaKG achieves strong performance compared with its baselines and the effectiveness of our adaptive fusion strategy.

Tema degli esploratori: statistica e scienza dei dati (retro-catalogo arXiv: annunci del 2026-09-09 in cs.IR).
Categorie arXiv: Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2609.05909 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T14:49:33.935Z dalla pagina https://arxiv.org/catchup/cs.IR/2026-09-09?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).