MétaCan
Menu
Back to cohort
Record W2162711978 · doi:10.1109/nafips.2004.1336322

A rough sets based approach to feature selection

2004· article· en· W2162711978 on OpenAlexaff
M. Zhang, JingTao Yao

Bibliographic record

VenueIEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04. · 2004
Typearticle
Languageen
FieldComputer Science
TopicRough Sets and Fuzzy Logic
Canadian institutionsUniversity of Regina
Fundersnot available
KeywordsRough setFeature selectionParameterized complexityHeuristicComputer scienceFeature (linguistics)Artificial intelligenceSet (abstract data type)Pattern recognition (psychology)Selection (genetic algorithm)Data miningMachine learningAlgorithm

Abstract

fetched live from OpenAlex

Feature selection techniques aim at reducing the number of unnecessary features in classification rules. The features are measured by their necessity in heuristic feature selection techniques. Rough set theory has been used to define the necessity of features in literature. We propose a new rough set based feature selection approach called Parameterized Average Support Heuristic (PASH). The PASH considers the overall quality of the potential set of rules. It selects features causing high average support of rules over all decision classes. In addition, the PASH arms with parameters that are used to adjust the level of approximation.

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 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.001
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: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.752
Threshold uncertainty score0.963

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.002
Science and technology studies0.0010.000
Scholarly communication0.0000.003
Open science0.0020.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.012
GPT teacher head0.233
Teacher spread0.221 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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

Quick stats

Citations68
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Annual Meeting of the Fuzzy Information, 2004. Processing NAFIPS '04.Same topicRough Sets and Fuzzy LogicFrench-language works237,207