MétaCan
Menu
Back to cohort
Record W4286490894 · doi:10.1080/01605682.2022.2096502

Verifying and managing additive consistency and deriving weights for hesitant fuzzy preference relations

2022· article· en· W4286490894 on OpenAlexaff
Yejun Xu, Mengqi Li, Witold Pedrycz

Bibliographic record

VenueJournal of the Operational Research Society · 2022
Typearticle
Languageen
FieldDecision Sciences
TopicMulti-Criteria Decision Making
Canadian institutionsUniversity of Alberta
FundersNational Natural Science Foundation of China
KeywordsConsistency (knowledge bases)AmbiguityPreferenceRank (graph theory)Computer scienceWeak consistencyFuzzy logicMathematical optimizationMathematicsStrong consistencyArtificial intelligenceStatisticsProgramming language

Abstract

fetched live from OpenAlex

Hesitant fuzzy preference relation (HFPR) is a valid tool to describe the hesitation, ambiguity and uncertainty of decision makers. As a crucial criterion to ensure the rationality of preferences and final decision results, the consistency of preference relations is a valuable research topic. In this study, the additive consistency of HFPRs is investigated. Two kinds of consistency, completely additive and weakly additive, for HFPRs are introduced. Some 0–1 mixed programming models and simple algebraic operations are developed to detect the additive consistency type for HFPRs. Further, the priority weights of a consistent HFPR can be derived by constructing and solving two linear programming models. If an HFPR is identified to be inconsistent, we present a straightforward method to rectify inconsistency. Then, an integrated algorithm is proposed to ascertain the additive consistency type, improve consistency and rank alternatives. Finally, the applicability and validity of this proposal are verified through a case study, discussion and comparative analysis with the existing methods.

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.016
metaresearch head score (Gemma)0.044
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: Theoretical or conceptual
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.016
Threshold uncertainty score0.086

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0160.044
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0040.004
Science and technology studies0.0010.002
Scholarly communication0.0040.006
Open science0.0020.003
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0010.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.359
GPT teacher head0.472
Teacher spread0.114 · 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
Published2022
Admission routes1
Has abstractyes

Explore more

Same venueJournal of the Operational Research SocietySame topicMulti-Criteria Decision MakingFrench-language works237,207