MétaCan
Menu
Back to cohort
Record W2985494805 · doi:10.1051/ro/2019105

Interactive multiobjective DEA target setting using lexicographic DDF

2019· article· en· W2985494805 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

VenueRAIRO - Operations Research · 2019
Typearticle
Languageen
FieldDecision Sciences
TopicEfficiency Analysis Using DEA
Canadian institutionsYork University
Fundersnot available
KeywordsLexicographical orderComputer scienceMathematical optimizationProcess (computing)Efficient frontierFunction (biology)Multi-objective optimizationAlgorithmMathematics

Abstract

fetched live from OpenAlex

In this paper, a new interactive multiobjective target setting approach based on lexicographic directional distance function (DDF) method is proposed. Lexicographic DDF computes efficient targets along a specified directional vector. The interactive multiobjective optimization approach consists in several iteration cycles in each of which the Decision Making Unit (DMU) is presented a fixed number of efficient targets computed corresponding to different directional vectors. If the DMU finds one of them promising, the directional vectors tried in the next iteration are generated close to the promising one, thus focusing the exploration of the efficient frontier on the promising area. In any iteration the DMU may choose to finish the exploration of the current region and restart the process to probe a new region. The interactive process ends when the DMU finds its most preferred solution (MPS).

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.011
metaresearch head score (Gemma)0.010
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMetaresearch, Science and technology studies, Scholarly communication, Insufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.176
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0110.010
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0030.006
Science and technology studies0.0020.000
Scholarly communication0.0010.001
Open science0.0010.000
Research integrity0.0000.001
Insufficient payload (model declined to judge)0.0020.003

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.195
GPT teacher head0.518
Teacher spread0.323 · 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