MétaCan
Menu
Back to cohort
Record W2163024037 · doi:10.1109/icdmw.2010.145

Evaluating Association Rules by Quantitative Pairwise Property Comparisons

2010· article· en· W2163024037 on OpenAlex
Elnaz Delpisheh, John Z. Zhang

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Lethbridge
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsPairwise comparisonAssociation rule learningComputer scienceAnalytic hierarchy processData miningProperty (philosophy)Task (project management)Measure (data warehouse)Association (psychology)Selection (genetic algorithm)Domain (mathematical analysis)Process (computing)Set (abstract data type)Machine learningArtificial intelligenceMathematicsOperations researchEngineering

Abstract

fetched live from OpenAlex

Evaluating association rules is an integral post process in association rule mining. Association rules are examined by measures for their interestingness. Different interestingness measures have been proposed. Given an association rule mining task, measures are assessed and selected against a set of user-specified properties. However, in practice, due to the subjectivity and imperfection in property specifications, it is a non-trivial task to make appropriate measure selection. In this work, we propose a novel measure selection approach that makes use of the Analytic Hierarchy Process (AHP), a scheme for making complex decisions. Our approach captures a user's desired requirements quantitatively in an application domain to assess interestingness measures. It detects inconsistencies in property specifications, and is invariant to the number of association rules to be evaluated. The effectiveness of our approach is shown through case studies.

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: Methods · Consensus signal: Methods
Teacher disagreement score0.942
Threshold uncertainty score0.417

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.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.069
GPT teacher head0.360
Teacher spread0.291 · 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

Citations2
Published2010
Admission routes2
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207