.png){kind=icon}
返回
Exploration in Sequential Recommender Systems via Graph Representations
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2022.3224816.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Temporal graph networks are powerful tools for solving the cold-start problem in sequential recommender systems. However, graph models are susceptible to feedback loops and data distribution shifts. The paper proposes a simple yet efficient graph-based exploration method for the mitigation of the issues above. It adopts the counter-based state exploration from reinforcement learning to the bipartite graph domain. We suggest an approach that biases model predictions using Rooted PageRank towards locally unexplored items. The method shows competitive quality on the popular recommender systems benchmarks. We, also, provide an extensive qualitative analysis of experiment results and recommendations for our method production applications.
Keyword:
Exploration
fine-tuning
graph neural networks
GNN
graphs
interactive recommender systems
intrinsic motivation
online adaptation
pretraining
self-supervised
recommender systems
recsys
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
.png){kind=icon}
Conjugated heat transfer and temperature distributions in a gas turbine combustion liner under base-load operation基本负荷运行下燃气轮机燃烧衬里中的共轭传热和温度分布
PREAI
分享收藏
查看更多内容