MétaCan
Menu
Back to cohort
Record W2130969489 · doi:10.1109/icdm.2002.1184010

ESRS: a case selection algorithm using extended similarity-based rough sets

2003· article· en· W2130969489 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Data Classification
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsSimilarity (geometry)Rough setComputer scienceSelection (genetic algorithm)Data miningSet (abstract data type)AlgorithmData setArtificial intelligenceFunction (biology)Noise (video)Pattern recognition (psychology)Case-based reasoningImage (mathematics)

Abstract

fetched live from OpenAlex

A case selection algorithm selects representative cases from a large data set for future case-based reasoning tasks. This paper proposes the ESRS algorithm, based on extended similarity-based rough set theory, which selects a reasonable number of the representative cases while maintaining satisfactory classification accuracy. It also can handle noise and inconsistent data. Experimental results on synthetic and real sets of cases showed that its predictive accuracy is similar to that of well-known machine learning systems on standard data sets, while it has the advantage of being applicable to any data set where a similarity function can be defined.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.967
Threshold uncertainty score0.466

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.035
GPT teacher head0.308
Teacher spread0.273 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations2
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and Data ClassificationFrench-language works237,207