Pattern recognition using robust discrimination and fuzzy set theoretic preprocessing
Bibliographic record
Abstract
Classification is the empirical process of creating a mapping from individual patterns to a set of classes and its subsequent use in predicting the classes to which new patterns belong. Tremendous energies have been expended in developing systems for the creation of the mapping component. Less effort has been devoted to the nature and analysis of the data component, namely, strategies that transform the data in order to simplify, in some sense, the classification process. The purpose of this thesis is to redress somewhat this imbalance by introducing two novel preprocessing methodologies. Fuzzy interruptible encoding determines the respective degrees to which a feature belongs to a collection of fuzzy sets and subsequently using these membership grades in place of the original feature. Burnishing tarnished gold standards compensates for the possible imprecision of a well-established reference test by adjusting, if necessary, the class labels in the design set while maintaining the test's vital discriminatory power. The methodologies were applied to several synthetic data sets as well as biomedical spectra acquired from magnetic resonance and infrared spectrometers. Both fuzzy encoding and burnishing consistently improved the discriminatory power of the underlying classifiers. They are insensitive to outliers and often reduce the training time for iterative classifiers such as the multi-layer perceptron. With the latter, reclassification only occurs for data within the design set; outliers within the test set are flagged but not altered. Therefore, the accepted gold standard is left in a pristine state sullied only by its original tarnish.
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.007 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 0.002 |
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".