Point-of-interest(POI)recommendations in location-based social networks(LBSNs)have developed rapidly by incorporating feature information and deep learning methods.However,most studies have failed to accurately reflec...Point-of-interest(POI)recommendations in location-based social networks(LBSNs)have developed rapidly by incorporating feature information and deep learning methods.However,most studies have failed to accurately reflect different users’preferences,in particular,the short-term preferences of inactive users.To better learn user preferences,in this study,we propose a long-short-term-preference-based adaptive successive POI recommendation(LSTP-ASR)method by combining trajectory sequence processing,long short-term preference learning,and spatiotemporal context.First,the check-in trajectory sequences are adaptively divided into recent and historical sequences according to a dynamic time window.Subsequently,an adaptive filling strategy is used to expand the recent check-in sequences of users with inactive check-in behavior using those of similar active users.We further propose an adaptive learning model to accurately extract long short-term preferences of users to establish an efficient successive POI recommendation system.A spatiotemporal-context-based recurrent neural network and temporal-context-based long short-term memory network are used to model the users’recent and historical checkin trajectory sequences,respectively.Extensive experiments on the Foursquare and Gowalla datasets reveal that the proposed method outperforms several other baseline methods in terms of three evaluation metrics.More specifically,LSTP-ASR outperforms the previously best baseline method(RTPM)with a 17.15%and 20.62%average improvement on the Foursquare and Gowalla datasets in terms of the Fβmetric,respectively.展开更多
Cruising route recommendation based on trajectory mining can improve taxi-drivers'income and reduce energy consumption.However,existing methods mostly recommend pick-up points for taxis only.Moreover,their perform...Cruising route recommendation based on trajectory mining can improve taxi-drivers'income and reduce energy consumption.However,existing methods mostly recommend pick-up points for taxis only.Moreover,their performance is not good enough since there lacks a good evaluation model for the pick-up points.Therefore,we propose an entropy-based model for recommendation of taxis'cruising route.Firstly,we select more positional attributes from historical pick-up points in order to obtain accurate spatial-temporal features.Secondly,the information entropy of spatial-temporal features is integrated in the evaluation model.Then it is applied for getting the next pick-up points and further recommending a series of successive points.These points are constructed a cruising route for taxi-drivers.Experimental results show that our method is able to obviously improve the recommendation accuracy of pick-up points,and help taxi-drivers make profitable benefits more than before.展开更多
We consider the problem of finding map regions that best match query keywords. This region search problem can be applied in many practical scenarios such as shopping recommendation, searching for tourist attractions, ...We consider the problem of finding map regions that best match query keywords. This region search problem can be applied in many practical scenarios such as shopping recommendation, searching for tourist attractions, and collision region detection for wireless sensor networks. While conventional map search retrieves isolate locations in a map, users frequently attempt to find regions of interest instead, e.g., detecting regions having too many wireless sensors to avoid collision, or finding shopping areas featuring various merchandise or tourist attractions of different styles. Finding regions of interest in a map is a non-trivial problem and retrieving regions of arbitrary shapes poses particular challenges. In this paper, we present a novel region search algorithm, dense region search(DRS), and its extensions, to find regions of interest by estimating the density of locations containing the query keywords in the region. Experiments on both synthetic and real-world datasets demonstrate the effectiveness of our algorithm.展开更多
With the wide application of location-based social networks(LBSNs),personalized point of interest(POI)recommendation becomes popular,especially in the commercial field.Unfortunately,it is challenging to accurately rec...With the wide application of location-based social networks(LBSNs),personalized point of interest(POI)recommendation becomes popular,especially in the commercial field.Unfortunately,it is challenging to accurately recommend POIs to users because the user-POI matrix is extremely sparse.In addition,a user's check-in activities are affected by many influential factors.However,most of existing studies capture only few influential factors.It is hard for them to be extended to incorporate other heterogeneous information in a unified way.To address these problems,we propose a meta-path-based deep representation learning(MPDRL)model for personalized POI recommendation.In this model,we design eight types of meta-paths to fully utilize the rich heterogeneous information in LBSNs for the representations of users and POIs,and deeply mine the correlations between users and POIs.To further improve the recommendation performance,we design an attention-based long short-term memory(LSTM)network to learn the importance of different influential factors on a user's specific check-in activity.To verify the effectiveness of our proposed method,we conduct extensive experiments on a real-world dataset,Foursquare.Experimental results show that the MPDRL model improves at least 16.97%and 23.55%over all comparison methods in terms of the metric Precision@N(Pre@N)and Recall@N(Rec@N)respectively.展开更多
随着基于位置社交网络(Location-Based Social Networks,LBSN)的快速发展,兴趣点(Point-of-Interest,POI)推荐为基于位置的服务提供了前所未有的机会.兴趣点推荐是一种基于上下文信息的位置感知的个性化推荐.然而用户-兴趣点矩阵的极端...随着基于位置社交网络(Location-Based Social Networks,LBSN)的快速发展,兴趣点(Point-of-Interest,POI)推荐为基于位置的服务提供了前所未有的机会.兴趣点推荐是一种基于上下文信息的位置感知的个性化推荐.然而用户-兴趣点矩阵的极端稀疏给兴趣点推荐的研究带来严峻挑战.为处理数据稀疏问题,文中利用兴趣点的地理、文本、社会、分类与流行度信息,并将这些因素进行有效地融合,提出一种上下文感知的概率矩阵分解兴趣点推荐算法,称为TGSC-PMF.首先利用潜在狄利克雷分配(Latent Dirichlet Allocation,LDA)模型挖掘兴趣点相关的文本信息学习用户的兴趣话题生成兴趣相关分数;其次提出一种自适应带宽核评估方法构建地理相关性生成地理相关分数;然后通过用户社会关系的幂律分布构建社会相关性生成社会相关分数;另外结合用户的分类偏好与兴趣点的流行度构建分类相关性生成分类相关分数,最后利用概率矩阵分解模型(Probabilistic Matrix Factorization,PMF),将兴趣、地理、社会、分类的相关分数进行有效地融合,从而生成推荐列表推荐给用户感兴趣的兴趣点.该文在一个真实LBSN签到数据集上进行实验,结果表明该算法相比其他先进的兴趣点推荐算法具有更好的推荐效果.展开更多
随着大数据技术的快速发展,推荐系统成为大数据领域里的一个重要的研究方向.随着基于位置社交网络(Location-Based Social Networks,LBSN)的快速发展,兴趣点(Point-Of-Interest,POI)推荐成为一个重要的研究热点,帮助人们发现有趣的并吸...随着大数据技术的快速发展,推荐系统成为大数据领域里的一个重要的研究方向.随着基于位置社交网络(Location-Based Social Networks,LBSN)的快速发展,兴趣点(Point-Of-Interest,POI)推荐成为一个重要的研究热点,帮助人们发现有趣的并吸引人的位置,特别是当用户在异地旅行的时候.由于用户的签到行为具有高稀疏性,为兴趣点推荐带来很大的挑战.为处理用户签到数据的稀疏性问题,越来越多的研究结合地理影响、时间效应、社会相关性、内容信息和流行度影响这些方面的因素为提高兴趣点推荐的性能.然而,目前的研究缺乏一种综合分析上述所有因素共同作用的方法来处理兴趣点的数据稀疏问题,特别是异地推荐场景被目前大多数研究工作所忽略.针对以上所述的挑战,文中提出一种联合概率生成模型,称为GTSCP,模拟用户签到行为的决策过程,该模型有效地融合上述因素来处理数据稀疏性,特别是异地推荐场景.文章所提的兴趣点推荐方法包含离线模型和在线推荐两个部分.文中所提的GTSCP联合模型支持本地和异地两种推荐场景.文章在多个真实LBSNs的大规模签到数据集上进行实验,结果表明该算法相比其它先进的兴趣点推荐算法具有更好的推荐效果.展开更多
兴趣点(Point-Of-Interest,POI)推荐是基于位置的社交网络(Location-Based Social Networks,LBSN)中的一项重要个性化服务.由于LBSN中数据的极度稀疏性,基于协同过滤的算法推荐精度不高,文中提出基于元路径的兴趣点推荐算法.首先根据LBS...兴趣点(Point-Of-Interest,POI)推荐是基于位置的社交网络(Location-Based Social Networks,LBSN)中的一项重要个性化服务.由于LBSN中数据的极度稀疏性,基于协同过滤的算法推荐精度不高,文中提出基于元路径的兴趣点推荐算法.首先根据LBSN结构特征构建带权异构网络模型,其次引入元路径来描述节点间不同类型关联关系,基于三度影响力设置用户-兴趣点间元路径特征集,然后通过随机游走方法计算元路径特征值以度量实例路径中的首尾节点间关联度,并利用监督学习方法获得各特征的权值,最后计算特定用户将来在各兴趣点的签到概率从而生成推荐列表.文中在3个真实LBSN签到数据集上进行了实验,结果表明该算法可以有效缓解LBSN中的极度稀疏性问题,比传统推荐算法有更好的推荐效果.展开更多
随着基于位置社交网络(location-based social network,LBSN)的发展,兴趣点推荐成为满足用户个性化需求、减轻信息过载问题的重要手段.然而,已有的兴趣点推荐算法存在如下的问题:1)多数已有的兴趣点推荐算法简化用户签到频率数据,仅使...随着基于位置社交网络(location-based social network,LBSN)的发展,兴趣点推荐成为满足用户个性化需求、减轻信息过载问题的重要手段.然而,已有的兴趣点推荐算法存在如下的问题:1)多数已有的兴趣点推荐算法简化用户签到频率数据,仅使用二进制值来表示用户是否访问一个兴趣点;2)基于矩阵分解的兴趣点推荐算法把签到频率数据和传统推荐系统中的评分数据等同看待,使用高斯分布模型建模用户的签到行为;3)忽视用户签到数据的隐式反馈属性.为解决以上问题,提出一个基于Ranking的泊松矩阵分解兴趣点推荐算法.首先,根据LBSN中用户的签到行为特点,利用泊松分布模型替代高斯分布模型建模用户在兴趣点上签到行为;然后采用BPR(Bayesian personalized ranking)标准优化泊松矩阵分解的损失函数,拟合用户在兴趣点对上的偏序关系;最后,利用包含地域影响力的正则化因子约束泊松矩阵分解的过程.在真实数据集上的实验结果表明:基于Ranking的泊松矩阵分解兴趣点推荐算法的性能优于传统的兴趣点推荐算法.展开更多
基金the National Natural Science Foundation of China(Grant Nos.62102347,62376041,62172352)Guangdong Ocean University Research Fund Project(Grant No.060302102304).
文摘Point-of-interest(POI)recommendations in location-based social networks(LBSNs)have developed rapidly by incorporating feature information and deep learning methods.However,most studies have failed to accurately reflect different users’preferences,in particular,the short-term preferences of inactive users.To better learn user preferences,in this study,we propose a long-short-term-preference-based adaptive successive POI recommendation(LSTP-ASR)method by combining trajectory sequence processing,long short-term preference learning,and spatiotemporal context.First,the check-in trajectory sequences are adaptively divided into recent and historical sequences according to a dynamic time window.Subsequently,an adaptive filling strategy is used to expand the recent check-in sequences of users with inactive check-in behavior using those of similar active users.We further propose an adaptive learning model to accurately extract long short-term preferences of users to establish an efficient successive POI recommendation system.A spatiotemporal-context-based recurrent neural network and temporal-context-based long short-term memory network are used to model the users’recent and historical checkin trajectory sequences,respectively.Extensive experiments on the Foursquare and Gowalla datasets reveal that the proposed method outperforms several other baseline methods in terms of three evaluation metrics.More specifically,LSTP-ASR outperforms the previously best baseline method(RTPM)with a 17.15%and 20.62%average improvement on the Foursquare and Gowalla datasets in terms of the Fβmetric,respectively.
基金funded by the National Natural Science Foundation of China(61872139,41871320)Provincial and Municipal Joint Fund of Hunan Provincial Natural Science Foundation of China(2018JJ4052)+2 种基金Hunan Provincial Natural Science Foundation of China(2017JJ2081)the Key Project of Hunan Provincial Education Department(17A070,19A172)the Project of Hunan Provincial Education Department(17C0646).
文摘Cruising route recommendation based on trajectory mining can improve taxi-drivers'income and reduce energy consumption.However,existing methods mostly recommend pick-up points for taxis only.Moreover,their performance is not good enough since there lacks a good evaluation model for the pick-up points.Therefore,we propose an entropy-based model for recommendation of taxis'cruising route.Firstly,we select more positional attributes from historical pick-up points in order to obtain accurate spatial-temporal features.Secondly,the information entropy of spatial-temporal features is integrated in the evaluation model.Then it is applied for getting the next pick-up points and further recommending a series of successive points.These points are constructed a cruising route for taxi-drivers.Experimental results show that our method is able to obviously improve the recommendation accuracy of pick-up points,and help taxi-drivers make profitable benefits more than before.
基金supported by the Zhejiang Provincial Natural Science Foundation of China(No.LZ13F020001)the National Natural Science Foundation of China(Nos.61173185 and 61173186)+1 种基金the National Key Technology R&D Program of China(No.2012BAI34B01)the Hangzhou S&T Development Plan(No.20150834M22)
文摘We consider the problem of finding map regions that best match query keywords. This region search problem can be applied in many practical scenarios such as shopping recommendation, searching for tourist attractions, and collision region detection for wireless sensor networks. While conventional map search retrieves isolate locations in a map, users frequently attempt to find regions of interest instead, e.g., detecting regions having too many wireless sensors to avoid collision, or finding shopping areas featuring various merchandise or tourist attractions of different styles. Finding regions of interest in a map is a non-trivial problem and retrieving regions of arbitrary shapes poses particular challenges. In this paper, we present a novel region search algorithm, dense region search(DRS), and its extensions, to find regions of interest by estimating the density of locations containing the query keywords in the region. Experiments on both synthetic and real-world datasets demonstrate the effectiveness of our algorithm.
基金National Natural Science Foundation of China(No.61972080)Shanghai Rising-Star Program,China(No.19QA1400300)。
文摘With the wide application of location-based social networks(LBSNs),personalized point of interest(POI)recommendation becomes popular,especially in the commercial field.Unfortunately,it is challenging to accurately recommend POIs to users because the user-POI matrix is extremely sparse.In addition,a user's check-in activities are affected by many influential factors.However,most of existing studies capture only few influential factors.It is hard for them to be extended to incorporate other heterogeneous information in a unified way.To address these problems,we propose a meta-path-based deep representation learning(MPDRL)model for personalized POI recommendation.In this model,we design eight types of meta-paths to fully utilize the rich heterogeneous information in LBSNs for the representations of users and POIs,and deeply mine the correlations between users and POIs.To further improve the recommendation performance,we design an attention-based long short-term memory(LSTM)network to learn the importance of different influential factors on a user's specific check-in activity.To verify the effectiveness of our proposed method,we conduct extensive experiments on a real-world dataset,Foursquare.Experimental results show that the MPDRL model improves at least 16.97%and 23.55%over all comparison methods in terms of the metric Precision@N(Pre@N)and Recall@N(Rec@N)respectively.
文摘随着大数据技术的快速发展,推荐系统成为大数据领域里的一个重要的研究方向.随着基于位置社交网络(Location-Based Social Networks,LBSN)的快速发展,兴趣点(Point-Of-Interest,POI)推荐成为一个重要的研究热点,帮助人们发现有趣的并吸引人的位置,特别是当用户在异地旅行的时候.由于用户的签到行为具有高稀疏性,为兴趣点推荐带来很大的挑战.为处理用户签到数据的稀疏性问题,越来越多的研究结合地理影响、时间效应、社会相关性、内容信息和流行度影响这些方面的因素为提高兴趣点推荐的性能.然而,目前的研究缺乏一种综合分析上述所有因素共同作用的方法来处理兴趣点的数据稀疏问题,特别是异地推荐场景被目前大多数研究工作所忽略.针对以上所述的挑战,文中提出一种联合概率生成模型,称为GTSCP,模拟用户签到行为的决策过程,该模型有效地融合上述因素来处理数据稀疏性,特别是异地推荐场景.文章所提的兴趣点推荐方法包含离线模型和在线推荐两个部分.文中所提的GTSCP联合模型支持本地和异地两种推荐场景.文章在多个真实LBSNs的大规模签到数据集上进行实验,结果表明该算法相比其它先进的兴趣点推荐算法具有更好的推荐效果.
文摘兴趣点(Point-Of-Interest,POI)推荐是基于位置的社交网络(Location-Based Social Networks,LBSN)中的一项重要个性化服务.由于LBSN中数据的极度稀疏性,基于协同过滤的算法推荐精度不高,文中提出基于元路径的兴趣点推荐算法.首先根据LBSN结构特征构建带权异构网络模型,其次引入元路径来描述节点间不同类型关联关系,基于三度影响力设置用户-兴趣点间元路径特征集,然后通过随机游走方法计算元路径特征值以度量实例路径中的首尾节点间关联度,并利用监督学习方法获得各特征的权值,最后计算特定用户将来在各兴趣点的签到概率从而生成推荐列表.文中在3个真实LBSN签到数据集上进行了实验,结果表明该算法可以有效缓解LBSN中的极度稀疏性问题,比传统推荐算法有更好的推荐效果.
文摘随着基于位置社交网络(location-based social network,LBSN)的发展,兴趣点推荐成为满足用户个性化需求、减轻信息过载问题的重要手段.然而,已有的兴趣点推荐算法存在如下的问题:1)多数已有的兴趣点推荐算法简化用户签到频率数据,仅使用二进制值来表示用户是否访问一个兴趣点;2)基于矩阵分解的兴趣点推荐算法把签到频率数据和传统推荐系统中的评分数据等同看待,使用高斯分布模型建模用户的签到行为;3)忽视用户签到数据的隐式反馈属性.为解决以上问题,提出一个基于Ranking的泊松矩阵分解兴趣点推荐算法.首先,根据LBSN中用户的签到行为特点,利用泊松分布模型替代高斯分布模型建模用户在兴趣点上签到行为;然后采用BPR(Bayesian personalized ranking)标准优化泊松矩阵分解的损失函数,拟合用户在兴趣点对上的偏序关系;最后,利用包含地域影响力的正则化因子约束泊松矩阵分解的过程.在真实数据集上的实验结果表明:基于Ranking的泊松矩阵分解兴趣点推荐算法的性能优于传统的兴趣点推荐算法.
