A Big Data Science and Engineering Solution for Transit Performance Analytics
Bibliographic record
Abstract
Public transit transportation plays a crucial role in the daily lives of many individuals, offering an affordable and convenient means of commuting to work, school, and various destinations. For instance, it serves as a vital mode of transportation to access their workplace, educational institutions or other activities. Any disruptions in bus schedules can lead to significant consequences, including missing meetings and other essential commitments for city residents. Thus, this paper presents a big data science and engineering solution for transit performance analytics in the area of transportation analysis. The insights derived from this data analysis are instrumental in enhancing the performance of public transportation, ultimately leading to an improved commuter experience in the city and contributing to the development of a smart city. To elaborate, our solution employs frequent pattern mining to identify variations in transit performance across different neighborhoods. By uncovering significant patterns, we establish connections that help us pinpoint the factors contributing to bus delays in specific areas. Improving the accuracy of bus arrival and departure times can significantly enhance the overall usability and appeal of public transit for commuters, as people are more likely to rely on buses when they are punctual and ensure timely arrivals at their destinations. Furthermore, our solution equips users with tools to visualize the insights gained from the analysis of bus departure times in various neighborhoods at different times of the day. The practicality of our big data science and engineering solution was demonstrated through an evaluation using real-life public transit data from a Canadian city, underscoring its potential to contribute to the development of a smart city.
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.004 | 0.022 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.002 |
| Bibliometrics | 0.004 | 0.005 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.005 | 0.007 |
| Open science | 0.004 | 0.006 |
| Research integrity | 0.002 | 0.005 |
| Insufficient payload (model declined to judge) | 0.004 | 0.004 |
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".