MétaCan
Menu
Back to cohort
Record W2282249876 · doi:10.3233/idt-140227

Granular fuzzy rule-based architectures: Pursuing analysis and design in the framework of granular computing

2015· article· en· W2282249876 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

VenueIntelligent Decision Technologies · 2015
Typearticle
Languageen
FieldComputer Science
TopicRough Sets and Fuzzy Logic
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsGranular computingGranularityProbabilistic logicComputer scienceFuzzy logicExploitTheoretical computer scienceFuzzy setGranular materialData miningArtificial intelligenceRough setEngineeringProgramming language

Abstract

fetched live from OpenAlex

In this study, we propose a new concept of granular rule-based models whose rules assume a format ``if G(A i ) then G(f i )'' where G$(.)s are granular generalizations of the numeric conditions and conclusions of the rules. Those generalizations can be expressed e.g., in terms of interval-valued, type-2 or probabilistic fuzzy sets. We discuss several classes of fuzzy models depending upon available information granules and offer a motivation present behind their emergence. The design of these granular architectures exploits the essentials of Granular Computing such as a principle of justifiable granularity and an optimal allocation of information granularity. Detailed investigations of the performance indexes (objective functions) along with the related optimization schemes are covered as well.

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.002
metaresearch head score (Gemma)0.002
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.912
Threshold uncertainty score0.582

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.002
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.003
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.044
GPT teacher head0.294
Teacher spread0.250 · 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