MétaCan
Menu
Back to cohort
Record W4313441591 · doi:10.13033/isahp.y2022.064

2022 ISAHP Book of Abstracts/Schedule

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

VenueISAHP proceedings · 2022
Typearticle
Languageen
FieldAgricultural and Biological Sciences
TopicSensory Analysis and Statistical Methods
Canadian institutionsUniversity of Northern British Columbia
Fundersnot available
KeywordsScheduleComputer scienceOperating system

Abstract

fetched live from OpenAlex

Pairwise comparison matrices form the basis of the AHP.We provide optimal sets of comparisons of incomplete pairwise comparison matrices (IPCMs) in case of given number of alternatives and given number of comparisons, i.e., the ones that provide the closest weight vectors to the vectors calculated from the complete case.We conduct extensive simulations to compare the different structures of comparisons.It turns out that the regularity and bipartiteness of the representing graphs of IPCMs are the most important properties connected to optimality.Among spanning trees, the star graph is found to be optimal.In many cases the different optimal sets are reachable from each other by adding exactly one comparison to the previous set, resulting in an optimal sequence of pairwise comparisons.Our findings can be utilized not only by the application of a given optimal set of comparisons but also using an optimal sequence in cases when the number of comparisons given by the decision maker is not guaranteed (e.g., in online questionnaires).

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.871
Threshold uncertainty score0.991

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.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0100.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.023
GPT teacher head0.248
Teacher spread0.224 · 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