Infostop: Scalable stop-location detection in multi-user mobility data

• URL: http://arxiv.org/abs/2003.14370v1
• Date: Tue, 31 Mar 2020 17:02:19 GMT
• Title: Infostop: Scalable stop-location detection in multi-user mobility data
• Authors: Ulf Aslak, Laura Alessandretti
• Abstract summary: We describe the Infostop algorithm that overcomes the limitations of the state-of-the-art solution by leveraging the flow-based network community detection algorithm Infomap. We show that the size of locations detected by Infostops for increasing number of users and that time complexity grows slower than for previous solutions.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Data-driven research in mobility has prospered in recent years, providing solutions to real-world challenges including forecasting epidemics and planning transportation. These advancements were facilitated by computational tools enabling the analysis of large-scale data-sets of digital traces. One of the challenges when pre-processing spatial trajectories is the so-called stop location detection, that entails the reduction of raw time series to sequences of destinations where an individual was stationary. The most widely adopted solution to this problem was proposed by Hariharan and Toyama (2004) and involves filtering out non-stationary measurements, then applying agglomerative clustering on the stationary points. This state-of-the-art solution, however, suffers of two limitations: (i) frequently visited places located very close (such as adjacent buildings) are likely to be merged into a unique location, due to inherent measurement noise, (ii) traces for multiple users can not be analysed simultaneously, thus the definition of destination is not shared across users. In this paper, we describe the Infostop algorithm that overcomes the limitations of the state-of-the-art solution by leveraging the flow-based network community detection algorithm Infomap. We test Infostop for a population of $\sim 1000$ individuals with highly overlapping mobility. We show that the size of locations detected by Infostop saturates for increasing number of users and that time complexity grows slower than for previous solutions. We demonstrate that Infostop can be used to easily infer social meetings. Finally, we provide an open-source implementation of Infostop, written in Python and C++, that has a simple API and can be used both for labeling time-ordered coordinate sequences (GPS or otherwise), and unordered sets of spatial points.

Related papers

• Enhancing stop location detection for incomplete urban mobility datasets [0.0]
  This study investigates the application of classification algorithms to enhance density-based methods for stop identification. Our approach incorporates multiple features, including individual routine behavior across various time and scales local characteristics of individual GPS points.
  arXiv  Detail & Related papers  (2024-07-16T10:41:08Z)
• PeFAD: A Parameter-Efficient Federated Framework for Time Series Anomaly Detection [51.20479454379662]
  We propose a. Federated Anomaly Detection framework named PeFAD with the increasing privacy concerns. We conduct extensive evaluations on four real datasets, where PeFAD outperforms existing state-of-the-art baselines by up to 28.74%.
  arXiv  Detail & Related papers  (2024-06-04T13:51:08Z)
• Physics-Guided Abnormal Trajectory Gap Detection [2.813613899641924]
  We propose a Space Time-Aware Gap Detection (STAGD) approach to leverage space-time indexing and merging trajectory gaps. We also incorporate a Dynamic Region-based Merge (DRM) approach to efficiently compute gap abnormality scores.
  arXiv  Detail & Related papers  (2024-03-10T17:07:28Z)
• Diffusion-based Data Augmentation for Object Counting Problems [62.63346162144445]
  We develop a pipeline that utilizes a diffusion model to generate extensive training data. We are the first to generate images conditioned on a location dot map with a diffusion model. Our proposed counting loss for the diffusion model effectively minimizes the discrepancies between the location dot map and the crowd images generated.
  arXiv  Detail & Related papers  (2024-01-25T07:28:22Z)
• LargeST: A Benchmark Dataset for Large-Scale Traffic Forecasting [65.71129509623587]
  Road traffic forecasting plays a critical role in smart city initiatives and has experienced significant advancements thanks to the power of deep learning. However, the promising results achieved on current public datasets may not be applicable to practical scenarios. We introduce the LargeST benchmark dataset, which includes a total of 8,600 sensors in California with a 5-year time coverage.
  arXiv  Detail & Related papers  (2023-06-14T05:48:36Z)
• Similarity-based Feature Extraction for Large-scale Sparse Traffic Forecasting [4.295541562380963]
  The NeurIPS 2022 Traffic4cast challenge is dedicated to predicting the citywide traffic states with publicly available sparse loop count data. This technical report introduces our second-place winning solution to the extended challenge of ETA prediction.
  arXiv  Detail & Related papers  (2022-11-13T22:19:21Z)
• Correlating sparse sensing for large-scale traffic speed estimation: A Laplacian-enhanced low-rank tensor kriging approach [76.45949280328838]
  We propose a Laplacian enhanced low-rank tensor (LETC) framework featuring both lowrankness and multi-temporal correlations for large-scale traffic speed kriging. We then design an efficient solution algorithm via several effective numeric techniques to scale up the proposed model to network-wide kriging.
  arXiv  Detail & Related papers  (2022-10-21T07:25:57Z)
• Generative Anomaly Detection for Time Series Datasets [1.7954335118363964]
  Traffic congestion anomaly detection is of paramount importance in intelligent traffic systems. We propose a data-driven generative approach that can perform tractable density estimation for detecting traffic anomalies. Our approach significantly outperforms several state-of-the-art congestion anomaly detection and diagnosis methods in terms of Recall and F1-Score.
  arXiv  Detail & Related papers  (2022-06-28T17:08:47Z)
• LDC-Net: A Unified Framework for Localization, Detection and Counting in Dense Crowds [103.8635206945196]
  The rapid development in visual crowd analysis shows a trend to count people by positioning or even detecting, rather than simply summing a density map. Some recent work on crowd localization and detection has two limitations: 1) The typical detection methods can not handle the dense crowds and a large variation in scale; 2) The density map methods suffer from performance deficiency in position and box prediction, especially in high density or large-size crowds.
  arXiv  Detail & Related papers  (2021-10-10T07:55:44Z)
• Video-based Person Re-identification without Bells and Whistles [49.51670583977911]
  Video-based person re-identification (Re-ID) aims at matching the video tracklets with cropped video frames for identifying the pedestrians under different cameras. There exists severe spatial and temporal misalignment for those cropped tracklets due to the imperfect detection and tracking results generated with obsolete methods. We present a simple re-Detect and Link (DL) module which can effectively reduce those unexpected noise through applying the deep learning-based detection and tracking on the cropped tracklets.
  arXiv  Detail & Related papers  (2021-05-22T10:17:38Z)
• Graph Convolutional Networks for traffic anomaly [4.172516437934823]
  Event detection has been an important task in transportation, whose task is to detect points in time when large events disrupts a large portion of the urban traffic network. To fully capture the spatial and temporal traffic patterns remains a challenge, yet serves a crucial role for effective anomaly detection. We formulate the problem in a novel way, as detecting anomalies in a set of directed weighted graphs representing the traffic conditions at each time interval.
  arXiv  Detail & Related papers  (2020-12-25T22:36:22Z)

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.