Fuzzy relational structures: Learning alternatives for fuzzy modeling
Bibliographic record
Abstract
Fuzzy models offer a convenient way to describe complex and nonlinear systems. Fuzzy relational equations, viewed as a certain class of fuzzy models, play a pivotal role in fuzzy modeling. Their theory supports ways in which these equations could be solved and offers a characterization of the resulting families of solutions. Assuming that the corresponding relational equation or a system of relational equations is solvable, the theory provides a suite of analytical results. If this essential solvability assumption is not satisfied, we have to resort to approximate solutions and optimization techniques. In this study, we review several approaches to construct fuzzy relational models. Those methods include analytical methods, gradient-based (GB) methods, particle swarm optimization (PSO), and differential evolution (DE). We compare these methods with a hybridization of the different techniques, namely PSO-GB and DE-GB. The optimization techniques are used to design a fuzzy logic processor (FLP), which employs fuzzy logic operations in the realization of this network. Fuzzy C-Means (FCM) transforms real-world numeric data into fuzzy sets, which are used to design the fuzzy model.
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.005 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.005 |
| Open science | 0.002 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.007 | 0.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.
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".