Oscillation-Bound Estimation of Perturbations Under Bandler–Kohout Subproduct
Bibliographic record
Abstract
The Bandler-Kohout subproduct (BKS) method is one of the two widely acknowledged fuzzy relational inference (FRI) schemes. The previous works related to its stability and robustness mainly concentrated on how the output values were changed with perturbation parameters of input values. However, the works on estimating oscillation bounds of output values with regard to varying limits of input, are lacking. In this study, we investigate the oscillation-bound estimation of perturbations for BKS. First, the BKS output variation scopes are acquired for interval perturbation, where the R -implication, ( S, N )-implication, QL-implication, and t -norm implication are adopted. Second, in allusion to the more sophisticated problem of the fuzzy reasoning chain with BKS, the oscillation bounds of BKS output resulting from input interval perturbation are offered. Third, we construct the upper and lower bounds of BKS output deviation originated in the simple perturbation of the input fuzzy set, in which the situations of one rule and multiple rules are both dissected. Finally, the stable properties of all these BKS strategies are confirmed. It is emphasized that interval perturbation and simple perturbation are more general ways to give expression describing the robustness issue, and the obtained oscillation bounds also deliver more detailed characterization of the output deviation along with the input perturbation. This study further validates the sound properties of the BKS method.
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.002 | 0.005 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| 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".