Mining place-time affinity to improve POI recommendation

Junfei Wang, D. Bagul, Jun Chu, Lu Meng, S. Srihari
{"title":"Mining place-time affinity to improve POI recommendation","authors":"Junfei Wang, D. Bagul, Jun Chu, Lu Meng, S. Srihari","doi":"10.1109/INFOCT.2018.8356834","DOIUrl":null,"url":null,"abstract":"A Point of Interest(POI) is a location that one may find useful or interesting. POI recommendation is a key feature in location-based social networks (LBSNs). With the development of mobile devices and apps, POI recommendation becomes a very popular topic and it includes humongous data. Current models always suffer from the problem of data sparsity. In this paper we propose a novel transfer learning model to learn affinity between the time and places, and use the mined features to improve the performance of a content-based POI recommendation system. In particular, we use check-in data to learn latent vectors for time and place category features by non-negative matrix factorization. Then, the mined densely embedded features are input to a gradient boosting decision tree (GBDT) based pairwise scoring model, which is trained by the check-in data of another city, to do POI recommendation. We conduct our experiment on the Foursquare check-in dataset, and discover that the learned latent vectors can dramatically improve the performance of a POI recommendation system.","PeriodicalId":376443,"journal":{"name":"2018 International Conference on Information and Computer Technologies (ICICT)","volume":"114 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-03-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 International Conference on Information and Computer Technologies (ICICT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INFOCT.2018.8356834","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

A Point of Interest(POI) is a location that one may find useful or interesting. POI recommendation is a key feature in location-based social networks (LBSNs). With the development of mobile devices and apps, POI recommendation becomes a very popular topic and it includes humongous data. Current models always suffer from the problem of data sparsity. In this paper we propose a novel transfer learning model to learn affinity between the time and places, and use the mined features to improve the performance of a content-based POI recommendation system. In particular, we use check-in data to learn latent vectors for time and place category features by non-negative matrix factorization. Then, the mined densely embedded features are input to a gradient boosting decision tree (GBDT) based pairwise scoring model, which is trained by the check-in data of another city, to do POI recommendation. We conduct our experiment on the Foursquare check-in dataset, and discover that the learned latent vectors can dramatically improve the performance of a POI recommendation system.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
挖掘地点-时间相关性以改进POI推荐
兴趣点(POI)是人们可能会觉得有用或有趣的位置。POI推荐是基于位置的社交网络(LBSNs)的一个关键特性。随着移动设备和应用程序的发展,POI推荐成为一个非常热门的话题,它包含了巨大的数据。当前的模型总是受到数据稀疏性问题的困扰。在本文中,我们提出了一种新的迁移学习模型来学习时间和地点之间的亲和力,并利用挖掘的特征来提高基于内容的POI推荐系统的性能。特别地,我们使用签入数据通过非负矩阵分解来学习时间和地点类别特征的潜在向量。然后,将挖掘出的密集嵌入特征输入到基于梯度增强决策树(GBDT)的两两评分模型中,该模型由另一个城市的入住数据训练,进行POI推荐。我们在Foursquare签到数据集上进行了实验,发现学习的潜在向量可以显著提高POI推荐系统的性能。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Modeling banking processes A taxonomy of IoT: Security and privacy threats DDoS attack detection mechanism in the application layer using user features Reinforcement learning for game personalization on edge devices Stylized line rendering for three-dimensional models
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1