Browse State-of-the-Art › Knowledge-Aware Recommendation
Knowledge-Aware Recommendation
8 papers with code · 0 benchmarks · 1 dataset archive 2025-07-28
Benchmarks archive 2025-07-28
No benchmark for this task in the archive.
Libraries
Not in the archive: the export carries no per-task library table, so there is nothing to show at snapshot 2025-07-28.
Datasets archive 2025-07-28
1 dataset whose archive record lists this task, ordered by the archive's paper count.
Subtasks archive 2025-07-28
No subtask under this task in the archive's task tree.
Parent tasks archive 2025-07-28
Most implemented papers archive 2025-07-28
8 shown of 8 papers with code (14 tagged with this task in all), ordered by repositories listed in the archive, not by stars (the archive holds no stars, so PwC's “Social” and “Latest” sorts cannot be reproduced). Papers without a page here are shown as plain text.
-
22 Jun 2019 2 repositories listedRecently, a variety of methods have been developed for this problem, which generally try to learn effective representations of users and items and then match items to users according to their representations.
-
13 May 2025 1 repository listed Syntology ran 2 of 5 samples · 3 unverifiedTo overcome these limitations, we propose hyperbolic contrastive learning with model-augmentation for knowledge-aware recommendation.
-
24 Mar 2024 1 repository listedSpecifically, we build \textit{user preference representations} and \textit{attribute fusion representations} upon the attribute information in knowledge graphs, which are utilized to enhance \textit{collaborative…
-
28 Apr 2023 1 repository listedKnowledge graph (KG), which contains rich side information, becomes an essential part to boost the recommendation performance and improve its explainability.
-
22 Aug 2022 1 repository listedSpecifically, we first construct local and non-local graphs for user/item in KG, exploring more KG facts for KGR.
-
19 Apr 2022 1 repository listedDifferent from traditional contrastive learning methods which generate two graph views by uniform data augmentation schemes such as corruption or dropping, we comprehensively consider three different graph views for…
-
11 Apr 2022 1 repository listedFurthermore, we propose a dual item embeddings design to represent and propagate collaborative signals and knowledge associations separately, and leverage the gated aggregation to distill discriminative information for…
-
30 Jul 2018 1 repository listedBased on our linked dataset, we first preform some interesting qualitative analysis experiments, in which we discuss the effect of two important factors (i.
Syntology lines on 1 of the papers shown; no Syntology record for the others (a paper without an arXiv id cannot be joined to the graph, and absence from the graph layer is not a recorded non-run). “Ran” means the sample executed on a synthesized fixture, not that the paper's result was reproduced. Read from the graph 2026-09-24.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections