首页> 外文期刊>Knowledge-Based Systems >One-class collaborative filtering based on rating prediction and ranking prediction
【24h】

One-class collaborative filtering based on rating prediction and ranking prediction

机译:基于评级预测和排名预测的一类协作过滤

获取原文
获取原文并翻译 | 示例
           

摘要

One-Class Collaborative Filtering (OCCF) has recently received much attention in recommendation communities due to their close relationship with real industry problem settings. However, the problem with previous research studies on OCCF is that they focused on either rating prediction or ranking prediction, but no concerted research effort has been devoted to developing a recommendation approach that simultaneously optimizes both the ratings and rank of the recommended items. In order to overcome the defects of prior research, a new better unified OCCF approach (UOCCF) based on the newest Collaborative Less-is-More Filtering (CLiMF) approach and the Probabilistic Matrix Factorization (PMF) approach was proposed, which benefits from the ranking-oriented perspective and the rating-oriented perspective by sharing common latent features of users and items in CLiMF and PMF. We also provide an efficient learning algorithm to solve the optimization problem for UOCCF. Experimental results on practical datasets showed that our proposed UOCCF approach outperformed existing OCCF approaches (both ranking-oriented and rating-oriented) over different evaluation metrics, and that the UOCCF approach enjoys the advantage of low complexity and is shown to be linear with the number of observed ratings in a given user-item rating matrix. Because of its high precision and good expansibility, UOCCF is suitable for processing big data, and has wide application prospects in the field of internet information recommendation. (C) 2017 Elsevier B.V. All rights reserved.
机译:一类协作过滤(OCCF)由于与实际行业问题的紧密联系而在推荐社区中引起了广泛关注。但是,以前关于OCCF的研究存在的问题是,它们只关注评级预测或排名预测,但是还没有一致的研究工作致力于开发同时优化建议项的评级和排名的推荐方法。为了克服现有研究的缺陷,提出了一种基于最新的协作式“少即是多过滤”(CLiMF)方法和“概率矩阵分解”(PMF)方法的更好的统一OCCF方法(UOCCF),通过共享CLiMF和PMF中用户和项目的共同潜在特征,以排名为导向的观点和以评级为导向的观点。我们还提供了一种有效的学习算法来解决UOCCF的优化问题。在实际数据集上的实验结果表明,在不同的评估指标上,我们提出的UOCCF方法优于现有的OCCF方法(面向排名和面向评级),并且UOCCF方法具有低复杂度的优势,并且与数量呈线性关系。给定用户项目评分矩阵中观察到的评分的百分比。由于UOCCF精度高,扩展性好,适合于处理大数据,在互联网信息推荐领域具有广阔的应用前景。 (C)2017 Elsevier B.V.保留所有权利。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号