Identification of Fuzzy Rule-Based Models With Output Space Knowledge Guidance
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
In this article, we advocate that a knowledge tidbit residing in the output space could be helpful in improving the performance (accuracy) of the fuzzy rule-based model. It states that <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">if two outputs are far apart from each other</i> , <italic xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">it is advisable to place their corresponding inputs in different clusters when forming subspaces of the input space</i> . Considering this knowledge guidance mechanism, we propose two different methods to partition the input space. In the first method, input data are first partitioned with the use of the standard clustering algorithm, say fuzzy C-means; here, a constructed partition matrix is reflective of the structure present in the input space. Then, the knowledge tidbit is used to adjust the entries of the original partition matrix in such a way that those input data whose corresponding output data are far apart from each other are assigned with low values of proximity. In the second method, we propose two strategies to modify the distance between input data and a prototype (cluster center) identified in the input space. The crux of this method is that if there are many input data (which, in virtue of the knowledge tidbit, are regarded as being far-apart from the input data of interest) around a certain prototype, the distance between the input data of interest and this prototype should be penalized. Thus, the membership of these input data to the prototype is reduced. The comprehensive experimental studies carried out on both synthetic and publicly available data are used to examine the usefulness of the proposed methods.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| 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