首页> 外文期刊>ACM transactions on intelligent systems >SPrank: Semantic Path-Based Ranking for Jop-N Recommendations Using Linked Open Data
【24h】

SPrank: Semantic Path-Based Ranking for Jop-N Recommendations Using Linked Open Data

机译:SPrank:使用链接的开放数据的Jop-N建议基于语义路径的排名

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

摘要

In most real-world scenarios, the ultimate goal of recommender system applications is to suggest a short ranked list of items, namely top-N recommendations, that will appeal to the end user. Often, the problem of computing top-N recommendations is mainly tackled with a two-step approach. The system focuses first on predicting the unknown ratings, which are eventually used to generate a ranked recommendation list. Actually, the top-N recommendation task can be directly seen as a ranking problem where the main goal is not to accurately predict ratings but to directly find the best-ranked list of items to recommend. In this article we present SPrank, a novel hybrid recommendation algorithm able to compute top-N recommendations exploiting freely available knowledge in the Web of Data. In particular, we employ DBpedia, a well-known encyclopedic knowledge base in the Linked Open Data cloud, to extract semantic path-based features and to eventually compute top-N recommendations in a learning-to-rank fashion. Experiments with three datasets related to different domains (books, music, and movies) prove the effectiveness of our approach compared to state-of-the-art recommendation algorithms.
机译:在大多数实际情况中,推荐系统应用程序的最终目标是建议一个简短的项目列表,即前N个建议,这些列表将吸引最终用户。通常,计算top-N建议的问题通常通过两步方法解决。该系统首先专注于预测未知等级,最终将其用于生成排名推荐列表。实际上,排名靠前的推荐任务可以直接视为排名问题,其主要目标不是准确地预测评分,而是直接找到要推荐的排名最高的项目。在本文中,我们介绍SPrank,这是一种新颖的混合推荐算法,能够利用Web数据中的免费可用知识来计算前N个推荐。特别是,我们使用DBpedia(链接开放数据云中的著名百科全书知识库)提取基于语义路径的功能,并最终以按等级学习的方式计算前N个推荐。与不同领域(书籍,音乐和电影)相关的三个数据集的实验证明,与最新的推荐算法相比,我们的方法是有效的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号