Data Transformation-Driven Fuzzy Clustering Neural Network With Layerwise and End-to-End Training
Bibliographic record
Abstract
In this study, we propose a novel data transformation-driven fuzzy clustering neural network (DTFCNN) to enhance the dimensionality reduction function and end-to-end refinment learning ability of the entire structure. Unlike conventional fuzzy clustering-based neural networks, which rely on fuzzy c-means clustering in the hidden layer and least squares error-based learning for connection weights, the DTFCNN utilizes backpropagation (BP) learning as a refinement algorithm. This refinement process enables iterative fine-tuning of the model’s parameters, allowing it to adapt more effectively to complex patterns. By using BP, DTFCNN enhances its ability to learn intricate feature interactions and extract relevant features from high-dimensional spaces, thereby significantly improving the model’s flexibility and performance. The proposed DTFCNN consists of four layers. First, a preprocessing layer employs principal component analysis for feature extraction and dimensionality reduction, where eigenvectors are used as connection weights for the preprocessing layer. Second, a hidden layer utilizes fuzzy c-means clustering for generating fuzzy membership degrees, and centers serve as connection weights for hidden layers. The entries of the partition matrix also are regarded as membership degrees. In the output layer, a linear-driven affine transform is used for fitting connection weights, and a SoftMax function is employed to express the outputs as probabilities. Finally, all parameters, such as eigenvectors, centers, and coefficients, from the preprocessing layer to the output layer are refined through BP-based learning. To validate the effectiveness of the DTFCNN, we conducted a collection of comparison experiments: 1) publicly benchmark datasets with statistical analysis, 2) facial recognition datasets for application-specific testing, and 3) three large-scale datasets. The results demonstrate that the DTFCNN outperforms classical classifiers, state-of-the-art fuzzy classifiers, and deep learning baselines in terms of accuracy and generalization capability. The DTFCNN model uses fewer parameters than deep learning baselines, resulting in faster training times without compromising performance. Overall, the DTFCNN achieves higher accuracy while maintaining model adaptability.
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.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 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".