首页> 外文会议>Pacific-Asia Conference on Knowledge Discovery and Data Mining >Discovering Both Explicit and Implicit Similarities for Cross-Domain Recommendation
【24h】

Discovering Both Explicit and Implicit Similarities for Cross-Domain Recommendation

机译:发现跨域推荐的显式和隐含的相似性

获取原文

摘要

Recommender System has become one of the most important techniques for businesses today. Improving its performance requires a thorough understanding of latent similarities among users and items. This issue is addressable given recent abundance of datasets across domains. However, the question of how to utilize this cross-domain rich information to improve recommendation performance is still an open problem. In this paper, we propose a cross-domain recommender as the first algorithm utilizing both explicit and implicit similarities between datasets across sources for performance improvement. Validated on real-world datasets, our proposed idea outperforms the current cross-domain recommendation methods by more than 2 times. Yet, the more interesting observation is that both explicit and implicit similarities between datasets help to better suggest unknown information from cross-domain sources.
机译:推荐系统已成为当今业务最重要的技术之一。提高其性能需要彻底了解用户和物品之间的潜在相似之处。在最近跨域的数据集比,这个问题是可寻址的。但是,如何利用这种跨域丰富信息来提高推荐性能的问题仍然是一个公开问题。在本文中,我们将横域推荐作为利用跨源之间的数据集之间的显式和隐含相似性的第一算法。在现实世界数据集中验证,我们提出的想法优于当前的跨域推荐方法超过2次。然而,更有趣的观察是,数据集之间的显式和隐式相似度有助于更好地建议来自跨域源的未知信息。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号