Understanding Regional Mobility Patterns Using Car-Hailing Order Data and Points of Interest Data
Post-publication record
Source: Retraction Watch, joined by DOI. OpenAlex records retraction as is_retracted, a boolean over a state space with at least four values, so it cannot express an expression of concern, a correction or a reinstatement; it reports them as false, which reads as “fine”.
Bibliographic record
Abstract
Car hailing is undergoing rapid global development, thereby providing new opportunities and challenges to operators and transport engineers due to uneven or irregular demand in certain areas. To date, only a limited number of studies have analyzed regional mobility patterns or anomaly detection. This study therefore proposes a methodology for recognizing regional mobility patterns using car-hailing order datasets and point of interest datasets. More specifically, we detect regional mobility patterns by incorporating regional intrinsic properties to a hierarchical mixture model termed latent Dirichlet allocation (LDA). This model can simulate the process of generating car-hailing order data and yield regional mobility patterns from spatial, temporal, and spatiotemporal perspectives. Moreover, by combining the trained results with future mobility records, we can measure similarities between areas and detect anomalous areas by calculating the perplexity. We also implement our workflow on a real-word car-hailing order dataset and reveal that it is possible to identify areas with similar or anomaly mobility patterns. This research will contribute to the design of regional transportation policies and customized bus services.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.004 | 0.003 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".