...
首页> 外文期刊>IEEE Transactions on Knowledge and Data Engineering >$l$-Injection: Toward Effective Collaborative Filtering Using
【24h】

$l$-Injection: Toward Effective Collaborative Filtering Using

机译: $ l $ -注入:通过使用有效的协作过滤

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

摘要

We develop a novel framework, named as$l$-injection, to address the sparsity problem of recommender systems. By carefully injecting low values to a selected set of unrated user-item pairs in a user-item matrix, we demonstrate that top-Nrecommendation accuracies of various collaborative filtering (CF) techniques can be significantly and consistently improved. We first adopt the notion ofpre-use preferencesof users toward a vast amount ofunrateditems. Using this notion, we identifyuninterestingitems that have not been rated yet but are likely to receive low ratings from users, and selectively impute them as low values. As our proposed approach is method-agnostic, it can be easily applied to a variety of CF algorithms. Through comprehensive experiments with three real-life datasets (e.g., Movielens, Ciao, and Watcha), we demonstrate that our solution consistently and universally enhances the accuracies of existing CF algorithms (e.g., item-based CF, SVD-based CF, and SVD++) by 2.5 to 5 times on average. Furthermore, our solution improves the running time of those CF methods by 1.2 to 2.3 times when its setting produces the best accuracy. The datasets and codes that we used in the experiments are available at:https://goo.gl/KUrmip.
机译:我们开发了一个新颖的框架,名为 n $ l $ n-injection,以解决推荐系统的稀疏性问题。通过将低值小心地注入到用户项目矩阵中的一组选定的未评级用户项目对,我们证明了top- n N n推荐各种协作过滤(CF)技术的准确性。我们首先采用 n <斜体xmlns:mml = “ http://www.w3.org/1998/Math/MathML ” xmlns:xlink = “ http://www.w3.org/1999 / xlink “>针对大量 n n: xlink = “ http://www.w3.org/1999/xlink ”>未分级 nitems。使用此概念,我们确定 n <斜体xmlns:mml = “ http://www.w3.org/1998/Math/MathML ” xmlns:xlink = “ http://www.w3.org/1999 / xlink “>不有趣的 nitem,它们尚未被评级,但很可能会受到用户的低评价,并有选择地将其归为低价值。由于我们提出的方法与方法无关,因此可以轻松地应用于各种CF算法。通过对三个真实数据集(例如Movielens,Ciao和Watcha)的综合实验,我们证明了我们的解决方案能够一致且普遍地增强现有CF算法(例如,基于项目的CF,基于SVD的CF和SVD ++)的准确性)平均2.5到5倍。此外,当设置达到最佳精度时,我们的解决方案将这些CF方法的运行时间缩短了1.2到2.3倍。我们在实验中使用的数据集和代码可在以下位置找到: n https://goo.gl/KUrmip

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号