Next point-of-interest recommendation by sequential feature mining and public preference awareness

2021 ◽  
Vol 40 (3) ◽  
pp. 4075-4090
Author(s):  
Meihui Shi ◽  
Derong Shen ◽  
Yue Kou ◽  
Tiezheng Nie ◽  
Ge Yu

With the widespread of location-based social networks (LBSNs), the amount of check-in data grows rapidly, which helps to recommend the next point-of-interest (POI). Extracting sequential patterns from check-in data has become a meaningful way for next POI recommendation, since human movement exhibits sequential patterns in LBSNs. However, due to the check-ins’ sparsity problem, exploiting sequential patterns in next POI recommendation is a challenging issue, which makes the learned sequential patterns unreliable. Inspired by the fact that auxiliary information can be incorporated to alleviate this situation, in this paper, we model sequential transition based on both item-wise check-in sequences and region-wise spatial information. Besides, we propose an attention-aware recurrent neural network (ATTRNN) to learn the contribution of different time steps. Furthermore, considering users’ decision-making is influenced by public’s common preference to some extent, we design a novel framework, namely HSP (short for “Hybrid model based on Sequential feature mining and Public preference awareness”), to recommend POIs for a given user. We conduct a comprehensive performance evaluation for HSP on two real-world datasets. Experimental results demonstrate that compared to other state-of-the-art techniques, the proposed HSP achieves significantly improvements.

Author(s):  
Yang Li ◽  
Tong Chen ◽  
Yadan Luo ◽  
Hongzhi Yin ◽  
Zi Huang

Being an indispensable component in location-based social networks, next point-of-interest (POI) recommendation recommends users unexplored POIs based on their recent visiting histories. However, existing work mainly models check-in data as isolated POI sequences, neglecting the crucial collaborative signals from cross-sequence check-in information. Furthermore, the sparse POI-POI transitions restrict the ability of a model to learn effective sequential patterns for recommendation. In this paper, we propose Sequence-to-Graph (Seq2Graph) augmentation for each POI sequence, allowing collaborative signals to be propagated from correlated POIs belonging to other sequences. We then devise a novel Sequence-to-Graph POI Recommender (SGRec), which jointly learns POI embeddings and infers a user's temporal preferences from the graph-augmented POI sequence. To overcome the sparsity of POI-level interactions, we further infuse category-awareness into SGRec with a multi-task learning scheme that captures the denser category-wise transitions. As such, SGRec makes full use of the collaborative signals for learning expressive POI representations, and also comprehensively uncovers multi-level sequential patterns for user preference modelling. Extensive experiments on two real-world datasets demonstrate the superiority of SGRec against state-of-the-art methods in next POI recommendation.


Author(s):  
Kangzhi Zhao ◽  
Yong Zhang ◽  
Hongzhi Yin ◽  
Jin Wang ◽  
Kai Zheng ◽  
...  

Next Point-of-Interest (POI) recommendation plays an important role in location-based services. State-of-the-art methods learn the POI-level sequential patterns in the user's check-in sequence but ignore the subsequence patterns that often represent the socio-economic activities or coherence of preference of the users. However, it is challenging to integrate the semantic subsequences due to the difficulty to predefine the granularity of the complex but meaningful subsequences. In this paper, we propose Adaptive Sequence Partitioner with Power-law Attention (ASPPA) to automatically identify each semantic subsequence of POIs and discover their sequential patterns. Our model adopts a state-based stacked recurrent neural network to hierarchically learn the latent structures of the user's check-in sequence. We also design a power-law attention mechanism to integrate the domain knowledge in spatial and temporal contexts. Extensive experiments on two real-world datasets demonstrate the effectiveness of our model.


Author(s):  
Hao Wang ◽  
Huawei Shen ◽  
Wentao Ouyang ◽  
Xueqi Cheng

Point-of-interest (POI) recommendation, i.e., recommending unvisited POIs for users, is a fundamental problem for location-based social networks. POI recommendation distinguishes itself from traditional item recommendation, e.g., movie recommendation, via geographical influence among POIs. Existing methods model the geographical influence between two POIs as the probability or propensity that the two POIs are co-visited by the same user given their physical distance. These methods assume that geographical influence between POIs is determined by their physical distance, failing to capture the asymmetry of geographical influence and the high variation of geographical influence across POIs. In this paper, we exploit POI-specific geographical influence to improve POI recommendation. We model the geographical influence between two POIs using three factors: the geo-influence of POI, the geo-susceptibility of POI, and their physical distance. Geo-influence captures POI?s capacity at exerting geographical influence to other POIs, and geo-susceptibility reflects POI?s propensity of being geographically influenced by other POIs. Experimental results on two real-world datasets demonstrate that POI-specific geographical influence significantly improves the performance of POI recommendation.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-18 ◽  
Author(s):  
Lei Guo ◽  
Haoran Jiang ◽  
Xiyu Liu ◽  
Changming Xing

As one of the important techniques to explore unknown places for users, the methods that are proposed for point-of-interest (POI) recommendation have been widely studied in recent years. Compared with traditional recommendation problems, POI recommendations are suffering from more challenges, such as the cold-start and one-class collaborative filtering problems. Many existing studies have focused on how to overcome these challenges by exploiting different types of contexts (e.g., social and geographical information). However, most of these methods only model these contexts as regularization terms, and the deep information hidden in the network structure has not been fully exploited. On the other hand, neural network-based embedding methods have shown its power in many recommendation tasks with its ability to extract high-level representations from raw data. According to the above observations, to well utilize the network information, a neural network-based embedding method (node2vec) is first exploited to learn the user and POI representations from a social network and a predefined location network, respectively. To deal with the implicit feedback, a pair-wise ranking-based method is then introduced. Finally, by regarding the pretrained network representations as the priors of the latent feature factors, an embedding-based POI recommendation method is proposed. As this method consists of an embedding model and a collaborative filtering model, when the training data are absent, the predictions will mainly be generated by the extracted embeddings. In other cases, this method will learn the user and POI factors from these two components. Experiments on two real-world datasets demonstrate the importance of the network embeddings and the effectiveness of our proposed method.


Author(s):  
Jing He ◽  
Xin Li ◽  
Lejian Liao

Next Point-of-interest (POI) recommendation has become an important task for location-based social networks (LBSNs). However, previous efforts suffer from the high computational complexity and the transition pattern between POIs has not been well studied. In this paper, we propose a two-fold approach for next POI recommendation. First, the preferred next category is predicted by using a third-rank tensor optimized by a Listwise Bayesian Personalized Ranking (LBPR) approach. Specifically we introduce two functions, namely Plackett-Luce model and cross entropy, to generate the likelihood of ranking list for posterior computation. Then POI candidates filtered by the predicated category are ranked based on the spatial influence and category ranking influence. Extensive experiments on two real-world datasets demonstrate the significant improvements of our methods over several state-of-the-art methods.


Author(s):  
Huayu Li ◽  
Yong Ge ◽  
Defu Lian ◽  
Hao Liu

Point-of-Interest (POI) recommendation has been an important service on location-based social networks. However, it is very challenging to generate accurate recommendations due to the complex nature of user's interest in POI and the data sparseness. In this paper, we propose a novel unified approach that could effectively learn fine-grained and interpretable user's interest, and adaptively model the missing data. Specifically, a user's general interest in POI is modeled as a mixture of her intrinsic and extrinsic interests, upon which we formulate the ranking constraints in our unified recommendation approach. Furthermore, a self-adaptive location-oriented method is proposed to capture the inherent property of missing data, which is formulated as squared error based loss in our unified optimization objective. Extensive experiments on real-world datasets demonstrate the effectiveness and advantage of our approach.


Complexity ◽  
2019 ◽  
Vol 2019 ◽  
pp. 1-8 ◽  
Author(s):  
Lei Tang ◽  
Dandan Cai ◽  
Zongtao Duan ◽  
Junchi Ma ◽  
Meng Han ◽  
...  

Point-of-interest (POI) recommendations are a popular form of personalized service in which users share their POI location and related content with their contacts in location-based social networks (LBSNs). The similarity and relatedness between users of the same POI type are frequently used for trajectory retrieval, but most of the existing works rely on the explicit characteristics from all users’ check-in records without considering individual activities. We propose a POI recommendation method that attempts to optimally recommend POI types to serve multiple users. The proposed method aims to predict destination POIs of a user and search for similar users of the same regions of interest, thus optimizing the user acceptance rate for each recommendation. The proposed method also employs the variable-order Markov model to determine the distribution of a user’s POIs based on his or her travel histories in LBSNs. To further enhance the user’s experience, we also apply linear discriminant analysis to cluster the topics related to “Travel” and connect to users with social links or similar interests. The probability of POIs based on users’ historical trip data and interests in the same topics can be calculated. The system then provides a list of the recommended destination POIs ranked by their probabilities. We demonstrate that our work outperforms collaborative-filtering-based and other methods using two real-world datasets from New York City. Experimental results show that the proposed method is better than other models in terms of both accuracy and recall. The proposed POI recommendation algorithms can be deployed in certain online transportation systems and can serve over 100,000 users.


Complexity ◽  
2018 ◽  
Vol 2018 ◽  
pp. 1-16 ◽  
Author(s):  
Jinpeng Chen ◽  
Wen Zhang ◽  
Pei Zhang ◽  
Pinguang Ying ◽  
Kun Niu ◽  
...  

An increasing number of users have been attracted by location-based social networks (LBSNs) in recent years. Meanwhile, user-generated content in online LBSNs like spatial, temporal, and social information provides an ever-increasing chance to study the human behavior movement from their spatiotemporal mobility patterns and spawns a large number of location-based applications. For instance, one of such applications is to produce personalized point of interest (POI) recommendations that users are interested in. Different from traditional recommendation methods, the recommendations in LBSNs come with two vital dimensions, namely, geographical and temporal. However, previously proposed methods do not adequately explore geographical influence and temporal influence. Therefore, fusing geographical and temporal influences for better recommendation accuracy in LBSNs remains potential. In this work, our aim is to generate a top recommendation list of POIs for a target user. Specially, we explore how to produce the POI recommendation by leveraging spatiotemporal information. In order to exploit both geographical and temporal influences, we first design a probabilistic method to initially detect users’ spatial orientation by analyzing visibility weights of POIs which are visited by them. Second, we perform collaborative filtering by detecting users’ temporal preferences. At last, for making the POI recommendation, we combine the aforementioned two approaches, that is, integrating the spatial and temporal influences, to construct a unified framework. Our experimental results on two real-world datasets indicate that our proposed method outperforms the current state-of-the-art POI recommendation approaches.


Author(s):  
Yeting Guo ◽  
Fang Liu ◽  
Zhiping Cai ◽  
Hui Zeng ◽  
Li Chen ◽  
...  

Point-of-Interest (POI) recommendation is significant in location-based social networks to help users discover new locations of interest. Previous studies on such recommendation mainly adopted a centralized learning framework where check-in data were uploaded, trained and predicted centrally in the cloud. However, such a framework suffers from privacy risks caused by check-in data exposure and fails to meet real-time recommendation needs when the data volume is huge and communication is blocked in crowded places. In this paper, we propose PREFER, an edge-accelerated federated learning framework for POI recommendation. It decouples the recommendation into two parts. Firstly, to protect privacy, users train local recommendation models and share multi-dimensional user-independent parameters instead of check-in data. Secondly, to improve recommendation efficiency, we aggregate these distributed parameters on edge servers in proximity to users (such as base stations) instead of remote cloud servers. We implement the PREFER prototype and evaluate its performance using two real-world datasets and two POI recommendation models. Extensive experiments demonstrate that PREFER strengthens privacy protection and improves efficiency with little sacrifice to recommendation quality compared to centralized learning. It achieves the best quality and efficiency and is more compatible with increasingly sophisticated POI recommendation models compared to other state-of-the-art privacy-preserving baselines.


2020 ◽  
Vol 5 (4) ◽  
pp. 433-447
Author(s):  
Shiwen Wu ◽  
Yuanxing Zhang ◽  
Chengliang Gao ◽  
Kaigui Bian ◽  
Bin Cui

Abstract The advances of mobile equipment and localization techniques put forward the accuracy of the location-based service (LBS) in mobile networks. One core issue for the industry to exploit the economic interest of the LBSs is to make appropriate point-of-interest (POI) recommendation based on users’ interests. Today, the LBS applications expect the recommender systems to recommend the accurate next POI in an anonymous manner, without inquiring users’ attributes or knowing the detailed features of the vast number of POIs. To cope with the challenge, we propose a novel attentive model to recommend appropriate new POIs for users, namely Geographical Attentive Recommendation via Graph (GARG), which takes full advantage of the collaborative, sequential and content-aware information. Unlike previous strategies that equally treat POIs in the sequence or manually define the relationships between POIs, GARG adaptively differentiates the relevance of POIs in the sequence to the prediction, and automatically identifies the POI-wise correlation. Extensive experiments on three real-world datasets demonstrate the effectiveness of GARG and reveal a significant improvement by GARG on the precision, recall and mAP metrics, compared to several state-of-the-art baseline methods.


Sign in / Sign up

Export Citation Format

Share Document