A Design of Fuzzy Rule-Based Classifier for Multiclass Classification and Its Realization in Horizontal Federated Learning
Bibliographic record
Abstract
Pattern recognition plays an important role in the process of knowledge discovery. The construction of easily describable and interpretable classification rules is of vital importance in pattern recognition. In this study, we propose a development of fuzzy rule-based classifier for multiclass classification problems and elaborate on a privacy-preserving realization of the proposed methodology in the presence of decentralized datasets. Fuzzy rule-based models provide an effective and efficient alternative for characterizing the complex relationship between the input variables and target classes. An overall design process of the proposed classifier consists of two main phases: (a) formation of information granules (clusters) to reveal the underlying structure of the training data, and (b) construction of local classification rules whose outputs reflect the probability distribution of the input data over all the classes. The constructed information granules form a backbone of the architecture of the classifier while the optimization of the parameters of local rules is carried out through using a gradient descent method with the guidance of the cross-entropy loss function. Furthermore, a federated gradient-based optimization mechanism is utilized to construct fuzzy classifier in a privacy-preserving approach. The originalities of the proposed methodology are twofold: first, a design of fuzzy classifier through the synergy of cluster-centric architecture and the cross-entropy loss function is presented. Second, we augment the proposed fuzzy classifier based on the concept of federated learning such that it can learn from distributed data without sacrificing data security and confidentiality. Experiments are carried out on a two-dimensional synthetic dataset and a number of real-world datasets. Experimental results show the excellent classification capability of the proposed classifier realized in the centralized way and in the federated learning environment.
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.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.002 | 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".