MétaCan
Menu
Back to cohort
Record W2153365440 · doi:10.1155/2011/695087

A Novel Ranking Method Based on Subjective Probability Theory for Evolutionary Multiobjective Optimization

2011· article· en· W2153365440 on OpenAlexaff
Shuang Wei, Henry Leung

Bibliographic record

VenueMathematical Problems in Engineering · 2011
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Multi-Objective Optimization Algorithms
Canadian institutionsUniversity of Calgary
Fundersnot available
KeywordsRanking (information retrieval)Multi-objective optimizationPareto principleMathematical optimizationSet (abstract data type)PreferenceComputer scienceTransitive relationPareto optimalDecision makerMathematicsArtificial intelligenceOperations researchStatistics

Abstract

fetched live from OpenAlex

Most of the engineering problems are modeled as evolutionary multiobjective optimization problems, but they always ask for only one best solution, not a set of Pareto optimal solutions. The decision maker′s subjective information plays an important role in choosing the best solution from several Pareto optimal solutions. Generally, the decision‐making processing is implemented after Pareto optimality. In this paper, we attempted to incorporate the decider′s subjective sense with Pareto optimality for chromosomes ranking. A new ranking method based on subjective probability theory was thus proposed in order to explore and comprehend the true nature of the chromosomes on the Pareto optimal front. The properties of the ranking rule were proven, and its transitivity was presented as well. Simulation results compared the performance of the proposed ranking approach with the Pareto‐based ranking method for two multiobjective optimization cases, which demonstrated the effectiveness of the new ranking 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.

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.002
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.002
Threshold uncertainty score0.012

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.005
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.002
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.032
GPT teacher head0.260
Teacher spread0.229 · 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 designSimulation or modeling
Domainnot available
GenreMethods

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

Citations3
Published2011
Admission routes1
Has abstractyes

Explore more

Same venueMathematical Problems in EngineeringSame topicAdvanced Multi-Objective Optimization AlgorithmsFrench-language works237,207