MétaCan
Menu
Back to cohort
Record W2019503106 · doi:10.1504/ijgcrsis.2010.036981

Associative classification using patterns from nested granules

2010· article· en· W2019503106 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

VenueInternational Journal of Granular Computing Rough Sets and Intelligent Systems · 2010
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Guelph
Fundersnot available
KeywordsAssociative propertyComputer sciencePattern recognition (psychology)Artificial intelligenceMathematicsPure mathematics

Abstract

fetched live from OpenAlex

To facilitate interpretation and consider the internal association relationships between values of a pattern used in associative classification, a new form of multiple value pattern known as nested high-order pattern (NHOP) is presented. Taking an associative pair as information granule, the pattern is formed as multiple levels of association events. The general form of high-order pattern (HOP), that NHOP is a subtype, is identified as variable outcomes extracted from a random N-tuple. The pattern is detected by statistical testing if the occurrence is significantly deviated from the expected according to a prior model or null hypothesis. In this paper, we propose a classification method (called C-NHOP) based on nested high-order patterns. The rationale is that complex association patterns reinforce the underlying meaningfulness in interpreting regularity, thus, can provide a better understanding of the data domain. In evaluating our method using 26 UCI machine learning benchmark datasets, the experiments show a highly competitive and interpretable result.

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.966
Threshold uncertainty score0.641

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.0010.001
Open science0.0010.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.307
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