MétaCan
Menu
Back to cohort
Record W2130025037 · doi:10.1145/2245276.2245314

A new class of constraints for constrained frequent pattern mining

2012· article· en· W2130025037 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
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Manitoba
Fundersnot available
KeywordsMonotone polygonProperty (philosophy)Class (philosophy)Computer scienceExploitData miningConstraint (computer-aided design)Sequential Pattern MiningTheoretical computer scienceMathematicsArtificial intelligence

Abstract

fetched live from OpenAlex

Most of the frequent pattern mining algorithms search for all frequent patterns. However, there are many real-life situations in which users are interested in only some tiny portions of the mined frequent patterns. For mining of constrained frequent patterns, several classes of user constraints---such as anti-monotone constraints---have been proposed and their properties have been exploited. In this paper, we introduce a new class of constraints called mixed monotone constraints. We exploit its property for effective mining of frequent patterns satisfying user constraints that sum both positive and negative numerical values.

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: Other design · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.868
Threshold uncertainty score0.261

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.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.034
GPT teacher head0.281
Teacher spread0.248 · 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

Citations9
Published2012
Admission routes1
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207