AFSSE: An Interpretable Classifier With Axiomatic Fuzzy Set and Semantic Entropy
Bibliographic record
Abstract
In this article, a novel interpretable classifier is proposed on the basis of axiomatic fuzzy set (AFS) theory and semantic entropy. AFS theory provides a unified and coherent way to deal with uncertainty of randomness and imprecision of fuzziness in data mining and knowledge discovery, which support many investigations in classification area. However, the existing AFS-based classifiers are weak in obtaining the optimal semantic description. To address this drawback, a new measure, named semantic entropy extended in Shannon's entropy, is developed to evaluate the discriminatory capabilities of semantic descriptions for each category. Moreover, the semantic entropy is utilized to design a classifier in the framework of AFS theory, called axiomatic fuzzy set and semantic entropy (AFSSE), which is capable of achieving sound classification performance and interpretability. Meanwhile, it provides a new framework of classifier design that can adapt more human-oriented recognition mechanisms. Furthermore, an evaluation index is used to prune descriptions to deliver a promising performance. Compared to the previous AFS-based classifiers, the proposed approach offers a semantic entropy to measure the information that is derived from semantic descriptions of data, so that the optimal semantic descriptions of each class can be obtained. For the purpose of illustrating the effectiveness of the classifier, several datasets are utilized to facilitate a comparative analysis of the proposed approach and other state-of-the-art classifiers. The experimental studies demonstrate that the proposed approach can achieve the semantic descriptions of each class and the performance of AFSSE is comparable with the performance of other approaches.
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.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.002 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".