Mobile Phone Data in Urban Commuting: A Network Community Detection-Based Framework to Unveil the Spatial Structure of Commuting Demand
Bibliographic record
Abstract
As the outcomes of rapid urbanization, the spatial separation of homes and workplaces extends the commuting distance and complicates the commuting demand of residents. To promote urban livability and sustainability, it becomes crucially important to understand the commuting patterns by decomposing and simplifying the diverse commuting demand. In this paper, a methodology framework is proposed to describe the spatial structure of commuting demand in a city using mobile phone data. Four steps are mainly included in the proposed methodology: the preprocessing of mobile phone data, the labeling of individuals and their activity points, the construction of the jobs-housing relationship network, and the network decomposition based on the community detection algorithm. To demonstrate the practical use of the proposed methodologies, a case study is carried out in Shanghai to explore the commuting patterns of Shanghai residents. The result indicates the regions with dense jobs-housing connections and cross-regional commuting demand. The result also finds that the administrative boundaries show a significant effect on the residential commuting behavior and the metro lines on the cross-regional commuting behavior. The results generated by the methodology proposed can be referenced by policymakers to support urban transportation planning and promote urban livability and sustainability.
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.002 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.004 | 0.004 |
| Science and technology studies | 0.001 | 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.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".