首页> 外文会议>International Conference on intelligent science and big data engineering >Optimization of Hypergraph Based News Recommendation by Binary Decision Tree
【24h】

Optimization of Hypergraph Based News Recommendation by Binary Decision Tree

机译:基于二叉决策树的基于超图的新闻推荐优化

获取原文

摘要

News personalized recommendation has long been a favourite domain for recommender research. Traditional approaches strive to satisfy the users by constructing the users' preference profiles. Naturally, most of recent methods use users' reading history (content-based) or access pattern (collaborative filtering based) to recommend proper news articles to them. Besides, some researches encapsule the news content and access pattern in a recommender by vector space model. In this paper, we propose to use a hypergraph ranking for obtaining the preference rough, and then utilize the binary decision tree for eliminating the definition subjectivity of hypergraph. In this way, we can combine the content attributes on news content attributes, users and user's access pattern in a unified hypergraph and get more accuracy results, whereas we needn't to construct the user profile and select the possible important attributes empirically. Finally, we designed several experiments compared to the state-of-the-art methods on a real world dataset, and the results demonstrate that our approach significantly improves the accuracy, diversity, and coverage metrics in mass data.
机译:新闻个性化推荐长期以来一直是推荐者研究的最爱领域。传统的方法通过构建用户的偏好配置文件来努力满足用户的需求。自然地,大多数最新方法使用用户的阅读历史记录(基于内容)或访问模式(基于协作过滤)向他们推荐适当的新闻文章。此外,一些研究还通过向量空间模型将新闻内容和访问模式封装在推荐器中。在本文中,我们建议使用超图排名来获得偏好粗糙,然后利用二叉决策树消除超图的定义主观性。通过这种方式,我们可以将内容属性与新闻内容属性,用户和用户的访问模式结合在一起,形成一个统一的超图,从而获得更高的准确性结果,而无需构造用户配置文件并根据经验选择可能的重要属性。最后,我们设计了与真实数据集上的最新方法相比的一些实验,结果表明我们的方法显着提高了海量数据中的准确性,多样性和覆盖率指标。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号