MétaCan
Menu
Back to cohort
Record W1738003015 · doi:10.3233/ifs-2000-123

Higher order fuzzy system identification using subtractive clustering

2000· article· en· W1738003015 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

VenueJournal of Intelligent & Fuzzy Systems · 2000
Typearticle
Languageen
FieldComputer Science
TopicFuzzy Logic and Control Systems
Canadian institutionsConcordia University
Fundersnot available
KeywordsSubtractive colorCluster analysisIdentification (biology)Fuzzy clusteringComputer scienceMathematicsFuzzy logicData miningArtificial intelligence

Abstract

fetched live from OpenAlex

This paper proposes a higher order fuzzy system identification method using subtractive clustering, which is an extended application of subtractive clustering. Minimum error models are obtained through enumerative search of clustering parameters. The results of the enumerative study presented in this paper explain the mechanism behind subtractive clustering and introduce a modification in the penalizing process of subtractive clustering. The results of applying the higher order modeling to both linear and non-linear systems are given in this paper. The comparison with the results of other models shows improvement in the modeling performance by subtractive clustering with higher order system identification technique. The higher order identification method resulted in fewer rules compared to lower order models. Results of case studies on systems of different complexities are also presented.

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.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.876
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.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.029
GPT teacher head0.259
Teacher spread0.230 · 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