Shadowed Neighborhoods Based on Fuzzy Rough Transformation for Three-Way Classification
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
Neighborhoods form a set-level approximation of data distribution for learning tasks. Due to the advantages of data generalization and nonparametric property, neighborhood models have been widely used for data classification. However, the existing neighborhood-based classification methods rigidly assign a certain class label to each data instance and lack the strategies to handle the uncertain instances. The far-fetched certain classification of uncertain instances may suffer serious risks. To tackle this problem, in this article, we propose a novel shadowed set to construct shadowed neighborhoods for uncertain data classification. For the fuzzy-rough transformation in the proposed shadowed set, a step function is utilized to map fuzzy neighborhood memberships to the set of triple typical values {0, 1, 0.5} and thereby partition a neighborhood into certain regions and uncertain boundary (neighborhood shadow). The threshold parameter in the step function for constructing shadowed neighborhoods is optimized through minimizing the membership loss in the mapping of shadowed sets. Based on the constructed shadowed neighborhoods, we implement a three-way classification algorithm to distinguish data instances into certain classes and uncertain case. Experiments validate the proposed three-way classification method with shadowed neighborhoods is effective in handling uncertain data and reducing the classification risk.
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.
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.000 | 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 it