Fuzzy Logic and Back-Propagation Neural Networks for Optimal Performance
Bibliographic record
Abstract
Thus far, the Taguchi technique is found only efficient in obtaining the combination of optimal factor settings when a single product/process response is considered. In today’s dynamic environment, customers are interested in multiple quality responses. This research, therefore, utilizes fuzzy logic and backward-propagation neural networks (BPNNs) to optimize process performance for products of multiple quality responses. In this research, quality characteristics are transformed to signal to noise (S/N) ratios, which are then used as inputs to a fuzzy model to obtain a single common output measure (COM). Next, BPNNs are employed to obtain full-factorial experimental data. Finally, the combination of factor levels that maximizes the average COM value is chosen as the optimal combination. Three case studies are provided for illustration; in all of which the proposed approach provided the largest total anticipated improvement. This indicates that the proposed approach is more efficient than Taguchi-fuzzy, grey-Taguchi, and Taguchi-utility methods. In conclusion, the fuzzy-BPNN approach may greatly assist process/product engineers in optimizing performance with multiple responses in a wide range of business applications.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 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".