scholarly journals Where to Go Next: Modeling Long- and Short-Term User Preferences for Point-of-Interest Recommendation

2020 ◽  
Vol 34 (01) ◽  
pp. 214-221 ◽  
Author(s):  
Ke Sun ◽  
Tieyun Qian ◽  
Tong Chen ◽  
Yile Liang ◽  
Quoc Viet Hung Nguyen ◽  
...  
Keyword(s):  
State Of The Art ◽  
User Preferences ◽  
Short Term ◽  
Preference Modeling ◽  
Point Of Interest ◽  
Proposed Model ◽  
Poi Recommendation ◽  
Novel Method ◽  
Real World Datasets

Point-of-Interest (POI) recommendation has been a trending research topic as it generates personalized suggestions on facilities for users from a large number of candidate venues. Since users' check-in records can be viewed as a long sequence, methods based on recurrent neural networks (RNNs) have recently shown promising applicability for this task. However, existing RNN-based methods either neglect users' long-term preferences or overlook the geographical relations among recently visited POIs when modeling users' short-term preferences, thus making the recommendation results unreliable. To address the above limitations, we propose a novel method named Long- and Short-Term Preference Modeling (LSTPM) for next-POI recommendation. In particular, the proposed model consists of a nonlocal network for long-term preference modeling and a geo-dilated RNN for short-term preference learning. Extensive experiments on two real-world datasets demonstrate that our model yields significant improvements over the state-of-the-art methods.

scholarly journals MFNP: A Meta-optimized Model for Few-shot Next POI Recommendation

2021 ◽  
Author(s):  
Huimin Sun ◽  
Jiajie Xu ◽  
Kai Zheng ◽  
Pengpeng Zhao ◽  
Pingfu Chao ◽  
...  
Keyword(s):  
State Of The Art ◽  
Cold Start ◽  
User Preferences ◽  
Location Based Services ◽  
Point Of Interest ◽  
Poi Recommendation ◽  
Meta Learning ◽  
Optimized Model ◽  
Real World Datasets ◽  
Cold Start Problem

Next Point-of-Interest (POI) recommendation is of great value for location-based services. Existing solutions mainly rely on extensive observed data and are brittle to users with few interactions. Unfortunately, the problem of few-shot next POI recommendation has not been well studied yet. In this paper, we propose a novel meta-optimized model MFNP, which can rapidly adapt to users with few check-in records. Towards the cold-start problem, it seamlessly integrates carefully designed user-specific and region-specific tasks in meta-learning, such that region-aware user preferences can be captured via a rational fusion of region-independent personal preferences and region-dependent crowd preferences. In modelling region-dependent crowd preferences, a cluster-based adaptive network is adopted to capture shared preferences from similar users for knowledge transfer. Experimental results on two real-world datasets show that our model outperforms the state-of-the-art methods on next POI recommendation for cold-start users.

scholarly journals GARG: Anonymous Recommendation of Point-of-Interest in Mobile Networks by Graph Convolution Network

2020 ◽  
Vol 5 (4) ◽  
pp. 433-447
Author(s):  
Shiwen Wu ◽  
Yuanxing Zhang ◽  
Chengliang Gao ◽  
Kaigui Bian ◽  
Bin Cui
Keyword(s):  
Mobile Networks ◽  
State Of The Art ◽  
Economic Interest ◽  
Location Based Service ◽  
Vast Number ◽  
Point Of Interest ◽  
Poi Recommendation ◽  
Core Issue ◽  
Real World Datasets ◽  
Content Aware

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.

scholarly journals Neural Architecture Search for a Highly Efficient Network with Random Skip Connections

2020 ◽  
Vol 10 (11) ◽  
pp. 3712
Author(s):  
Dongjing Shan ◽  
Xiongwei Zhang ◽  
Wenhua Shi ◽  
Li Li
Keyword(s):  
State Of The Art ◽  
Cell Structure ◽  
Frequency Discrimination ◽  
Search Space ◽  
Short Term ◽  
Cell Parameters ◽  
Neural Architecture ◽  
Proposed Model ◽  
Initialization Scheme

Regarding the sequence learning of neural networks, there exists a problem of how to capture long-term dependencies and alleviate the gradient vanishing phenomenon. To manage this problem, we proposed a neural network with random connections via a scheme of a neural architecture search. First, a dense network was designed and trained to construct a search space, and then another network was generated by random sampling in the space, whose skip connections could transmit information directly over multiple periods and capture long-term dependencies more efficiently. Moreover, we devised a novel cell structure that required less memory and computational power than the structures of long short-term memories (LSTMs), and finally, we performed a special initialization scheme on the cell parameters, which could permit unhindered gradient propagation on the time axis at the beginning of training. In the experiments, we evaluated four sequential tasks: adding, copying, frequency discrimination, and image classification; we also adopted several state-of-the-art methods for comparison. The experimental results demonstrated that our proposed model achieved the best performance.

scholarly journals Discovering Subsequence Patterns for Next POI Recommendation

2020 ◽  
Author(s):  
Kangzhi Zhao ◽  
Yong Zhang ◽  
Hongzhi Yin ◽  
Jin Wang ◽  
Kai Zheng ◽  
...  
Keyword(s):  
Power Law ◽  
Domain Knowledge ◽  
State Of The Art ◽  
Location Based Services ◽  
Sequential Patterns ◽  
Economic Activities ◽  
Point Of Interest ◽  
Poi Recommendation ◽  
Latent Structures ◽  
Real World Datasets

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.

scholarly journals DMRAN:A Hierarchical Fine-Grained Attention-Based Network for Recommendation

2019 ◽  
Author(s):  
Huizhao Wang ◽  
Guanfeng Liu ◽  
An Liu ◽  
Zhixu Li ◽  
Kai Zheng
Keyword(s):  
Real World ◽  
State Of The Art ◽  
User Preferences ◽  
One Dimensional ◽  
Fine Grained ◽  
Item Level ◽  
Efficiency And Effectiveness ◽  
Time Encoding ◽  
Real World Datasets

The conventional methods for the next-item recommendation are generally based on RNN or one- dimensional attention with time encoding. They are either hard to preserve the long-term dependencies between different interactions, or hard to capture fine-grained user preferences. In this paper, we propose a Double Most Relevant Attention Network (DMRAN) that contains two layers, i.e., Item level Attention and Feature Level Self- attention, which are to pick out the most relevant items from the sequence of user’s historical behaviors, and extract the most relevant aspects of relevant items, respectively. Then, we can capture the fine-grained user preferences to better support the next-item recommendation. Extensive experiments on two real-world datasets illustrate that DMRAN can improve the efficiency and effectiveness of the recommendation compared with the state-of-the-art methods.

scholarly journals STG2Seq: Spatial-Temporal Graph to Sequence Model for Multi-step Passenger Demand Forecasting

2019 ◽  
Author(s):  
Lei Bai ◽  
Lina Yao ◽  
Salil S. Kanhere ◽  
Xianzhi Wang ◽  
Quan Z. Sheng
Keyword(s):  
State Of The Art ◽  
Demand Forecasting ◽  
Short Term ◽  
Demand Prediction ◽  
On Demand ◽  
Passenger Demand ◽  
Temporal Correlations ◽  
Output Module ◽  
Real World Datasets

Multi-step passenger demand forecasting is a crucial task in on-demand vehicle sharing services. However, predicting passenger demand is generally challenging due to the nonlinear and dynamic spatial-temporal dependencies. In this work, we propose to model multi-step citywide passenger demand prediction based on a graph and use a hierarchical graph convolutional structure to capture both spatial and temporal correlations simultaneously. Our model consists of three parts: 1) a long-term encoder to encode historical passenger demands; 2) a short-term encoder to derive the next-step prediction for generating multi-step prediction; 3) an attention-based output module to model the dynamic temporal and channel-wise information. Experiments on three real-world datasets show that our model consistently outperforms many baseline methods and state-of-the-art models.

scholarly journals A Review-Driven Neural Model for Sequential Recommendation

2019 ◽  
Author(s):  
Chenliang Li ◽  
Xichuan Niu ◽  
Xiangyang Luo ◽  
Zhenzhong Chen ◽  
Cong Quan
Keyword(s):  
Performance Improvement ◽  
State Of The Art ◽  
Neural Model ◽  
Sequential Patterns ◽  
Short Term ◽  
User Reviews ◽  
Individual Level ◽  
Significant Performance ◽  
Real World Datasets

Writing review for a purchased item is a unique channel to express a user's opinion in E-Commerce. Recently, many deep learning based solutions have been proposed by exploiting user reviews for rating prediction. In contrast, there has been few attempt to enlist the semantic signals covered by user reviews for the task of collaborative filtering. In this paper, we propose a novel review-driven neural sequential recommendation model (named RNS) by considering user's intrinsic preference (long-term) and sequential patterns (short-term). In detail, RNS is devised to encode each user or item with the aspect-aware representations extracted from the reviews. Given a sequence of historical purchased items for a user, we devise a novel hierarchical attention over attention mechanism to capture sequential patterns at both union-level and individual-level. Extensive experiments on three real-world datasets of different domains demonstrate that RNS obtains significant performance improvement over uptodate state-of-the-art sequential recommendation models.

scholarly journals Discovering Collaborative Signals for Next POI Recommendation with Iterative Seq2Graph Augmentation

2021 ◽  
Author(s):  
Yang Li ◽  
Tong Chen ◽  
Yadan Luo ◽  
Hongzhi Yin ◽  
Zi Huang
Keyword(s):  
Social Networks ◽  
State Of The Art ◽  
User Preference ◽  
Sequential Patterns ◽  
Preference Modelling ◽  
Point Of Interest ◽  
Poi Recommendation ◽  
Multi Level ◽  
Real World Datasets ◽  
Location Based Social Networks

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.

scholarly journals An Attention-Based Recommender System to Predict Contextual Intent Based on Choice Histories across and within Sessions

2018 ◽  
Vol 8 (12) ◽  
pp. 2426 ◽  
Author(s):  
Ruo Huang ◽  
Shelby McIntyre ◽  
Meina Song ◽  
Haihong E ◽  
Zhonghong Ou
Keyword(s):  
Recommender Systems ◽  
State Of The Art ◽  
User Profile ◽  
Vital Role ◽  
Short Term ◽  
Novel Approach ◽  
Learning Techniques ◽  
Real World Datasets ◽  
Near Future

Recent years have witnessed the growth of recommender systems, with the help of deep learning techniques. Recurrent Neural Networks (RNNs) play an increasingly vital role in various session-based recommender systems, since they use the user’s sequential history to build a comprehensive user profile, which helps improve the recommendation. However, a problem arises regarding how to be aware of the variation in the user’s contextual preference, especially the short-term intent in the near future, and make the best use of it to produce a precise recommendation at the start of a session. We propose a novel approach named Attention-based Short-term and Long-term Model (ASLM), to improve the next-item recommendation, by using an attention-based RNNs integrating both the user’s short-term intent and the long-term preference at the same time with a two-layer network. The experimental study on three real-world datasets and two sub-datasets demonstrates that, compared with other state-of-the-art methods, the proposed approach can significantly improve the next-item recommendation, especially at the start of sessions. As a result, our proposed approach is capable of coping with the cold-start problem at the beginning of each session.

scholarly journals Maturity, Indebtedness, and Default Risk

2012 ◽  
Vol 102 (6) ◽  
pp. 2674-2699 ◽  
Author(s):  
Satyajit Chatterjee ◽  
Burcu Eyigungor
Keyword(s):  
Standard Deviation ◽  
Default Risk ◽  
Sovereign Debt ◽  
External Debt ◽  
Equilibrium Price ◽  
Short Term ◽  
Price Function ◽  
Output Ratio ◽  
Novel Method

We advance quantitative-theoretic models of sovereign debt by proving the existence of a downward sloping equilibrium price function for long-term debt and implementing a novel method to accurately compute it. We show that incorporating long-term debt allows the model to match Argentina's average external debt-to-output ratio, average spread on external debt, the standard deviation of spreads, and simultaneously improve upon the model's ability to account for Argentina's other cyclical facts. We also investigated the welfare properties of maturity length and showed that if the possibility of self-fulfilling rollover crises is taken into account, long-term debt is superior to short-term debt. (JEL E23, E32, F34, O11, O19)

Sign in / Sign up

Export Citation Format

Share Document