MétaCan
Menu
Back to cohort
Record W1525895928 · doi:10.1002/sam.11394

Standardizing interestingness measures for association rules

2018· preprint· en· W1525895928 on OpenAlexafffund
Mateen Shaikh, Paul D. McNicholas, Maria-Luiza Antonie, Thomas Brendan Murphy

Bibliographic record

VenueStatistical Analysis and Data Mining The ASA Data Science Journal · 2018
Typepreprint
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of GuelphMcMaster UniversityThompson Rivers University
FundersOntario Ministry of Research and InnovationNatural Sciences and Engineering Research Council of Canada
KeywordsMeasure (data warehouse)Lift (data mining)Computer scienceRaw dataAssociation rule learningStandardizationAssociation (psychology)Data miningValue (mathematics)Machine learningPsychology

Abstract

fetched live from OpenAlex

Interestingness measures provide information about association rules. The value of an interestingness measure is often interpreted relative to the overall range of the interestingness measure. However, properties of individual association rules can further restrict what value an interestingness measure can achieve. These additional constraints are not typically taken into account in analysis, potentially misleading the investigator. Considering the value of an interestingness measure relative to this further constrained range provides greater insight than the original range alone and can even alter researchers' impressions of the data. Standardizing interestingness measures takes these additional restrictions into account, resulting in values that provide a relative measure of the attainable values. We explore the impacts of standardizing interestingness measures on real and simulated data.

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.077
metaresearch head score (Gemma)0.353
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods
Teacher disagreement score0.077
Threshold uncertainty score0.408

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0770.353
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0030.002
Bibliometrics0.0130.010
Science and technology studies0.0020.007
Scholarly communication0.0080.011
Open science0.0030.005
Research integrity0.0030.005
Insufficient payload (model declined to judge)0.0010.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.120
GPT teacher head0.397
Teacher spread0.277 · 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 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

Citations2
Published2018
Admission routes2
Has abstractyes

Explore more

Same venueStatistical Analysis and Data Mining The ASA Data Science JournalSame topicData Mining Algorithms and ApplicationsFrench-language works237,207