Development of Granular Fuzzy Relation Equations Based on a Subset of Data
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.
Bibliographic record
Abstract
Developing and optimizing fuzzy relation equations are of great relevance in system modeling, which involves analysis of numerous fuzzy rules. As each rule varies with respect to its level of influence, it is advocated that the performance of a fuzzy relation equation is strongly related to a subset of fuzzy rules obtained by removing those without significant relevance. In this study, we establish a novel framework of developing granular fuzzy relation equations that concerns the determination of an optimal subset of fuzzy rules. The subset of rules is selected by maximizing their performance of the obtained solutions. The originality of this study is conducted in the following ways. Starting with developing granular fuzzy relation equations, an interval-valued fuzzy relation is determined based on the selected subset of fuzzy rules (the subset of rules is transformed to interval-valued fuzzy sets and subsequently the interval-valued fuzzy sets are utilized to form interval-valued fuzzy relations), which can be used to represent the fuzzy relation of the entire rule base with high performance and efficiency. Then, the particle swarm optimization (PSO) is implemented to solve a multi-objective optimization problem, in which not only an optimal subset of rules is selected but also a parameter ε for specifying a level of information granularity is determined. A series of experimental studies are performed to verify the feasibility of this framework and quantify its performance. A visible improvement of particle swarm optimization (about 78.56% of the encoding mechanism of particle swarm optimization, or 90.42% of particle swarm optimization with an exploration operator) is gained over the method conducted without using the particle swarm optimization algorithm.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.001 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 it