Analysis of Key Commuting Routes Based on Spatiotemporal Trip Chain
Bibliographic record
Abstract
Commuting pattern is one of the most important travel patterns on the road network; the analysis of commuting pattern can provide support for public transport system optimization, policy formulation, and urban planning. In this study, a framework of the key commuting route mining algorithm based on license plate recognition (LPR) data is proposed. And the proposed algorithm framework can be migrated to any similar spatiotemporal data, such as GPS trajectory data. Commuting pattern vehicles are first extracted, and then, the spatiotemporal trip chains of all commuting pattern vehicles are mined. Based on the spatiotemporal trip chains, the spatiotemporal similarity matrix is constructed by dynamic time warping (DTW) algorithm. Finally, the characteristics of commuting pattern are analysed by the density-based spatial clustering of applications with noise (DBSCAN) algorithm. Different from other researches that analyse the commuting pattern using machine learning algorithms based on all data, this study first extracts commuting pattern vehicles and then designs a key commuting route mining algorithm framework for commuting pattern vehicles. Taking Hangzhou as an example, through the framework of mining algorithm proposed in this study, the commuting pattern characteristics and key commuting routes in Hangzhou have been successfully excavated, and policy suggestions based on the analysis results have also been put forward.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".