arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1909.04239cs.IRcs.AIcs.LGstat.ML
收藏

PMD: An Optimal Transportation-based User Distance for Recommender Systems

The Chinese University of Hong Kong(香港中文大学);Tencent Quantum Lab(腾讯量子实验室);Tsinghua-Berkeley Shenzhen Institute(清华-伯克利深圳学院)

Yitong Meng, Xinyan Dai, Xiao Yan, James Cheng, Weiwen Liu, Benben Liao, Jun Guo, Guangyong Chen

英文摘要:

Collaborative filtering, a widely-used recommendation technique, predicts a user's preference by aggregating the ratings from similar users. As a result, these measures cannot fully utilize the rating information and are not suitable for real world sparse data. To solve these issues, we propose a novel user distance measure named Preference Mover's Distance (PMD) which makes full use of all ratings made by each user. Our proposed PMD can properly measure the distance between a pair of users even if they have no co-rated items. We show that this measure can be cast as an instance of the Earth Mover's Distance, a well-studied transportation problem for which several highly efficient solvers have been developed. Experimental results show that PMD can help achieve superior recommendation accuracy than state-of-the-art methods, especially when training data is very sparse.

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

↑