MétaCan
Menu
Back to cohort
Record W2114653137 · doi:10.1109/wi-iat.2011.130

A Luhn-Inspired Vector Re-weighting Approach for Improving Personalized Web Search

2011· article· en· W2114653137 on OpenAlex
Hanze Liu, Orland Hoeber

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicInformation Retrieval and Search Behavior
Canadian institutionsMemorial University of Newfoundland
Fundersnot available
KeywordsComputer scienceInformation retrievalPersonalizationSet (abstract data type)WeightingPersonalized searchSimilarity (geometry)Vector space modelWeb search querySearch engineZipf's lawRank (graph theory)Data miningWorld Wide WebArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

A fundamental problem with current Web search technology is that in the absence of any additional information, the same query provided by two different searchers will produce the same set of search results, even if the information needs of the searchers are different. Web search personalization has been proposed as a solution to this problem, whereby the interests and preferences of individual users are modelled and used to affect the outcomes of their subsequent searches. A common approach is to generate vector-based models of searchers' interests, and re-rank the search results based on the similarity of the documents to these models. In this paper, a novel approach is proposed to automatically identify and re-weight significant dimensions in vector-based models in order to improve the personalized order of Web search results. This approach is inspired by Luhn's model of term importance, which is rooted in Zipf's Laws. Evaluations with a set of ambiguous queries illustrate the effectiveness of this approach.

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: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.981
Threshold uncertainty score0.429

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
Open science0.0010.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.084
GPT teacher head0.276
Teacher spread0.192 · 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