An unsupervised approach for semantic place annotation of trajectories based on the prior probability

• URL: http://arxiv.org/abs/2204.09054v1
• Date: Wed, 20 Apr 2022 01:10:25 GMT
• Title: An unsupervised approach for semantic place annotation of trajectories based on the prior probability
• Authors: Junyi Cheng, Xianfeng Zhang, Peng Luo, Jie Huang, Jianfeng Huang
• Abstract summary: 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.
• Score: 6.710030919235883
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Semantic place annotation can provide individual semantics, which can be of great help in the field of trajectory data mining. Most existing methods rely on annotated or external data and require retraining following a change of region, thus preventing their large-scale applications. Herein, we propose an unsupervised method denoted as UPAPP for the semantic place annotation of trajectories using spatiotemporal information. The Bayesian Criterion is specifically employed to decompose the spatiotemporal probability of the candidate place into spatial probability, duration probability, and visiting time probability. Spatial information in ROI and POI data is subsequently adopted to calculate the spatial probability. In terms of the temporal probabilities, the Term Frequency Inverse Document Frequency weighting algorithm is used to count the potential visits to different place types in the trajectories, and generates the prior probabilities of the visiting time and duration. The spatiotemporal probability of the candidate place is then combined with the importance of the place category to annotate the visited places. Validation with a trajectory dataset collected by 709 volunteers in Beijing showed that 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.

Related papers

• VisitHGNN: Heterogeneous Graph Neural Networks for Modeling Point-of-Interest Visit Patterns [3.545082819007165]
  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.
  arXiv  Detail & Related papers  (2025-10-03T03:42:58Z)
• STRelay: A Universal Spatio-Temporal Relaying Framework for Location Prediction with Future Spatiotemporal Contexts [23.8690122800167]
  STRelay consistently improves prediction performance across all cases by 3.19%-1156%.<n>We evaluate STRelay integrated with four state-of-the-art location prediction base models on four real-world trajectory datasets.<n>Results demonstrate that STRelay consistently improves prediction performance across all cases by 3.19%-1156%.
  arXiv  Detail & Related papers  (2025-08-14T02:44:33Z)
• SPTTE: A Spatiotemporal Probabilistic Framework for Travel Time Estimation [21.092166159353702]
  Real-world trip data are often temporally sparse and unevenly distributed.<n> SPTTE incorporates an RNN-based temporal Gaussian process parameterization to regularize sparse observations and capture temporal dependencies.<n> Evaluations on real-world datasets demonstrate that SPTTE outperforms state-of-the-art probabilistic methods by over 10.13%.
  arXiv  Detail & Related papers  (2024-11-27T16:28:54Z)
• Link Representation Learning for Probabilistic Travel Time Estimation [21.092166159353702]
  In this paper, we propose to model trip-level link travel time using a Gaussian hierarchical model. The results demonstrate its superior performance compared to state-of-the-art deterministic and probabilistic baselines. We find that the learned link representations align well with the physical geometry of the network, making them suitable as input for other applications.
  arXiv  Detail & Related papers  (2024-07-08T13:01:53Z)
• REPLAY: Modeling Time-Varying Temporal Regularities of Human Mobility for Location Prediction over Sparse Trajectories [7.493786214342181]
  We propose REPLAY, a general RNN architecture learning to capture the time-varying temporal regularities for location prediction. Specifically, REPLAY not only resorts to distances in sparse trajectories to search for the informative hidden past states, but also accommodates the time-varying temporal regularities. Results show that REPLAY consistently and significantly outperforms state-of-the-art methods by 7.7%-10.9% in the location prediction task.
  arXiv  Detail & Related papers  (2024-02-26T05:28:36Z)
• Score Matching-based Pseudolikelihood Estimation of Neural Marked Spatio-Temporal Point Process with Uncertainty Quantification [59.81904428056924]
  We introduce SMASH: a Score MAtching estimator for learning markedPs with uncertainty quantification. Specifically, our framework adopts a normalization-free objective by estimating the pseudolikelihood of markedPs through score-matching. The superior performance of our proposed framework is demonstrated through extensive experiments in both event prediction and uncertainty quantification.
  arXiv  Detail & Related papers  (2023-10-25T02:37:51Z)
• When Rigidity Hurts: Soft Consistency Regularization for Probabilistic Hierarchical Time Series Forecasting [69.30930115236228]
  Probabilistic hierarchical time-series forecasting is an important variant of time-series forecasting. Most methods focus on point predictions and do not provide well-calibrated probabilistic forecasts distributions. We propose PROFHiT, a fully probabilistic hierarchical forecasting model that jointly models forecast distribution of entire hierarchy.
  arXiv  Detail & Related papers  (2023-10-17T20:30:16Z)
• PASTA: PArallel Spatio-Temporal Attention with spatial auto-correlation gating for fine-grained crowd flow prediction [33.08230699138568]
  We introduce a neural network named PArallel Spatio with spatial auto-correlation gating. The components in our approach include spatial auto-correlation gating, multi-scale residual block, and temporal attention gating module.
  arXiv  Detail & Related papers  (2023-10-02T14:10:42Z)
• SpatialRank: Urban Event Ranking with NDCG Optimization on Spatiotemporal Data [55.609946936979036]
  We propose a novel spatial event ranking approach named SpatialRank. We show that SpatialRank can effectively identify the top riskiest locations of crimes and traffic accidents.
  arXiv  Detail & Related papers  (2023-09-30T06:20:21Z)
• MomentDiff: Generative Video Moment Retrieval from Random to Real [71.40038773943638]
  We provide a generative diffusion-based framework called MomentDiff. MomentDiff simulates a typical human retrieval process from random browsing to gradual localization. We show that MomentDiff consistently outperforms state-of-the-art methods on three public benchmarks.
  arXiv  Detail & Related papers  (2023-07-06T09:12:13Z)
• Uncovering the Missing Pattern: Unified Framework Towards Trajectory Imputation and Prediction [60.60223171143206]
  Trajectory prediction is a crucial undertaking in understanding entity movement or human behavior from observed sequences. Current methods often assume that the observed sequences are complete while ignoring the potential for missing values. This paper presents a unified framework, the Graph-based Conditional Variational Recurrent Neural Network (GC-VRNN), which can perform trajectory imputation and prediction simultaneously.
  arXiv  Detail & Related papers  (2023-03-28T14:27:27Z)
• Real-time Outdoor Localization Using Radio Maps: A Deep Learning Approach [59.17191114000146]
  LocUNet: A convolutional, end-to-end trained neural network (NN) for the localization task. We show that LocUNet can localize users with state-of-the-art accuracy and enjoys high robustness to inaccuracies in the estimations of radio maps.
  arXiv  Detail & Related papers  (2021-06-23T17:27:04Z)
• Pose and Semantic Map Based Probabilistic Forecast of Vulnerable Road Users' Trajectories [2.984037222955095]
  An approach for probabilistic trajectory forecasting of vulnerable road users (VRUs) is presented. Past movements are represented by 3D poses reflecting the posture and movements of individual body parts. The surrounding scene is modeled in the form of semantic maps showing, e.g., the course of streets, sidewalks, and the occurrence of obstacles.
  arXiv  Detail & Related papers  (2021-06-04T16:56:13Z)
• Prediction with Spatio-temporal Point Processes with Self Organizing Decision Trees [0.0]
  We introduce a novel approach to this problem. Our approach is based on the Hawkes process, which is a non-stationary and self-exciting process. We provide experimental results on real-life data.
  arXiv  Detail & Related papers  (2020-03-07T20:39:31Z)

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.