Self-Organizing Hybrid Fuzzy Polynomial Neural Network Classifier Driven Through Dynamically Adaptive Structure and Compound Regularization Technique
Bibliographic record
Abstract
This study presents an innovative approach to the design of a hybrid fuzzy classifier, with a focus on exploring the classification capability of a conventional fuzzy polynomial neural network (CFPNN). The proposed novel self-organizing hybrid fuzzy polynomial NN classifier (HFPNNC) improves performance while maintaining model interpretability and fixability by synergistically combining an adaptive network structure and the compound regularization technique (CRT). Recent studies have focused on exploring the potential of CFPNN structures for addressing regression issues. To effectively introduce the CFPNN framework to multiclassification tasks, a resilient fuzzy polynomial neural network structure was designed as a basic subclassifier to construct the proposed HFPNNC. The proposed HFPNNC employs a dynamically adaptive structure comprising of two types of critical layers: 1) the fuzzy set-based polynomial neurons layers and 2) the polynomial neurons layers. This allows the classifier to adapt to the complexity of classification tasks. To further strengthen the robustness and generalization ability of the HFPNNC, we incorporate the synergistic combination of probabilistic constrained competitive response selection (PCCRS) and ℓ2-norm regularization least squares estimation (ℓ2-LSE) methods to manage the generation of network layers and the estimation of neuron weights. As key constituents of the CRT approach, the PCCRS and ℓ2-LSE method strike a balance between model complexity and performance. The effectiveness of the proposed HFPNNC is thoroughly evaluated against classical classifiers, state-of-the-art fuzzy classifiers and deep learning baseline models using 17 public datasets, two real-world datasets, and three large-scale datasets. HFPNNC achieves the best prediction in 72.7% of the data. The experimental results and the statistical analysis show a remarkable advantage of the HFPNNC over existing methods, confirming its potential as a flexible, interpretable solution for classification tasks.
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 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.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, 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".