首页> 外文会议>IEEE International Conference on Cloud Computing and Big Data Analysis >A novel recommendation algorithm frame for tourist Spots based on multi-clustering bipartite graphs
【24h】

A novel recommendation algorithm frame for tourist Spots based on multi-clustering bipartite graphs

机译:基于多聚类二分图的旅游景点推荐算法框架

获取原文

摘要

The purpose of this paper is study how to finding users with similar interests and recommending the tourist Spots to them effectively in big data, and use a framework for real-time recommendation. Due to the character of sparse data In field of tourism, the commonly method is according to user context, using a similarity algorithm clusters the users, Then suggesting the tourist spots to users with classical recommendation algorithm (such as collaborative filtering) in each cluster. But coupled with the rapidly increase data and more complex context, it did not work well as expect. This paper presents a novel algorithm framework which according to the real world characteristics of tourism data and based on the clustering and bipartite graphs theory. In this setting we aim to computing on-the-fly ranking of similarity tourist spots in multi-clustering, then use these result of each clustering similarity ranking to complete the real-time recommend precisely. Finally we show experimentally the accuracy of our approach with real-word data. The experiment results show that the proposed algorithm framework has a great improvement in both accuracy and real-time performance.
机译:本文的目的是研究如何在大数据中找到具有相似兴趣的用户并向其有效推荐旅游景点,并使用一种实时推荐框架。由于旅游业稀疏数据的特点,通常的方法是根据用户上下文,使用相似性算法对用户进行聚类,然后在每个聚类中采用经典推荐算法(如协同过滤)向用户推荐旅游景点。但是,加上快速增长的数据和更复杂的上下文,它并没有达到预期的效果。本文提出了一种新颖的算法框架,该算法框架根据旅游数据的真实世界特征,并基于聚类和二部图理论。在这种情况下,我们的目标是在多聚类中实时计算相似性旅游景点的排名,然后使用每个聚类相似性排名的结果来精确地完成实时推荐。最后,我们通过实验证明了我们使用实词数据的方法的准确性。实验结果表明,提出的算法框架在准确性和实时性方面都有很大的提高。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号