MétaCan
Menu
Back to cohort
Record W2121804177 · doi:10.1145/2666310.2666485

Towards knowledge-enriched path computation

2014· article· en· W2121804177 on OpenAlexaff

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsClosenessProbabilistic logicMeasure (data warehouse)Path (computing)Geospatial analysisGround truthRouting (electronic design automation)Shortest path problem

Abstract

fetched live from OpenAlex

Directions and paths, as commonly provided by navigation systems, are usually derived considering absolute metrics, e.g., finding the shortest path within an underlying road network. With the aid of crowdsourced geospatial data we aim at obtaining paths that do not only minimize distance but also lead through more popular areas using knowledge generated by users. We extract spatial relations such as "nearby" or "next to" from geo-textual travel blogs, that define closeness between pairs of points of interest (POIs) and quantify each of these relations using a probabilistic model. Using Bayesian inference, we obtain a probabilistic measure of spatial closeness according to the crowd. Applying this measure to the corresponding road network, we derive an altered cost function taking crowdsourced spatial relations into account. We propose two routing algorithms on the enriched road networks. To evaluate our approach, we use Flickr photo data as a ground truth for popularity. Our experimental results -- based on real world datasets -- show that the computed paths yield competitive solutions in terms of path length while also providing more "popular" paths, making routing easier and more informative for the user.

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.011
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.013
Threshold uncertainty score0.026

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.011
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0040.005
Science and technology studies0.0010.001
Scholarly communication0.0020.004
Open science0.0030.003
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0040.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.016
GPT teacher head0.260
Teacher spread0.244 · 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

Citations9
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicData Management and AlgorithmsFrench-language works237,207