Activity-aware Human Mobility Prediction with Hierarchical Graph Attention Recurrent Network

• URL: http://arxiv.org/abs/2210.07765v2
• Date: Sat, 2 Sep 2023 06:38:52 GMT
• Title: Activity-aware Human Mobility Prediction with Hierarchical Graph Attention Recurrent Network
• Authors: Yihong Tang, Junlin He, Zhan Zhao
• Abstract summary: We present Hierarchical Graph Attention Recurrent Network (HGARN) for human mobility prediction. Specifically, we construct a hierarchical graph based on all users' history mobility records. We employ a Hierarchical Graph Attention Module to capture complex time-activity-location dependencies.
• Score: 6.8500997328311
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Human mobility prediction is a fundamental task essential for various applications, including urban planning, location-based services and intelligent transportation systems. Existing methods often ignore activity information crucial for reasoning human preferences and routines, or adopt a simplified representation of the dependencies between time, activities and locations. To address these issues, we present Hierarchical Graph Attention Recurrent Network (HGARN) for human mobility prediction. Specifically, we construct a hierarchical graph based on all users' history mobility records and employ a Hierarchical Graph Attention Module to capture complex time-activity-location dependencies. This way, HGARN can learn representations with rich human travel semantics to model user preferences at the global level. We also propose a model-agnostic history-enhanced confidence (MAHEC) label to focus our model on each user's individual-level preferences. Finally, we introduce a Temporal Module, which employs recurrent structures to jointly predict users' next activities (as an auxiliary task) and their associated locations. By leveraging the predicted future user activity features through a hierarchical and residual design, the accuracy of the location predictions can be further enhanced. For model evaluation, we test the performances of our HGARN against existing SOTAs in both the recurring and explorative settings. The recurring setting focuses on assessing models' capabilities to capture users' individual-level preferences, while the results in the explorative setting tend to reflect the power of different models to learn users' global-level preferences. Overall, our model outperforms other baselines significantly in all settings based on two real-world human mobility data benchmarks. Source codes of HGARN are available at https://github.com/YihongT/HGARN.

Related papers

• Learning Time Slot Preferences via Mobility Tree for Next POI Recommendation [18.374589526048446]
  Next Point-of-Interests (POIs) recommendation task aims to provide a dynamic ranking of POIs based on users' current check-in trajectories. We introduce an innovative data structure termed the Mobility Tree'', tailored for hierarchically describing users' check-in records. We propose the Mobility Tree Network (MTNet), a multitask framework for personalized preference learning based on Mobility Trees.
  arXiv  Detail & Related papers  (2024-03-17T08:43:12Z)
• Regions are Who Walk Them: a Large Pre-trained Spatiotemporal Model Based on Human Mobility for Ubiquitous Urban Sensing [24.48869607589127]
  We propose a largetemporal model based on trajectories (RAW) to tap into the rich information within human mobility data. Our proposed method, relying solely on human mobility data without additional features, exhibits certain level of relevance in user profiling and region analysis.
  arXiv  Detail & Related papers  (2023-11-17T11:55:11Z)
• JRDB-Traj: A Dataset and Benchmark for Trajectory Forecasting in Crowds [79.00975648564483]
  Trajectory forecasting models, employed in fields such as robotics, autonomous vehicles, and navigation, face challenges in real-world scenarios. This dataset provides comprehensive data, including the locations of all agents, scene images, and point clouds, all from the robot's perspective. The objective is to predict the future positions of agents relative to the robot using raw sensory input data.
  arXiv  Detail & Related papers  (2023-11-05T18:59:31Z)
• Context-aware multi-head self-attentional neural network model for next location prediction [19.640761373993417]
  We utilize a multi-head self-attentional (A) neural network that learns location patterns from historical location visits. We demonstrate that proposed the model outperforms other state-of-the-art prediction models. We believe that the proposed model is vital for context-aware mobility prediction.
  arXiv  Detail & Related papers  (2022-12-04T23:40:14Z)
• Self-supervised Graph-based Point-of-interest Recommendation [66.58064122520747]
  Next Point-of-Interest (POI) recommendation has become a prominent component in location-based e-commerce. We propose a Self-supervised Graph-enhanced POI Recommender (S2GRec) for next POI recommendation. In particular, we devise a novel Graph-enhanced Self-attentive layer to incorporate the collaborative signals from both global transition graph and local trajectory graphs.
  arXiv  Detail & Related papers  (2022-10-22T17:29:34Z)
• Conditioned Human Trajectory Prediction using Iterative Attention Blocks [70.36888514074022]
  We present a simple yet effective pedestrian trajectory prediction model aimed at pedestrians positions prediction in urban-like environments. Our model is a neural-based architecture that can run several layers of attention blocks and transformers in an iterative sequential fashion. We show that without explicit introduction of social masks, dynamical models, social pooling layers, or complicated graph-like structures, it is possible to produce on par results with SoTA models.
  arXiv  Detail & Related papers  (2022-06-29T07:49:48Z)
• A Graph-Enhanced Click Model for Web Search [67.27218481132185]
  We propose a novel graph-enhanced click model (GraphCM) for web search. We exploit both intra-session and inter-session information for the sparsity and cold-start problems.
  arXiv  Detail & Related papers  (2022-06-17T08:32:43Z)
• Learning Self-Modulating Attention in Continuous Time Space with Applications to Sequential Recommendation [102.24108167002252]
  We propose a novel attention network, named self-modulating attention, that models the complex and non-linearly evolving dynamic user preferences. We empirically demonstrate the effectiveness of our method on top-N sequential recommendation tasks, and the results on three large-scale real-world datasets show that our model can achieve state-of-the-art performance.
  arXiv  Detail & Related papers  (2022-03-30T03:54:11Z)
• Modelling of Bi-directional Spatio-Temporal Dependence and Users' Dynamic Preferences for Missing POI Check-in Identification [38.51964956686177]
  We develop a model, named Bi-STDDP, which can integrate bi-directional-temporal dependence and users' dynamic preferences. Results demonstrate significant improvements of our model compared with state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-12-31T03:54:37Z)
• PG$^2$Net: Personalized and Group Preferences Guided Network for Next Place Prediction [6.276895823979034]
  Predicting the place to visit is a key in human mobility behavior. We propose an end-to-end framework named personalized and group preference guided network (PG$2$Net)
  arXiv  Detail & Related papers  (2021-10-15T07:02:41Z)
• Learning Dual Dynamic Representations on Time-Sliced User-Item Interaction Graphs for Sequential Recommendation [62.30552176649873]
  We devise a novel Dynamic Representation Learning model for Sequential Recommendation (DRL-SRe) To better model the user-item interactions for characterizing the dynamics from both sides, the proposed model builds a global user-item interaction graph for each time slice. To enable the model to capture fine-grained temporal information, we propose an auxiliary temporal prediction task over consecutive time slices.
  arXiv  Detail & Related papers  (2021-09-24T07:44:27Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.