A Design of Granular Takagi–Sugeno Fuzzy Model Through the Synergy of Fuzzy Subspace Clustering and Optimal Allocation of Information Granularity
Bibliographic record
Abstract
Fuzzy models have been commonly used in system modeling and model-based control. Among various fuzzy models, Takagi-Sugeno (TS) fuzzy models form one of the intensively studied and applied categories of models. In this study, we are concerned with a development of a granular TS fuzzy model realized on a basis of numerical evidence and completed through a combination of fuzzy subspace clustering and the principle of optimal allocation of information granularity. The TS fuzzy models are built with the use of the fuzzy subspace clustering algorithm. Information granularity is regarded as a crucial design asset whose optimal allocation gives rise to granular fuzzy models and makes the constructed models to become better in rapport with experimental data. In comparison with fuzzy models, granular fuzzy models produce results (outputs) that are information granules rather than numeric entities being encountered in fuzzy models. In contrast with the commonly used optimization criteria, which emphasize the highest accuracy encountered at the numeric level, the performance of the granular TS fuzzy model is quantified in terms of the coverage and specificity criteria where such criteria are of interest in the evaluation of quality of information granules vis-à-vis experimental (numeric) data. Experimental results are reported for both synthetic datasets and publicly available data sets coming from the UCI machine learning repository.
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.001 | 0.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".