MétaCan
Menu
Back to cohort
Record W1979383090 · doi:10.1109/icassp.2014.6854782

Probabilistic ranking of multi-attribute items using indifference curve

2014· article· en· W1979383090 on OpenAlexaff
Xiaohui Gong, Hongke Zhao, Yan Sun

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Management and Algorithms
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsRanking (information retrieval)Computer scienceRank (graph theory)Probabilistic logicPreferenceProcess (computing)Quality (philosophy)Selection (genetic algorithm)Machine learningCompetition (biology)Data miningInformation retrievalArtificial intelligenceStatisticsMathematics

Abstract

fetched live from OpenAlex

This work proposes a novel probabilistic multi-attribute item ranking framework to estimate the probability of an item being a user's best choice and rank items accordingly. It uses indifference curve from microeconomics to model users' personal preference, and addresses the inter-attribute tradeoff and inter-item competition issues at the same time with little information loss. The proposed framework also considers the fact that a user can only compare a few items at the same time, and models the user's selection process as a two-step process, where the user first selects a few candidates, and then makes detailed comparison. Simulation results show that the proposed framework significantly outperforms existing multiattribute ranking algorithms in terms of ranking quality.

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.012
metaresearch head score (Gemma)0.035
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.012
Threshold uncertainty score0.062

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0120.035
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0040.002
Bibliometrics0.0070.006
Science and technology studies0.0010.002
Scholarly communication0.0030.007
Open science0.0060.003
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0030.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.055
GPT teacher head0.272
Teacher spread0.218 · 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 designTheoretical or conceptual
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

Citations5
Published2014
Admission routes1
Has abstractyes

Explore more

Same topicData Management and AlgorithmsFrench-language works237,207