MétaCan
Menu
Back to cohort
Record W2378132571

One Method of Attribute Reduction Base on Rough Set Theory and Apply in Pattern Recognition

2009· article· en· W2378132571 on OpenAlexvenueno aff
Zhijun Wang

Bibliographic record

VenueMicrocomputer applications · 2009
Typearticle
Languageen
FieldComputer Science
TopicRough Sets and Fuzzy Logic
Canadian institutionsnot available
Fundersnot available
KeywordsRough setComputer scienceReduction (mathematics)Pattern recognition (psychology)Base (topology)Set (abstract data type)Data miningAttribute domainArtificial intelligenceSet theoryValue (mathematics)Dominance-based rough set approachMachine learningMathematics
DOInot available

Abstract

fetched live from OpenAlex

Rough set theory can effectively analyze information and find hidden knowledge or latent law. Base on attribute reduction in rough set theory,we can simplify unnecessary attributes and acquire decision rules. This method is used in pattern recognition of seven-segment LED,and the result is satisfied. It is proved that rough set theory has important application value in pattern recognition.

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 imitation

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

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.004
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.003
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.003
Bibliometrics0.0040.003
Science and technology studies0.0010.001
Scholarly communication0.0020.003
Open science0.0010.001
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0030.001

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.032
GPT teacher head0.281
Teacher spread0.250 · 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 source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
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

Citations0
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueMicrocomputer applicationsSame topicRough Sets and Fuzzy LogicFrench-language works237,207