MétaCan
Menu
Back to cohort

Conceptual Modeling and Smart Computing for Big Transportation Data

2021· article· en· W3134583825 on OpenAlexafffundabout
Carson K. Leung, Yan Wen, Hao Zheng

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsUniversity of Manitoba
FundersUniversity of Manitoba
KeywordsBig dataComputer scienceData sciencePopularityData modelingAbstractionVariety (cybernetics)Smart cityConceptual modelIntelligent transportation systemSoftwareWorld Wide WebDatabaseData miningTransport engineeringInternet of ThingsEngineeringArtificial intelligence

Abstract

fetched live from OpenAlex

Technical advancements in recent decades have led to generation and collection of much more data at a rapid rate from a wide variety of rich data sources. The popularity of initiates of open data has also encouraged the sharing of these big data so that they have become publicly accessible. Examples of these big data include transportation data. Analyzing and mining these big transportation data help users (e.g., commuters, city planners) to take appropriate actions (e.g., making wise decisions), which in turn help building a smarter city. This leads to smart computing. Moreover, contents of available big transportation data may vary among cities, which lead to the conceptual modeling to describe- at a high level of abstraction-the semantics of data analytic and mining software applications on big transportation data. In this paper, we present conceptual modeling and smart computing for big transportation data. We illustrate our idea with real-life big transportation data from the Canadian city of Winnipeg and to show its practicality in real-life data.

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 imitation

Not 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.

metaresearch head score (Codex)0.004
metaresearch head score (Gemma)0.008
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.020
Threshold uncertainty score0.039

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.008
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0020.004
Science and technology studies0.0020.004
Scholarly communication0.0060.009
Open science0.0030.004
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0030.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.

Opus teacher head0.110
GPT teacher head0.289
Teacher spread0.179 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreEmpirical

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".

Quick stats

Citations13
Published2021
Admission routes3
Has abstractyes

Explore more

Same topicData Management and AlgorithmsFrench-language works237,207