• Login
    View Item 
    •   Home
    • Research
    • Conference Papers
    • View Item
    •   Home
    • Research
    • Conference Papers
    • View Item
    JavaScript is disabled for your browser. Some features of this site may not work without it.

    Browse

    All of KAUSTCommunitiesIssue DateSubmit DateThis CollectionIssue DateSubmit Date

    My Account

    Login

    Quick Links

    Open Access PolicyORCID LibguideTheses and Dissertations LibguideSubmit an Item

    Statistics

    Display statistics

    Spatio-Temporal Attention based Recurrent Neural Network for Next Location Prediction

    • CSV
    • RefMan
    • EndNote
    • BibTex
    • RefWorks
    Thumbnail
    Name:
    STRNN_NextLocationPrediction.pdf
    Size:
    406.3Kb
    Format:
    PDF
    Description:
    Accepted Manuscript
    Download
    Type
    Conference Paper
    Authors
    Altaf, Basmah cc
    Yu, Lu
    Zhang, Xiangliang cc
    KAUST Department
    Computer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
    Computer Science Program
    Date
    2019-01-25
    Online Publication Date
    2019-01-25
    Print Publication Date
    2018-12
    Permanent link to this record
    http://hdl.handle.net/10754/631709
    
    Metadata
    Show full item record
    Abstract
    With the advances in technology and smart devices, more and more attention has been paid to model spatial correlations, temporal dynamics, and friendship influence over point-of-interest (POI) checkins. Besides directly capturing general user's checkin behavior, existing works mostly highlight the intrinsic feature of POIs, i.e., spatial and temporal dependency. Among them, the family of methods based on Markov chain can capture the instance-level interaction between a pair of POI checkins, while recurrent neural network (RNN) based approaches (state-of-the-art) can deal with flexible length of checkin sequence. However, the former is not good at capturing high-order POI transition dependency, and the latter cannot distinguish the exact contribution of each POI in a historical checkin sequence. Moreover, in recurrent neural networks, local and global information is propagated along the sequence through one bottleneck i.e., hidden states only.In this work, we design a novel model to enforce contextual constraints on sequential data by designing a spatial and temporal attention mechanisms over recurrent neural network that leverages the importance of POIs visited by users in given time interval and geographical distance in successive checkins. Attention mechanism helps us to learn which POIs bounded by time difference and spatial distance in user checkin history are important for the prediction of next POI. Moreover, we also consider periodicity and friendship influence in our model design. Experimental results on two real location based social networks Gowalla, and BrightKite show that our proposed method outperforms the existing state-of-the-art deep neural network methods for next POI prediction and understanding user transition behavior. We also analyze the sensitivity of parameters including context window for capturing sequential effect, temporal context window for estimating temporal attention and spatial context window for estimating spatial attention respectively.
    Citation
    Altaf B, Yu L, Zhang X (2018) Spatio-Temporal Attention based Recurrent Neural Network for Next Location Prediction. 2018 IEEE International Conference on Big Data (Big Data). Available: http://dx.doi.org/10.1109/BigData.2018.8622218.
    Sponsors
    This work is supported by King Abdullah University of Science and Technology (KAUST), Saudi Arabia.
    Publisher
    Institute of Electrical and Electronics Engineers (IEEE)
    Journal
    2018 IEEE International Conference on Big Data (Big Data)
    Conference/Event name
    2018 IEEE International Conference on Big Data, Big Data 2018
    DOI
    10.1109/BigData.2018.8622218
    Additional Links
    https://ieeexplore.ieee.org/document/8622218
    ae974a485f413a2113503eed53cd6c53
    10.1109/BigData.2018.8622218
    Scopus Count
    Collections
    Conference Papers; Computer Science Program; Computer, Electrical and Mathematical Science and Engineering (CEMSE) Division

    entitlement

     
    DSpace software copyright © 2002-2023  DuraSpace
    Quick Guide | Contact Us | KAUST University Library
    Open Repository is a service hosted by 
    Atmire NV
     

    Export search results

    The export option will allow you to export the current search results of the entered query to a file. Different formats are available for download. To export the items, click on the button corresponding with the preferred download format.

    By default, clicking on the export buttons will result in a download of the allowed maximum amount of items. For anonymous users the allowed maximum amount is 50 search results.

    To select a subset of the search results, click "Selective Export" button and make a selection of the items you want to export. The amount of items that can be exported at once is similarly restricted as the full export.

    After making a selection, click one of the export format buttons. The amount of items that will be exported is indicated in the bubble next to export format.