MétaCan
Menu
Back to cohort
Record W3164061109 · doi:10.22111/ijfs.2021.6180

On the symmetric quintuple implicational method of fuzzy reasoning

2021· article· en· W3164061109 on OpenAlexaff
Yiming Tang, Guangqing Bao, J. J. Chen, Witold Pedrycz

Bibliographic record

VenueIranian journal of fuzzy systems · 2021
Typearticle
Languageen
FieldDecision Sciences
TopicMulti-Criteria Decision Making
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsGeneralizationFuzzy logicEquivalence (formal languages)MathematicsModus ponensAlgorithmInterpolation (computer graphics)Mathematical optimizationComputer scienceApplied mathematicsArtificial intelligenceDiscrete mathematicsMathematical analysis

Abstract

fetched live from OpenAlex

A novel fuzzy reasoning method called the SQI (symmetric quintuple implicational) methodis put forward, which is a generalization of the QIP (quintuple implication principle) method. First of all, the symmetric quintuple implicational principles are presented, which are distinct from the ones of the QIP method. Then unified optimal solutions of the SQI method are obtained for FMP (fuzzy modus ponens) and FMT (fuzzy modus tollens), meanwhile corresponding reversible properties are verified. Furthermore, focusing on the case of multiple rules, optimal solutions of the SQI method are achieved, which involves two general approaches, i.e., FITA (first-infer-then-aggregate) and FATI (first-aggregate-then-infer). Equivalence relation of continuity and interpolation is analyzed for both FITA and FATI under the environment of the SQI method. Finally, one computing example arising in the field of affective computing is given for the SQI method with FATI. It is found that the SQI method preserves the same properties as the QIP method.

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.003
metaresearch head score (Gemma)0.003
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.005
Threshold uncertainty score0.018

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.003
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0020.001
Science and technology studies0.0010.003
Scholarly communication0.0020.003
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0050.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.148
GPT teacher head0.422
Teacher spread0.274 · 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

Citations2
Published2021
Admission routes1
Has abstractyes

Explore more

Same venueIranian journal of fuzzy systemsSame topicMulti-Criteria Decision MakingFrench-language works237,207