...
首页> 外文期刊>Physica, A. Statistical mechanics and its applications >A machine learning-based recommendation model for bipartite networks
【24h】

A machine learning-based recommendation model for bipartite networks

机译:基于机器学习的二分网络推荐模型

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

获取外文期刊封面封底 >>

       

摘要

Online user reviews on a product, service or content has been widely used for recommender systems with the spread of the internet and online applications. Link prediction is one of the popular recommender system approaches. It can benefit the structure of a social network by mapping item reviews of users to a bipartite user-item graph structure. This study aims to investigate how topological information, namely neighbor-based, path-based and random walk-based network similarity metrics, improve the prediction capability of a recommendation model. This study proposes a supervised machine learning-based link prediction model for weighted and bipartite social networks. The input features of the machine learning model are extended versions of similarity metrics for weighted and bipartite networks. Our proposed model provides 0.93 and 0.9 AUC values for the Goodreads and MovieLens datasets, respectively. Random forest and extreme gradient boosting as the ensemble models achieved the highest performances for ItemRank metric in both datasets. (C) 2020 Elsevier B.V. All rights reserved.
机译:在线用户对产品,服务或内容的用户评论已广泛用于互联网和在线应用程序的推荐系统。链路预测是流行的推荐系统方法之一。它可以通过将用户的项目审查映射到双方用户项目图结构来使社交网络的结构受益。本研究旨在调查拓扑信息,即基于邻居,基于路径和随机的网络相似度指标的探讨,提高了推荐模型的预测能力。本研究提出了一种用于加权和双链社交网络的受监督基于机器学习的链路预测模型。机器学习模型的输入特征是加权和二分网络的相似度量的扩展版本。我们所提出的模型分别为Goodreads和Movielens数据集提供0.93和0.9 AUC值。随着集合模型的随机森林和极端渐变提升,实现了两个数据集中的ItemRank度量标准的最高性能。 (c)2020 Elsevier B.v.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号