MétaCan
Menu
Back to cohort
Record W562339529 · doi:10.3141/2535-11

Estimating the Destination of Unlinked Trips in Transit Smart Card Fare Data

2015· article· en· W562339529 on OpenAlex
Li He, Martin Trépanier

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
aboutThe title or abstract carries a Canadian signal from the geographic lexicon.

Bibliographic record

VenueTransportation Research Record Journal of the Transportation Research Board · 2015
Typearticle
Languageen
FieldSocial Sciences
TopicHuman Mobility and Location-Based Analysis
Canadian institutionsPolytechnique Montréal
FundersThales Group
KeywordsTRIPS architectureSmart cardKernel density estimationPublic transportTransit (satellite)Computer scienceTransport engineeringData collectionEstimationStatisticsEngineeringComputer securityMathematics

Abstract

fetched live from OpenAlex

Smart card automated fare collection systems have been effective for the collection of data about the travel behavior of users on public transit networks. Because some systems record only the boarding (origin) locations, a method is needed for estimating the alighting (destination) locations. Existing algorithms can estimate the destination for most trips. However, unlinked trips, which are not part of a trip chain during the day, are more difficult to analyze. The proposed improvement to the existing model for destination estimation, especially for unlinked trips, is based on kernel density estimation of the spatial and temporal probabilities of each destination. The Société de Transport de l'Outaouais, a medium-sized bus service near Ottawa, Ontario, Canada, provided data for a 1-month period in 2009 (908,303 total transactions). Existing algorithms can handle only 80.64% of the trips; the proposed method handles an additional 10.9%. These results are analyzed, and future research directions are discussed.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.027
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Observational · Consensus signal: Observational
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.485
Threshold uncertainty score0.938

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0270.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.004
Science and technology studies0.0010.001
Scholarly communication0.0000.001
Open science0.0020.000
Research integrity0.0000.002
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.293
GPT teacher head0.466
Teacher spread0.173 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it