arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1811.01211cs.SI
收藏

基于图的可靠协作排名

Reliable graph-based collaborative ranking

Bita Shams, Saman Haratizadeh

摘要:

Grank是最近提出的一种基于图的推荐方法,它使用一种新的异构信息网络来建模用户的优先级,并对其进行分析以直接推断出推荐列表。不幸的是,GRank忽略了网络中不同类型路径背后的语义,在此过程中,它可能会使用不可靠的路径,这与邻域协作排名中相似性的一般思想不一致。这种疏忽破坏了Grank生成的推荐列表的可靠性。本文旨在提出一种新的框架,可靠的基于图的协作排名,称为ReGRank,排名项目的基础上可靠的推荐路径,在协调与语义背后的不同方法在邻里协作排名。据我们所知,ReGRank是第一个用于邻域协作排名的统一框架,除了传统的基于用户的协作排名之外,还可以适用于基于偏好和基于代表的协作排名。实验结果表明,ReGRank显着提高了国家的最先进的邻域和基于图的协同排名算法。

英文摘要:

GRank is a recent graph-based recommendation approach the uses a novel heterogeneous information network to model users' priorities and analyze it to directly infer a recommendation list. Unfortunately, GRank neglects the semantics behind different types of paths in the network and during the process, it may use unreliable paths that are inconsistent with the general idea of similarity in neighborhood collaborative ranking. That negligence undermines the reliability of the recommendation list generated by GRank. This paper seeks to present a novel framework for reliable graph-based collaborative ranking, called ReGRank, that ranks items based on reliable recommendation paths that are in harmony with the semantics behind different approaches in neighborhood collaborative ranking. To our knowledge, ReGRank is the first unified framework for neighborhood collaborative ranking that in addition to traditional user-based collaborative ranking, can also be adapted for preference-based and representative-based collaborative ranking as well. Experimental results show that ReGRank significantly improves the state-of-the art neighborhood and graph-based collaborative ranking algorithms.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑