MétaCan
Menu
Back to cohort
Record W4296878293 · doi:10.4018/ijiit.309580

A New Adaptive Indexing for Real-Time Web Search

2022· article· en· W4296878293 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

VenueInternational Journal of Intelligent Information Technologies · 2022
Typearticle
Languageen
FieldComputer Science
TopicRecommender Systems and Techniques
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceSearch engine indexingCrawlingRanking (information retrieval)Index (typography)WorkloadSelection (genetic algorithm)Information retrievalData miningResource (disambiguation)Machine learningWorld Wide Web

Abstract

fetched live from OpenAlex

Adaptive indexing is an alternative to the self-tuning methods. It is especially useful in the scenario of unpredictable workload, and there is no idle time to invest in index creation. The authors present their ongoing work on a new realistic adaptive indexing that transforms the previous data crawling offline approach to a data-driven online approach. The proposed approach consists of three tasks: topic prediction, resource selection, and results combination and ranking. They work simultaneously to retrieve highly relevant results to the user's query in real time. To make the index highly refreshed and up-to-date, they collected data from highly prominent resources (e.g., Facebook, Twitter, Wikipedia, etc.). The empirical results showed that the proposed model is better than the traditional models that work offline and spend hours or days for building the index in different periods. In addition, the experiments showed that the training results are highly relevant for adhoc and diversity tasks.

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.001
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: Not applicable · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.735
Threshold uncertainty score0.432

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.002
Open science0.0020.001
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.028
GPT teacher head0.287
Teacher spread0.259 · 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