MétaCan
Menu
Back to cohort
Record W4250529056 · doi:10.1109/grc.2007.4403119

A Method of Finding Representative Sets of Rules

2007· article· en· W4250529056 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.
fundA Canadian funder is recorded on the work.

Bibliographic record

Venue2007 IEEE International Conference on Granular Computing (GRC 2007) · 2007
Typearticle
Languageen
FieldEngineering
TopicAdvanced Research in Systems and Signal Processing
Canadian institutionsYork University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsComputer science

Abstract

fetched live from OpenAlex

The use of rough sets theory to select essential attributes that can represent the original data set is well known. Knowledge discovered from such essential attributes are typically represented as rules, and are therefore represen- tative of the original data. We present three results towards rule evaluation as an extension of the "Rules-as-Attributes measure". First, we present an approach of finding repre- sentative sets of rules for a given data set. Secondly, we suggest that the Johnson's Reducer of the ROSETTA soft- ware generates a reduct with the minimum number of rules, and can be considered as a minimum representation of the original knowledge. Our third result provides an integrated approach for rule evaluation based on both the Rule Impor- tance Measure and the method of finding representative sets of rules. We argue that this approach can take the represen- tative rules ranking into a further stage. These approaches are proposed to facilitate the rule evaluations and can pro- vide an automatic and complete comprehension of the orig- inal data set.

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.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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.842
Threshold uncertainty score0.771

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.000
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.079
GPT teacher head0.398
Teacher spread0.320 · 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