Introduction to Preference Modeling with Binary Fuzzy Relations
Bibliographic record
Abstract
This chapter presents an introduction to preference modeling realized in terms of binary fuzzy relations and address certain difficulties that arise in the extension of the classical or Boolean preference structures of binary relations to the fuzzy environment. Particularly, the extension of the classical structures to their fuzzy counterparts requires the selection of a De Morgan triplet and of adequate functions to construct suitable binary fuzzy relations of strict preference, indifference, and incomparability. Unfortunately, it is not that simple to implement this extension. In this context, the current chapter recalls some concepts related to binary fuzzy relations and some specific t-norms, t-conorms, and negation operators, which will play an important role. The chapter defines preference structures of binary fuzzy relations and outlines a method for constructing these fuzzy structures, without losing important characteristics of the classical preference structures of binary relations. Controlled Vocabulary Terms fuzzy set theory; model reference adaptive control systems
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.018 | 0.004 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".