Learning edge importance in bipartite graph-based recommendations

2022 17th Conference on Computer Science and Intelligence Systems (FedCSIS)(2022)

引用 1|浏览43
暂无评分
摘要
In this work, we propose the P3 Learning to Rank (P3LTR) model, a generalization of the RP3Beta graph-based recommendation method. In our approach, we learn the importance of user-item relations based on features that are usually available in online recommendations (such as types of user-item past interactions and timestamps). We keep the simplicity and explainability of RP3Beta predictions. We report the improvements of P3LTR over RP3Beta on the OLX Jobs Interactions dataset, which we published.
更多
查看译文
关键词
edge importance,recommendations,graph-based
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要