VisitHGNN: Heterogeneous Graph Neural Networks for Modeling Point-of-Interest Visit Patterns

• URL: http://arxiv.org/abs/2510.02702v1
• Date: Fri, 03 Oct 2025 03:42:58 GMT
• Title: VisitHGNN: Heterogeneous Graph Neural Networks for Modeling Point-of-Interest Visit Patterns
• Authors: Lin Pang, Jidong J. Yang,
• Abstract summary: VisitHGNN is a relation-specific graph network designed to predict probabilities of individual Points of interest (POIs)<n>VisitHGNN achieves strong predictive performance with mean KL divergence of 0.287, MAE of 0.008, Top-1 accuracy of 0.853, and R-square of 0.853.<n>Model's potential for decision support in urban planning, transportation policy, mobility system, and public health.
• Score: 3.545082819007165
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Understanding how urban residents travel between neighborhoods and destinations is critical for transportation planning, mobility management, and public health. By mining historical origin-to-destination flow patterns with spatial, temporal, and functional relations among urban places, we estimate probabilities of visits from neighborhoods to specific destinations. These probabilities capture neighborhood-level contributions to citywide vehicular and foot traffic, supporting demand estimation, accessibility assessment, and multimodal planning. Particularly, we introduce VisitHGNN, a heterogeneous, relation-specific graph neural network designed to predict visit probabilities at individual Points of interest (POIs). POIs are characterized using numerical, JSON-derived, and textual attributes, augmented with fixed summaries of POI--POI spatial proximity, temporal co-activity, and brand affinity, while census block groups (CBGs) are described with 72 socio-demographic variables. CBGs are connected via spatial adjacency, and POIs and CBGs are linked through distance-annotated cross-type edges. Inference is constrained to a distance-based candidate set of plausible origin CBGs, and training minimizes a masked Kullback-Leibler (KL) divergence to yield probability distribution across the candidate set. Using weekly mobility data from Fulton County, Georgia, USA, VisitHGNN achieves strong predictive performance with mean KL divergence of 0.287, MAE of 0.008, Top-1 accuracy of 0.853, and R-square of 0.892, substantially outperforming pairwise MLP and distance-only baselines, and aligning closely with empirical visitation patterns (NDCG@50 = 0.966); Recall@5 = 0.611). The resulting distributions closely mirror observed travel behavior with high fidelity, highlighting the model's potential for decision support in urban planning, transportation policy, mobility system design, and public health.

Related papers

• Relation-Aware LNN-Transformer for Intersection-Centric Next-Step Prediction [0.0]
  We introduce a road-node-centric framework that represents road-user trajectories on the city's road-intersection graph.<n>By combining these cues with structural graph embeddings, we obtain semantically grounded node representations.<n>Our model outperforms six state-of-the-art baselines by up to 17 percentage points in accuracy at one hop and 10 percentage points in MRR.
  arXiv  Detail & Related papers  (2025-08-02T13:47:12Z)
• POIFormer: A Transformer-Based Framework for Accurate and Scalable Point-of-Interest Attribution [3.729614737011418]
  textsfPOIFormer is a novel Transformer-based framework for accurate and efficient POI attribution.<n>textsfPOIFormer enables accurate, efficient attribution in large, noisy mobility datasets.
  arXiv  Detail & Related papers  (2025-07-12T04:37:52Z)
• Next-Generation Travel Demand Modeling with a Generative Framework for Household Activity Coordination [12.533065786338863]
  This paper presents a learning-based travel demand modeling framework.<n>It synthesizes household-coordinated daily activity patterns based on a household's socio-demographic profiles.<n>It is fully generative, data-driven, scalable, and transferable to other regions.
  arXiv  Detail & Related papers  (2025-07-09T18:06:36Z)
• Leveraging graph neural networks and mobility data for COVID-19 forecasting [37.9506001142702]
  COVID-19 pandemic has victimized over 7 million people to date, prompting diverse research efforts.<n>Spatio-temporal models combining mobility data with machine learning have gained attention for disease forecasting.<n>Here, we explore Graph Convolutional Recurrent Network (GCRN) and Graph Convolutional Long ShortTerm Memory (GTM)<n>The aim is to forecast future values of COVID-19 cases in Brazil and China by leveraging human mobility networks.
  arXiv  Detail & Related papers  (2025-01-20T19:52:31Z)
• Adaptive Hierarchical SpatioTemporal Network for Traffic Forecasting [70.66710698485745]
  We propose an Adaptive Hierarchical SpatioTemporal Network (AHSTN) to promote traffic forecasting. AHSTN exploits the spatial hierarchy and modeling multi-scale spatial correlations. Experiments on two real-world datasets show that AHSTN achieves better performance over several strong baselines.
  arXiv  Detail & Related papers  (2023-06-15T14:50:27Z)
• 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)
• An unsupervised approach for semantic place annotation of trajectories based on the prior probability [6.710030919235883]
  We propose an unsupervised method denoted as UPAPP for semantic place annotation trajectories. The method is specifically employed to annotate the candidate place into spatial probability, duration probability, and visiting time probability. Our method achieved an overall and average accuracy of 0.712 and 0.720, respectively, indicating that the visited places can be annotated accurately without any external data.
  arXiv  Detail & Related papers  (2022-04-20T01:10:25Z)
• Approximate Bayesian Computation for an Explicit-Duration Hidden Markov Model of COVID-19 Hospital Trajectories [55.786207368853084]
  We address the problem of modeling constrained hospital resources in the midst of the COVID-19 pandemic. For broad applicability, we focus on the common yet challenging scenario where patient-level data for a region of interest are not available. We propose an aggregate count explicit-duration hidden Markov model, nicknamed the ACED-HMM, with an interpretable, compact parameterization.
  arXiv  Detail & Related papers  (2021-04-28T15:32:42Z)
• SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction [64.16212996247943]
  We present a Sparse Graph Convolution Network(SGCN) for pedestrian trajectory prediction. Specifically, the SGCN explicitly models the sparse directed interaction with a sparse directed spatial graph to capture adaptive interaction pedestrians. visualizations indicate that our method can capture adaptive interactions between pedestrians and their effective motion tendencies.
  arXiv  Detail & Related papers  (2021-04-04T03:17:42Z)
• Modeling Heterogeneous Relations across Multiple Modes for Potential Crowd Flow Prediction [26.92887395256311]
  We propose a data driven approach, named MOHER, to predict the potential crowd flow in a certain mode for a new planned site. Specifically, we first identify the neighbor regions of the target site by examining the geographical proximity. Then, to aggregate these heterogeneous relations, we devise a cross-mode relational GCN, which can learn not only the correlations but also the differences between different transportation modes.
  arXiv  Detail & Related papers  (2021-01-18T09:31:30Z)
• Spatiotemporal Relationship Reasoning for Pedestrian Intent Prediction [57.56466850377598]
  Reasoning over visual data is a desirable capability for robotics and vision-based applications. In this paper, we present a framework on graph to uncover relationships in different objects in the scene for reasoning about pedestrian intent. Pedestrian intent, defined as the future action of crossing or not-crossing the street, is a very crucial piece of information for autonomous vehicles.
  arXiv  Detail & Related papers  (2020-02-20T18:50:44Z)

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.