MétaCan
Menu
Back to cohort
Record W2009600143 · doi:10.5539/ass.v7n8p107

Methodology to Minimise the Abandonment of Web Page Navigation Using the Tabu Search Algorithm

2011· article· en· W2009600143 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.

venuePublished in a venue whose home country is Canada.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueAsian Social Science · 2011
Typearticle
Languageen
FieldDecision Sciences
TopicScheduling and Timetabling Solutions
Canadian institutionsnot available
Fundersnot available
KeywordsTabu searchComputer scienceAbandonment (legal)Web pageMetaheuristicAlgorithmNoise (video)Quality (philosophy)Data miningArtificial intelligenceWorld Wide Web

Abstract

fetched live from OpenAlex

This article shows an application of the metaheuristic tabu algorithm for resolution by domains to the optimisation of navigating an online banking webpage. In this algorithm a ‘memory’ is created that stores the last moves made in the navigation which, if repeated, produce results already explored. This ‘memory’ would serve to impede the pathway to those results. The properties of this algorithm make it ideal for optimising webpage navigation by reducing waiting times and ‘noise’ (irrelevant information) in the search for information and consequently a reduction in abandonment and a better quality of navigation is achieved.

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.016
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesScience and technology studies
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.794
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0160.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.003
Science and technology studies0.0010.002
Scholarly communication0.0000.000
Open science0.0020.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.431
GPT teacher head0.477
Teacher spread0.045 · 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