Reinforced Fuzzy-Rule-Based Neural Networks Realized Through Streamlined Feature Selection Strategy and Fuzzy Clustering With Distance Variation
Bibliographic record
Abstract
In this article, we present a dimensionality reduction methodology of reinforced fuzzy-rule-based neural networks (FRNNs) realized with the help of determination/correlation coefficient-based streamlined feature selection strategy and fuzzy clustering with standard deviation to cope with high-dimensional data. This approach aims to reduce the design process of the proposed networks and to curb the computational overhead inherently associated with the increasing volume of data both in terms of their number and the dimensionality of the feature space. The overall architecture and learning mechanism of the FRNNs are based on radial basis function neural networks. However, we design the hidden layer of RBFNNs differently by using fuzzy clustering, which makes it easy to determine the parameters, such as centers and widths of the receptive fields (activation functions). Unlike conventional neural networks, the RBFNNs do not have a feature to support dimensionality reduction. To overcome this limitation, FRNNs select input variables by evaluating the adjusted determination coefficient of the model. To reduce the computational burden of finding an appropriate combination of inputs, we propose a simplified feature selection and elimination technique, in which the variables are selected or eliminated by correlation coefficients. A linear function expresses the connection weight, and we apply L2-norm regularization to least-square-error-based learning to estimate stable coefficients (weights), which is expected to significantly improve the generalization ability. The superiority of the proposed FRNNs was demonstrated by using 28 real-world benchmark datasets. The networks are also compared with the conventional models associated with the FRNNs and several related models previously published in the literature.
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.001 | 0.002 |
| 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.000 |
| Scholarly communication | 0.001 | 0.001 |
| 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".