A Contextual Recurrent Collaborative Filtering framework for modelling sequences of venue checkins

https://doi.org/10.1016/j.ipm.2019.102092Get rights and content

Highlights

  • We propose the CRCF - the Contextual Recurrent Collaborative Filtering framework - which leverages users’ preferred context and the contextual information associated with the users’ sequence of checkins to model the users’ short-term preferences using a GRU-based RNN component.

  • CRCF integrates the state-of-the-art Contextual Recurrent Architecture (CARA) to effectively capture the users’ short-term preferences from their sequence of checkins by incorporating the contextual information associated with their successive checkins.

  • We show that high quality venue recommendations for both normal and cold-start users can be generated by the proposed CRCF model.

  • We show that sequential geo-based negative sampling approach can improve the effectiveness and robustness of a state-of-the-art neural-network based venue recommendation approach.

Abstract

Context-Aware Venue Recommendation (CAVR) systems aim to effectively generate a ranked list of interesting venues users should visit based on their historical feedback (e.g. checkins) and context (e.g. the time of the day or the user’s current location). Such systems are increasingly deployed by Location-based Social Networks (LBSNs) such as Foursquare and Yelp to enhance the satisfaction of the users. Matrix Factorisation (MF) is a popular Collaborative Filtering (CF) technique that can suggest relevant venues to users based on an assumption that similar users are likely to visit similar venues. In recent years, deep neural networks have been successfully applied to recommendation systems. Indeed, various approaches have been previously proposed in the literature to enhance the effectiveness of MF-based approaches by exploiting Recurrent Neural Networks (RNN) models to capture the sequential properties of observed checkins. Moreover, recently, several RNN architectures have been proposed to incorporate contextual information associated with the users’ sequence of checkins (for instance, the time interval or the geographical distance between two successive checkins) to effectively capture such short-term preferences of users. In this work, we propose a Contextual Recurrent Collaborative Filtering framework (CRCF) that leverages the users’ preferred context and the contextual information associated with the users’ sequence of checkins in order to model the users’ short-term preferences for CAVR. In particular, the CRCF framework is built upon two state-of-the-art approaches: namely Deep Recurrent Collaborative Filtering framework (DRCF) and Contextual Attention Recurrent Architecture (CARA). Thorough experiments on three large checkin and rating datasets from commercial LBSNs demonstrate the effectiveness and robustness of our proposed CRCF framework by significantly outperforming various state-of-the-art matrix factorisation approaches. In particular, the CRCF framework significantly improves NDCG@10 by 5–20% over the state-of-the-art DRCF framework (Manotumruksa, Macdonald, and Ounis, 2017a) and the CARA architecture (Manotumruksa, Macdonald, and Ounis, 2018) across the three datasets. Furthermore, the CRCF framework is less significantly risky than both the DRCF framework and the CARA architecture across the three datasets.

Introduction

Users in Location-Based Social Networks (LBSNs), such as Yelp and Foursquare, tend to search for interesting venues such as restaurants and museums to visit and can share their location with their friends by making checkins at the venues they have visited. This results in large amounts of user checkin data being received by the LBSNs. Such implicit feedback by users also provides rich information about both users and venues, and thus can be leveraged to study the users’ movement in urban cities, as well as to enhance the quality of personalised venue recommendations. Effective Context-Aware Venue Recommendation systems (CAVRs) have become an essential application for LBSNs that allow users to find interesting venues based on their historical checkins and current context (e.g. time of the day, user’s current location as well as their recently visited venues). Matrix Factorisation (MF) (Koren, Bell, & Volinsky, 2009) is a Collaborative Filtering technique that is widely used to generate a personalised ranked list of venues to the users based on their historical checkins. In particular, the MF-based approaches for CAVR typically aim to embed the users’ and venues’ preferences as well as the contextual information about the users within latent factors, which are combined with a dot product operator to estimate the user’s preference for a given venue and context.

Previous studies (Cheng, Yang, Lyu, King, 2013, Rendle, 2012, Tang, Wu, Chen, 2017, Yu, Liu, Wu, Wang, Tan, 2016, Zhang, Dai, Xu, Feng, Wang, Bian, Wang, Liu, 2014) have shown that the sequences of user’s implicit feedback (e.g. sequences of checkins or clicks) play an important role in enhancing the effectiveness of recommendation, across various scenarios. However, traditional MF-based approaches can only capture users’ long-term (static) preferences and not their short-term (dynamic) preferences. Here, dynamic preferences that are captured from the users’ recently visited venues can influence the next venue they may visit (e.g. users may prefer to visit a bar directly after a dinner at a restaurant). In recent years, various approaches have been proposed to leverage Deep Neural Network (DNN) algorithms such as Multi-Layer Perceptron (MLP), Convolutional Neural Networks (CNN) and Recurrent Neural Networks (RNN) for recommendation systems (Cheng, Koc, Harmsen, Shaked, Chandra, Aradhye, Anderson, Corrado, Chai, Ispir, et al., 2016, He, Chua, 2017, He, Liao, Zhang, Nie, Hu, Chua, 2017, Tang, Wu, Chen, 2017, Yu, Liu, Wu, Wang, Tan, 2016). Among various DNN techniques, the RNN models have been widely exploited to extend the MF-based approaches to capture users’ short-term preferences from their sequences of implicit feedback (Beutel, Covington, Jain, Xu, Li, Gatto, Chi, 2018, Smirnova, Vasile, 2017, Tang, Wu, Chen, 2017, Yu, Liu, Wu, Wang, Tan, 2016, Zhu, Li, Liao, Wang, Guan, Liu, Cai, 2017).

A common technique to incorporate RNN models (e.g. Long Short-Term Memory (LSTM) units (Hochreiter & Schmidhuber, 1997) and Gated Recurrent Units (GRU) (Chung, Gulcehre, Cho, & Bengio, 2014)) into MF-based approaches is to feed a sequence of user-venue interactions/checkins into a recurrent model and use the hidden state of the recurrent models to represent the users’ dynamic preferences (Tang, Wu, Chen, 2017, Yu, Liu, Wu, Wang, Tan, 2016, Zhang, Dai, Xu, Feng, Wang, Bian, Wang, Liu, 2014). Next, the user’s preference for a target venue is estimated by calculating the dot product between a latent factor of the user’s dynamic preferences (i.e. the output of the recurrent models) and a latent factor1 of the target venue. In addition, various approaches have been proposed to extend the RNN models to incorporate the contextual information associated with the sequences of user’s implicit feedback for many recommendation tasks (Beutel, Covington, Jain, Xu, Li, Gatto, Chi, 2018, Jing, Smola, 2017, Liu, Wu, Wang, Tan, 2016, Manotumruksa, Macdonald, Ounis, 2018, Neil, Pfeiffer, Liu, 2016, Smirnova, Vasile, 2017, Twardowski, 2016, Zhu, Li, Liao, Wang, Guan, Liu, Cai, 2017). Recently, (Manotumruksa et al., 2018) proposed a Contextual Attention Recurrent Architecture (CARA) that separately incorporates different types of contextual information associated with the users’ sequence of implicit feedback to model the users’ dynamic preferences for CAVR. The CARA architecture includes two gating mechanisms, namely a Contextual Attention Gate (CAG) and a Time- and Spatial-based Gate (TSG). The CAG controls the influence of context and the previous visited venues, while TSG controls the influence of the hidden state of the previous RNN unit, based on the time interval and the geographical distance between two successive checkins.

Similar to the RNN models proposed in the previous literature (e.g. Beutel, Covington, Jain, Xu, Li, Gatto, Chi, 2018, Smirnova, Vasile, 2017, Zhu, Li, Liao, Wang, Guan, Liu, Cai, 2017, the CARA architecture still relies on a dot product of latent factors of users and items to capture the users’ dynamic preferences in a Collaborative Filtering manner. However, previous works (He, Chua, 2017, Manotumruksa, Macdonald, Ounis, 2017a) have shown that the dot product of latent factors may not be sufficient to capture the complex structures of the user-item interactions (He et al., 2017). Recently, (Manotumruksa et al., 2017a) proposed a Deep Recurrent Collaborative Filtering framework (DRCF) for venue recommendation that leverages the MLP and RNN models to learn the complex structures of the users’ sequences of checkins by replacing the dot product with a neural architecture that can learn an arbitrary function from the sequences of user’ checkins. However, the DRCF framework still relies on the traditional RNN models that are not sufficiently flexible to incorporate the user’s preferred context as well as the contextual information associated with the user’s sequences of checkins.

Both the CARA architecture and the DRCF framework leverage the sequence of user’ implicit feedback (i.e. sequences of checkins) to capture the users’ dynamic preferences. A common challenge that arises when obtaining implicit feedback by observing checkins is that only positive feedback can be observed, and MF-based approaches trained on only positive feedback are likely to be biased to those positive instances. To address this challenge, various negative sampling approaches have been proposed (He, Liao, Zhang, Nie, Hu, Chua, 2017, Manotumruksa, Macdonald, Ounis, 2017a, Manotumruksa, Macdonald, Ounis, 2017b, Rendle, Freudenthaler, Gantner, Schmidt-Thieme, 2009, Yuan, Guo, Jose, Chen, Yu, 2016). For example, the BPR negative sampling approach proposed by Rendle et al. (2009) uniformly and randomly selects venues that the users have not visited as negative instances. Recently, Manotumruksa et al. (2017a) proposed a sequence-based (dynamic) negative sampling approach that takes the sequential properties of checkins and the geographical location of venues into account to enhance the effectiveness of venue recommendation, as well as to alleviate the cold-start user problem. In this article, we aim to address a gap between two state-of-the-art factorisation- and RNN-based approaches (namely the DRCF framework and the CARA architecture) to capture the users’ dynamic preferences when making context-aware venue recommendations, and thereby demonstrate that DRCF and CARA can be effectively combined for this task. Overall, our contributions are summarised below:

  • We propose the Contextual Recurrent Collaborative Filtering framework (CRCF), an extension of the DRCF framework (Manotumruksa et al., 2017a), which incorporates both the users’ preferred context and the contextual information associated with the sequence of checkins to effectively capture the users’ dynamic preferences for CAVR. Indeed, the original DRCF framework cannot incorporate the contextual information when generating venue recommendations. Moreover, we propose to integrate the state-of-the-art Contextual Attention Recurrent Architecture (CARA) (Manotumruksa et al., 2018) into our proposed CRCF framework to effectively capture the users’ dynamic preferences.

  • We propose to apply a novel sequence-based (dynamic) negative sampling approach proposed by Manotumruksa et al. (2017a) that takes the sequential properties of checkins as well as the geographical location of venues into account to enhance the effectiveness of our CRCF framework. This is proposed in order to alleviate the cold-start user problem.

  • We conduct thorough and comprehensive experiments on 3 large-scale real-world datasets, from Brightkite, Foursquare and Yelp, to demonstrate the effectiveness of our proposed CRCF framework for CAVR by comparing it with state-of-the-art venue recommendation approaches. Moreover, we investigate the robustness of the CRCF framework by leveraging risk analyses techniques proposed by Wang, Bennett, and Collins-Thompson (2012) and Dinçer, Macdonald, and Ounis (2014).

The experimental results presented in Section 6 demonstrate that our proposed CRCF framework consistently and significantly outperforms various state-of-the-art venue recommendation approaches in terms of effectiveness and robustness. In particular, our experimental findings are as follows:

  • The contextual information associated with the sequences of the users’ checkins (e.g. the time interval and distance between two successive checkins) is important in enhancing the quality of context-aware venue recommendation. Our proposed CRCF framework, which leverages the contextual information can significantly outperform both the state-of-the-art DRCF framework and the CARA architecture on three large datasets.

  • Leveraging the sequential order of users’ checkins as well as the geographical information of venues can enhance both the effectiveness and robustness of the CRCF framework. In particular, our experimental results show that the dynamic geo-based negative sampling approach, which takes into account both the sequential order of users checkins and the geographical information of venues, can significantly improve the effectiveness and robustness of various approaches (i.e. the DRCF and CRCF frameworks and the CARA architecture) as well as alleviate the cold-start problem.

  • Throughout our comprehensive robustness analysis experiments, we observe that our proposed CRCF framework is significantly less risky, and is less likely to generate poor venue suggestions to the users across the three used datasets, compared to the DRCF framework and the CARA architecture. Moreover, the CRCF framework is more robust than various state-of-the-art venue recommendation approaches (i.e. less likely to generate worse venue suggestions compared to a traditional CF baseline such as BPR).

This article is structured as follows: Section 2 provides the background literature on CAVR, recent trends in applying Deep Neural Networks to recommendation systems as well as various existing extensions of RNN models; Section 3 provides a brief description of the DRCF framework. Section 4 details how to extend the DRCF framework for the CAVR task and also how to integrate the CARA architecture into the resulting CRCF framework; Experimental setup and results are provided in Sections 5 & 6, respectively. Concluding remarks follow in Section 7.

Section snippets

Context-Aware Venue Recommendation (CAVR)

Collaborative Filtering (CF) techniques such as Matrix Factorisation (MF) (Koren et al., 2009), Factorisation Machines (Rendle, 2012) and Bayesian Personalised Ranking (BPR) (Rendle et al., 2009) have been widely used in recommendation systems. Such factorisation-based approaches assume that users who have visited similar venues share similar preferences, and hence are likely to visit similar venues in the future. Previous works on venue recommendation have shown that the contextual information

Deep Recurrent Collaborative Filtering framework (DRCF)

In this section, we first formalise the problem statement as well as the notations used in this article (Section 3.1). Then, we briefly describe the DRCF framework for venue recommendation in Section 3.2. Later in Section 4, we describe in detail our proposed Contextual Recurrent Collaborative Filtering (CRCF) framework, an extension of the DRCF framework that incorporates the contextual information associated with the sequences of user’s checkins to enhance the quality of CAVR.

Contextual Recurrent Collaborative Filtering framework (CRCF)

In this section, we describe a Contextual Recurrent Collaborative Filtering framework (CRCF), an extension of the DRCF framework, that can effectively incorporate different types of contextual information associated with the sequential feedback (i.e. the time interval and geographical distance between two successive checkins) to model users’ short-term (dynamic) preferences. In particular, the CRCF framework aims to generate a ranked-list of venues that a user might prefer to visit at time t

Experimental setup

In this section, we evaluate the effectiveness and robustness of our proposed Contextual Recurrent Collaborative Filtering (CRCF) framework in comparison with various matrix factorisation-based approaches. In particular, we aim to address the following research questions:

  • RQ1 Can we enhance (a) the effectiveness and (b) the robustness of the Contextual Recurrent Collaborative Filtering (CRCF) framework for CAVR, by exploiting the state-of-the-art Contextual Attention Recurrent Architecture

Experimental results

In this section, we report the effectiveness and robustness of our proposed CRCF framework in comparison with various state-of-the-art approaches. In particular, to address research questions RQ1(a) and RQ2(a), we conduct various experiments to evaluate the effectiveness of the CRCF framework under the Normal and Cold-Start settings, which are discussed in Section 6.1. Moreover, to answer research questions RQ1(b) and RQ2(b), we further perform several risk analysis experiments to investigate

Conclusions

In this article, we proposed a novel Contextual Recurrent Collaborative Filtering framework (CRCF) for Context-Aware Venue Recommendation (CAVR). Our proposed framework is built on top of two state-of-the-art deep neural network recommendation approaches, namely the Deep Recurrent Collaborative Filtering (DRCF) framework and the Contextual Attention Recurrent Architecture (CARA). By exploiting both DRCF and CARA, CRCF can effectively capture the complex structure of the users’ dynamic

References (39)

  • A. Beutel et al.

    Latent cross: Making use of context in recurrent recommender systems

    Proc. of WSDM

    (2018)
  • C. Cheng et al.

    Where you like to go next: Successive point-of-interest recommendation.

    Proc. of IJCAI

    (2013)
  • H.-T. Cheng et al.

    Wide & deep learning for recommender systems

    Proc. of DLRS

    (2016)
  • J. Chung et al.

    Empirical evaluation of gated recurrent neural networks on sequence modeling

    Proc. of NIPS

    (2014)
  • R. Deveaud et al.

    On the importance of venue-dependent features for learning to rank contextual suggestions

    Proc. of CIKM

    (2014)
  • R. Deveaud et al.

    Experiments with a venue-centric model for personalised and time-aware venue suggestion

    Proc. of CIKM

    (2015)
  • B.T. Dinçer et al.

    Hypothesis testing for the risk-sensitive evaluation of retrieval systems

    Proc. of SIGIR

    (2014)
  • K. He et al.

    Deep residual learning for image recognition

    Proc. of CVPR

    (2016)
  • X. He et al.

    Neural factorization machines for sparse predictive analytics

    Proc. of SIGIR

    (2017)
  • X. He et al.

    Neural collaborative filtering

    Proc. of WWW

    (2017)
  • X. He et al.

    Fast matrix factorization for online recommendation with implicit feedback

    Proc. of SIGIR

    (2016)
  • S. Hochreiter et al.

    Long short-term memory

    Neural Computation

    (1997)
  • H. Jing et al.

    Neural survival recommender

    Proc. of WSDM

    (2017)
  • Kim, Y. (2014). Convolutional neural networks for sentence classification....
  • Kingma, D., & Ba, J. (2014). Adam: A method for stochastic optimization....
  • Y. Koren et al.

    Matrix factorization techniques for recommender systems

    Computer

    (2009)
  • Q. Liu et al.

    Context-aware sequential recommendation

    Proc. of ICDM

    (2016)
  • Q. Liu et al.

    Predicting the next location: A recurrent model with spatial and temporal contexts

    Proc. of AAAI

    (2016)
  • S. Liu et al.

    Social regularisation in a BPR-based venue recommendation system

    Proc. of FDIA

    (2019)
  • Cited by (17)

    • The role of context fusion on accuracy, beyond-accuracy, and fairness of point-of-interest recommendation systems

      2022, Expert Systems with Applications
      Citation Excerpt :

      To summarize, all modules in CAPRI are wrapped friendly for users to deploy, and new algorithms can be easily added into this extensible and adaptable framework. We plan to keep CAPRI updated by integrating various steps described below: (1) adding different contextual POI recommendation models, e.g., STACP (Rahmani et al., 2020), iGSLR (Zhang & Chow, 2013), etc; (2) adding more advanced deep learning based POI recommendation baselines, e.g., CRCF (Manotumruksa et al., 2020), CARA (Manotumruksa et al., 2018), APOIR (Zhou et al., 2019), etc; (3) adding several evaluation metrics on both accuracy and beyond-accuracy aspects, e.g., precision, mean average precision (MAP) from accuracy and personalization, serendipity, and different variation of coverage from beyond-accuracy metrics; (4) adding more datasets such as Instagram and Swarm; (5) considering interpretability of the recommendation lists. Through an extensive empirical study, the impacts of different contextual factors on evaluation are then comprehensively analyzed.

    • Leveraging social influence based on users activity centers for point-of-interest recommendation

      2022, Information Processing and Management
      Citation Excerpt :

      Many different approaches have been suggested for the problem of POI recommendation (Berjani & Strufe, 2011; Rahmani et al., 2019; Ye, Yin, & Lee, 2010; Ye, Yin, Lee, & Lee, 2011). In fact, among them, methods based on Collaborative Filtering (CF) are the most successful approaches that address different problems of POI recommendation by considering various contextual information (Aliannejadi, Rafailidis, & Crestani, 2020; Manotumruksa, Macdonald, & Ounis, 2020; Rahmani et al., 2019). The basic idea of CF is that users who visit similar items would be interested in similar items in the future (Luo, Xia, & Zhu, 2013; Schafer, Frankowski, Herlocker, & Sen, 2007).

    • Enabling the interpretability of pretrained venue representations using semantic categories

      2022, Knowledge-Based Systems
      Citation Excerpt :

      Since real-world trajectory data is usually unstructured, in order to leverage the records for various tasks such as check-in data mining, it is essential to transform these unstructured check-ins into numerical vectors, which is referred to as check-in embedding learning. Check-in embedding learning is the heart of various check-in data mining tasks such as point-of-interest recommendation [1–6], next location prediction [7,8] and venue category retrieval [9–11]. Recent studies have made significant progress in representation learning of check-ins, which mainly model check-in sequences to learn the embedding vectors of venues based on the Word2vec framework [12–15].

    • DeepAssociate: A deep learning model exploring sequential influence and history-candidate association for sequence recommendation

      2021, Expert Systems with Applications
      Citation Excerpt :

      In addition, sequence data has been widely applied in sequential recommendation, such as point-of-interest (POI) recommendation and click-through-rate (CTR) prediction (Ren, Song, & Song, 2017; Zhang & Chow, 2015). Conventionally, most sequential recommendation methods predict user behaviors using recurrent neural networks (RNNs) (Manotumruksa et al., 2020; Wang, Guo, Chu, Hwang, & Feng, 2020). These approaches utilized an embedding layer to concatenate user-generated sequences and conveyed the embedded matrix to feature extraction layer, which alleviated the influence of sparse data and improved recommendation performance (Xu, Xu, Zhao, Sheng, Liu, Cui, & Xiong, 2019).

    • On the effects of aggregation strategies for different groups of users in venue recommendation

      2021, Information Processing and Management
      Citation Excerpt :

      However, when using the P-MCA strategy, the performance of this family is always worse. This result is particularly interesting since in some works researchers perform experiments using datasets with information from several cities grouped together (Gao, Tang, & Liu, 2015; Manotumruksa, Macdonald, & Ounis, 2019; Zhang & Chow, 2013), and as we can observe, this can affect negatively the performance of some models. From the perspective of the MCA strategies, we observe that the performance improvements obtained when using the P-MCA strategy is usually negligible.

    View all citing articles on Scopus
    View full text