MétaCan
Menu
Back to cohort

Road Importance Using Complex-Networks, Graph Reduction & Interpolation

2020· article· en· W3013509586 on OpenAlexaff
Alfosool Ali M. S., Yuanzhu Chen, Daniel Fuller, Shorouq Al-Eidi

Bibliographic record

Venue2020 International Conference on Computing, Networking and Communications (ICNC) · 2020
Typearticle
Languageen
FieldSocial Sciences
TopicUrban Transport and Accessibility
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsTRIPS architectureCentralityTransport engineeringComputer scienceWalkabilityGraphInterpolation (computer graphics)GeographyArtificial intelligenceEngineeringMathematicsTheoretical computer scienceBuilt environmentCivil engineering

Abstract

fetched live from OpenAlex

Most people spend hours on the road on a daily basis making road networks a crucial part of our daily lives. Trips to work, grocery store, hospital or even casual jogs and road trips mainly occur on walkable or drivable roads. With the increase of online communities, professionals and enthusiasts, road networks are now abundantly available from various sources making them a great resource for a variety of analysis such as finding the road importance, road characteristics, city planning, and the association between neighborhoods' walkability and the local obesity rate. However, as data increases, analyzing larger regions requires much more processing power and computational time. We aim to incorporate graph reduction and centrality interpolation while utilizing some already-efficient complex networks centrality algorithms, to produce ready-to-analyze road scores for the entire given data set while reducing the required computational time when compared to the conventional algorithms that do not use reduction. Furthermore, our produced road scores can be applied to non-network characteristics such as amenities, elevation, road type, road condition and road structure to produce more accurate walkability scores.

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.001
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.023

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0040.003
Science and technology studies0.0010.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
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.188
GPT teacher head0.377
Teacher spread0.189 · 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 designSimulation or modeling
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

Citations3
Published2020
Admission routes1
Has abstractyes

Explore more

Same venue2020 International Conference on Computing, Networking and Communications (ICNC)Same topicUrban Transport and AccessibilityFrench-language works237,207