pith. sign in

arxiv: 1907.02678 · v1 · pith:NEVUAQJInew · submitted 2019-07-05 · 💻 cs.OH

TPM: A GPS-based Trajectory Pattern Mining System

Yang Cao , Jingling Yuan , Song Xiao , Qing Xie This is my paper

Pith reviewed 2026-05-25 02:05 UTC · model grok-4.3

classification 💻 cs.OH
keywords GPS trajectorytrajectory pattern miningsimilarity matchingurban computingspatial-temporal clusteringdense area identification
0
0 comments X

The pith

TPM clusters spatial-temporal GPS data to find dense urban areas and extracts similar trajectories with a proposed matching method.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper presents TPM, a system designed to mine patterns in GPS trajectory data for urban computing applications. It begins by clustering spatial-temporal GPS information to identify dense urban areas and then identifies timing patterns to generate trajectories automatically. The central proposal is a trajectory similarity matching method that identifies and extracts similar trajectories from the processed data. This enables services such as traffic navigation, journey recommendations, and support for urban resource allocation decisions when applied to vehicle, bicycle, or wearable device trajectories.

Core claim

The TPM system mines urban dense areas via clustering the spatial-temporal data, automatically generates trajectories after the timing trajectory identification, and extracts similar trajectories via the proposed trajectory similarity matching method for applications including traffic navigation and urban planning.

What carries the argument

The trajectory similarity matching method, which identifies and extracts similar trajectories after initial clustering of dense areas from GPS data.

Load-bearing premise

The proposed trajectory similarity matching method will reliably extract useful similar trajectories when applied to real GPS data from vehicles or wearables.

What would settle it

Run the TPM system on a labeled set of real vehicle GPS trajectories from a city and verify whether the extracted similar trajectories align with known common routes or congestion patterns rather than random groupings.

Figures

Figures reproduced from arXiv: 1907.02678 by Jingling Yuan, Qing Xie, Song Xiao, Yang Cao.

Figure 1
Figure 1. Figure 1: In the TMP, we only apply the GPS-based trajectory instead of the road network. We use K-means to cluster the points of the trajectory into virtual regions, each of which corresponds to a place in the map, and then match these virtual regions in order to obtain similar trajectory patterns, thus this system is not restricted by the road network and has better robustness. II. RELATED WORK In recent years, mo… view at source ↗
Figure 1
Figure 1. Figure 1: Application background of the TPM region. They infer the functions of each region using a topic￾based inference model, which regards a region as a document, a function as a topic, categories of POIs as metadata, and human mobility patterns as words. The work in [5] is planning bike lanes based on sharing-bikes’ trajectories. They proposed a data-driven approach to develop bike lane construction plans based… view at source ↗
Figure 2
Figure 2. Figure 2: System overview The TPM system is designed to mine GPS-based trajectory patterns, including obtaining urban dense areas, automatically generating trajectories and extracting similar trajectory pat￾terns in traffic [PITH_FULL_IMAGE:figures/full_fig_p002_2.png] view at source ↗
Figure 4
Figure 4. Figure 4: Appropriate time interval θ According to the above method for trajectory identification, we can get some rough trajectories. Then calculate the dis￾tance of the trajectory according to the latitude and longitude distance formula (3), the formulas are as follows: dis1 = sin2 latA − latB 2  (1) dis2 = sin2 lngA − lngB 2  (2) distance = 2R ∗ arcsinp dis1 + cos(latA) ∗ cos(latB) ∗ dis2  (3) Where R is th… view at source ↗
Figure 3
Figure 3. Figure 3: Formation of the trajectory In trajectory identification, the coordinate set and time stamp of geospatial are mainly studied. In this paper, we use the shared bicycle dataset, and the data fields used are id, timestamp, and location. Id shares the unique identifier of the bicycle, timestamp uniquely identifies the time of a moment, location contains latitude and longitude information. In this paper, the da… view at source ↗
Figure 5
Figure 5. Figure 5: Clustering diagram starting a mining task. For ease of analysis, the noise filtering in this paper are excluded as following: • The trajectory has only a single data point; • There is a data point in the trajectory where the distance is very distant; • The length of the trajectory is too short, it is not suitable to mine similar pattern. B. Clustering of Spatio-temporal Data The process of dividing a colle… view at source ↗
Figure 6
Figure 6. Figure 6: Similar trajectory model diagram Where, t1, t2, t3, etc. is a time series, gray ovals represent similar regions obtained by clustering, and p1, p2, p3 are a group of similar trajectories. According to the above analysis, the main steps of the similarity matching rule are as follows: 1) According to the clustering result, mark the GPS point of the trajectory as a label n (n = 0, 1, ..., k−1), and remove the… view at source ↗
Figure 8
Figure 8. Figure 8: Demonstration of the system interval of trajectory, and the system automatically generates trajectories after the timing trajectory identification. Mainly, we propose a method for trajectory similarity matching. In terms of application scenarios, the system can be applied to the trajectory system equipped with the GPS device, such as the vehicle trajectory, the bicycle trajectory, the electronic bracelet t… view at source ↗
read the original abstract

With the development of big data and artificial intelligence, the technology of urban computing becomes more mature and widely used. In urban computing, using GPS-based trajectory data to discover urban dense areas, extract similar urban trajectories, predict urban traffic, and solve traffic congestion problems are all important issues. This paper presents a GPS-based trajectory pattern mining system called TPM. Firstly, the TPM can mine urban dense areas via clustering the spatial-temporal data, and automatically generate trajectories after the timing trajectory identification. Mainly, we propose a method for trajectory similarity matching, and similar trajectories can be extracted via the trajectory similarity matching in this system. The TPM can be applied to the trajectory system equipped with the GPS device, such as the vehicle trajectory, the bicycle trajectory, the electronic bracelet trajectory, etc., to provide services for traffic navigation and journey recommendation. Meantime, the system can provide support in the decision for urban resource allocation, urban functional region identification, traffic congestion and so on.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 0 minor

Summary. The manuscript presents TPM, a GPS-based trajectory pattern mining system for urban computing. It claims to mine dense urban areas by clustering spatial-temporal GPS data, automatically generate trajectories via timing identification, propose a trajectory similarity matching method to extract similar trajectories, and apply the system to vehicle, bicycle, and electronic bracelet trajectories to support traffic navigation, journey recommendation, urban resource allocation, functional region identification, and congestion mitigation.

Significance. If the similarity matching method were rigorously defined with a distance metric, algorithm, and validated on real GPS traces with quantitative metrics and baselines, the system could offer practical value for trajectory-based urban services. The current manuscript supplies only high-level description with no such details or evidence, so no positive significance assessment is possible.

major comments (2)
  1. [Abstract] Abstract: The claim that 'we propose a method for trajectory similarity matching' is unsupported; the text provides no formal definition, distance metric, pseudocode, equations, or algorithmic description of this method.
  2. [Abstract] Abstract: The assertion that 'similar trajectories can be extracted via the trajectory similarity matching in this system' rests on description alone; the manuscript reports zero datasets, accuracy metrics, error analysis, or comparisons to prior trajectory similarity methods.

Simulated Author's Rebuttal

2 responses · 1 unresolved

We thank the referee for the detailed review of our manuscript on the TPM system. We address the major comments on the abstract point by point below.

read point-by-point responses

  1. Referee: [Abstract] Abstract: The claim that 'we propose a method for trajectory similarity matching' is unsupported; the text provides no formal definition, distance metric, pseudocode, equations, or algorithmic description of this method.

    Authors: We agree that the abstract and manuscript text provide only a high-level description of the trajectory similarity matching component without formal definitions, distance metrics, pseudocode, or equations. The manuscript emphasizes the overall system rather than low-level algorithmic details. We will revise the abstract to remove or qualify the claim of proposing a detailed method. revision: yes

  2. Referee: [Abstract] Abstract: The assertion that 'similar trajectories can be extracted via the trajectory similarity matching in this system' rests on description alone; the manuscript reports zero datasets, accuracy metrics, error analysis, or comparisons to prior trajectory similarity methods.

    Authors: The manuscript indeed contains no datasets, quantitative metrics, error analysis, or baseline comparisons for the similarity matching. The text is limited to conceptual description of the system. We will revise the abstract to remove the unsupported assertion about extraction of similar trajectories. revision: yes

standing simulated objections not resolved
  • Absence of any experimental results, datasets, or quantitative validation for the claimed similarity matching method, as none exist in the current manuscript.

Circularity Check

0 steps flagged

No circularity: system description contains no derivations, equations, or predictions that reduce to inputs.

full rationale

The manuscript is a high-level system proposal for TPM. It describes clustering for dense areas and asserts a trajectory similarity matching method, but supplies no equations, algorithms, fitted parameters, or quantitative predictions. No derivation chain exists to inspect for self-definition, fitted-input predictions, or self-citation load-bearing. The text is self-contained as an engineering overview without mathematical claims that could be circular by construction.

Axiom & Free-Parameter Ledger

0 free parameters · 0 axioms · 0 invented entities

Abstract-only review supplies no explicit free parameters, axioms, or invented entities; all technical details are absent.

pith-pipeline@v0.9.0 · 5692 in / 1031 out tokens · 18596 ms · 2026-05-25T02:05:58.906787+00:00 · methodology

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Reference graph

Works this paper leans on

18 extracted references · 18 canonical work pages

  1. [1]

    Urban Computing: Concepts, Methodologies, and Applications

    Zheng Y , Capra L, Wolfson O, et al. Urban Computing: Concepts, Methodologies, and Applications. ACM Transactions on Intelligent Systems and Technology. 2014, 5(3), 38:1-38:55

    work page 2014

  2. [2]

    Trajectory data mining: An overview

    Zheng Y . Trajectory data mining: An overview. ACM Transactions on Intelligent Systems and Technology. 2015, 6(3), 29:129:41

    work page 2015

  3. [3]

    Trajectory pattern mining

    Giannotti F, Nanni M, Pinelli F, et al. Trajectory pattern mining. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2007:330-339

    work page 2007

  4. [4]

    Discovering regions of different functions in a city using human mobility and POIs

    Yuan J, Zheng Y , Xie X. Discovering regions of different functions in a city using human mobility and POIs. In Proceedings of the 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2012:186-194

    work page 2012

  5. [5]

    Planning Bike Lanes based on Sharing-Bikes’ Trajectories

    Bao J, He T, Ruan S, et al. Planning Bike Lanes based on Sharing-Bikes’ Trajectories. In Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2017: 1377- 1386

    work page 2017

  6. [6]

    He T, Bao J, Li R, et al. 2018. Detecting Vehicle Illegal Parking Events using Sharing Bikes Trajectories. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2018: 340-349

    work page 2018

  7. [7]

    Trajectory-driven Influential Billboard Placement

    Zhang P, Li G, Bao Z, et al. Trajectory-driven Influential Billboard Placement. In Proceedings of the 24th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining. 2018:27482757

    work page 2018

  8. [9]

    Managing Massive Trajectories on the Cloud

    Bao J, Li R, Yi X, et al. Managing Massive Trajectories on the Cloud. In 24th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems. 2016

    work page 2016

  9. [10]

    DITA: A Distributed In-Memory Trajectory Analytics System

    Shang Z, Li G, Bao Z. DITA: A Distributed In-Memory Trajectory Analytics System. In Proceedings of the 2018 International Conference on Management of Data. 2018:1681-1684

    work page 2018

  10. [11]

    Torch: A search engine for trajectory data

    Wang S, Bao Z, Culpepper J, et al. Torch: A search engine for trajectory data. In 41st International Conference on Research and Development in Information Retrieval. 2018:535544

    work page 2018

  11. [12]

    IEEE Transactions on Image Processing

    Wang Y , Lin X, Wu L, et al, Robust subspace clustering for multi-view data by exploiting correlation consensus. IEEE Transactions on Image Processing. 2015, 24(11):3939-3949

    work page 2015

  12. [13]

    Multiview Spectral Clustering via Struc- tured Low-Rank Matrix Factorization

    Wang Y , Wu L, Lin X, Gao J. Multiview Spectral Clustering via Struc- tured Low-Rank Matrix Factorization. IEEE Transactions on Neural Networks and Learning Systems. 2018, 29 (10):4833-4843

    work page 2018

  13. [14]

    IJCAI 2016

    Wang Y , Zhang W, Wu L, et al., Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi- View Spectral Clustering. IJCAI 2016

    work page 2016

  14. [15]

    Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval

    Wang Y , Lin X, Wu L, Zhang W. Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval. IEEE Transactions on Image Processing. 2017, 26 (3):1393-1404

    work page 2017

  15. [16]

    Deep Attention-based Spatially Recursive Networks for Fine-Grained Visual Recognition

    Wu L, Wang Y , Li X, Gao J. Deep Attention-based Spatially Recursive Networks for Fine-Grained Visual Recognition. IEEE Transactions on Cybernetics. 2019, 49 (5):1791-1802

    work page 2019

  16. [17]

    Deep Adaptive Feature Embedding with Local Sample Distributions for Person Re-identification, Pattern Recognition

    Wu L, Wang Y , Gao J, Li X. Deep Adaptive Feature Embedding with Local Sample Distributions for Person Re-identification, Pattern Recognition. 2018, 73:275-288

    work page 2018

  17. [18]

    Cycle-Consistent Deep Generative Hashing for Cross-Modal Retrieval

    Wu L, Wang Y , Shao L. Cycle-Consistent Deep Generative Hashing for Cross-Modal Retrieval. IEEE Transactions on Image Processing. 2019, 28 (4):1602-1612

    work page 2019

  18. [19]

    Where-and-When to Look: Deep Siamese Attention Networks for Video-based Person Re-identification

    Wu L, Wang Y , Gao J, Li X. Where-and-When to Look: Deep Siamese Attention Networks for Video-based Person Re-identification. IEEE Transactions on Multimedia. 2019, 21 (6):1412-1424

    work page 2019