MétaCan
Menu
Back to cohort

Feature Selection via Independent Domination

2023· article· en· W4390906038 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 institutionsArtificial Intelligence in Medicine (Canada)
Fundersnot available
KeywordsFeature selectionSelection (genetic algorithm)Computer scienceFeature (linguistics)Artificial intelligencePattern recognition (psychology)

Abstract

fetched live from OpenAlex

Feature or variable selection is a fundamental problem in data analysis and statistical modeling. Classic methods resulting in dimensionality reduction are diverse and include things like statistical hypotheses testing for zero coefficients, ‘stepwise’ methods minimizing, e.g., AIC, the spectra of a data matrix or principal component analysis, regularization methods especially the Lasso, various heuristic and ‘shrinkage’ methods all of which result in a subset of the feature space used as a basis for statistical modeling. Combinatorial variable selection has also been used in a manner that aids in the selection of a good subset of the feature space. A graph, or the ‘data graph’, is based on the pairwise correlations of features and may be used to extract the most distinguishing features. Partly due to high computational cost, combinatorial variable selection methods have not been well studied. We consider a variable selection procedure via the Minimum Independent Dominating Set problem. We explore the use of some exact and heuristic methods that proved to be effective for feature extracting and ranking.

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: none
Teacher disagreement score0.967
Threshold uncertainty score0.926

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.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.011
GPT teacher head0.261
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

Quick stats

Citations5
Published2023
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and Data ClassificationFrench-language works237,207