MétaCan
Menu
Back to cohort
Record W2895839363 · doi:10.3311/ppci.11753

Integration of Probability and Clustering Based Approaches in the Field of Black Spot Identification

2018· article· en· W2895839363 on OpenAlex

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.

Bibliographic record

VenuePeriodica Polytechnica Civil Engineering · 2018
Typearticle
Languageen
FieldEngineering
TopicInfrastructure Maintenance and Monitoring
Canadian institutionsTransport Canada
Fundersnot available
KeywordsBlack spotCluster analysisBayes' theoremHomogeneity (statistics)Computer scienceData miningIdentification (biology)HomogeneousCluster (spacecraft)Artificial intelligencePattern recognition (psychology)MathematicsMachine learningBayesian probability

Abstract

fetched live from OpenAlex

The objective of the paper is to define a complex methodology to analyze black spot locations of road infrastructure network combining the benefit of both; Empirical Bayes method and K-mean clustering approach. In the first step, K-mean algorithm is used to define homogeneous accident clusters. The homogeneity is described in three terms: traffic conditions, geometric design of the road and accident characteristics. Then, Empirical Bayes method is applied to define black spots based on the determined clusters. Due to the combination of the introduced methods, a powerful technique is provided that is able to identify high-risk locations and cluster dependent segment length as the output of the model.

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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.599
Threshold uncertainty score0.441

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.015
GPT teacher head0.227
Teacher spread0.212 · 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