arXiv (All)
open access
Continual Graph Memory for Adaptive Recommendation under Intent Drift
This paper studies adaptive recommendation under intent drift, where feedback from each recommendation outcome can reveal whether the relational evidence used for ranking is useful, missing, or misleading. While Knowledge Graphs (KGs) provide essential semantic structure to handle these shifts, trad
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Bumblebee: Interleaved Mixed-Layer Building Blocks for Large-Scale Recommendation Systems#1011172
- Do All Nodes Benefit Equally from Knowledge Graphs? Adaptive Node-Aware KG Fusion for Recommendation#973527
- Mitigating Popularity Bias in Recommendation with Global Listwise Learning and Progressive Bi-Weighting#1129643
- Adapting Knowledge Graphs for Behavior Denoising in Sequential Recommendation#480088
- Mutable Low-Rank Sketches for Retrain-Free Recommendation#373371
Record · ID 927919
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive