POI Recommendation Based on First-Order Collaborative Filtering Tree

Jinghua Zhu, Shengchao Ma, Jinbao Li
{"title":"POI Recommendation Based on First-Order Collaborative Filtering Tree","authors":"Jinghua Zhu, Shengchao Ma, Jinbao Li","doi":"10.1109/MSN48538.2019.00058","DOIUrl":null,"url":null,"abstract":"Point-Of-Interest (POI) recommendation plays an important role in Location-Based Social Networks(LBSN), which is widely used in popular attraction recommendations and travel route planning applications. The traditional recommendation algorithms fail to make full use of social relationships, user check-in distribution features and geographic information because they only use a simple linear function to model the above features. In order to solve the existing problems, we propose a recommendation framework-NCFT(Neural Collaborative Filtering Tree), which can fuse various side information. In the NCFT model, we propose an unsupervised user check-in distribution feature extractor, namely CD-Ex, which unsupervised learning user checkin distribution features. We also propose to build a user-based collaborative filtering tree and item-based collaborative filtering tree, and use the idea of messaging to learn deep representations of users and items. In these two modules, we use multi-head attention and vanilla attention to learn the representations of users and POIs. As for the user social relationship, we use the user's friends in the user-based collaborative tree to assign weights and aggregate his friends' features. The experimental results show that our model has a significant improvement in AUC and F1 compared to other models.","PeriodicalId":368318,"journal":{"name":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 15th International Conference on Mobile Ad-Hoc and Sensor Networks (MSN)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MSN48538.2019.00058","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

Point-Of-Interest (POI) recommendation plays an important role in Location-Based Social Networks(LBSN), which is widely used in popular attraction recommendations and travel route planning applications. The traditional recommendation algorithms fail to make full use of social relationships, user check-in distribution features and geographic information because they only use a simple linear function to model the above features. In order to solve the existing problems, we propose a recommendation framework-NCFT(Neural Collaborative Filtering Tree), which can fuse various side information. In the NCFT model, we propose an unsupervised user check-in distribution feature extractor, namely CD-Ex, which unsupervised learning user checkin distribution features. We also propose to build a user-based collaborative filtering tree and item-based collaborative filtering tree, and use the idea of messaging to learn deep representations of users and items. In these two modules, we use multi-head attention and vanilla attention to learn the representations of users and POIs. As for the user social relationship, we use the user's friends in the user-based collaborative tree to assign weights and aggregate his friends' features. The experimental results show that our model has a significant improvement in AUC and F1 compared to other models.
基于一阶协同过滤树的POI推荐
兴趣点(Point-Of-Interest, POI)推荐在基于位置的社交网络(LBSN)中发挥着重要作用,被广泛应用于热门景点推荐和旅游路线规划等应用。传统的推荐算法仅使用简单的线性函数对上述特征进行建模,未能充分利用社会关系、用户签到分布特征和地理信息。为了解决存在的问题,我们提出了一种能够融合各种侧信息的推荐框架——神经协同过滤树(ncft)。在NCFT模型中,我们提出了一个无监督的用户签入分布特征提取器CD-Ex,它对用户签入分布特征进行无监督学习。我们还提出构建基于用户的协同过滤树和基于项目的协同过滤树,并利用消息传递的思想学习用户和项目的深度表示。在这两个模块中,我们使用多头注意和香草注意来学习用户和poi的表示。对于用户社交关系,我们使用基于用户的协同树中的用户好友来分配权重,并对其好友特征进行聚合。实验结果表明,与其他模型相比,我们的模型在AUC和F1方面都有显著提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信