MétaCan
Menu
Back to cohort
Record W1963747491 · doi:10.1109/icdmw.2011.177

Visually Contrast Two Collections of Frequent Patterns

2011· article· en· W1963747491 on OpenAlexafffund
Christopher L. Carmichael, Yaroslav Hayduk, Carson K. Leung

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of Manitoba
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsContrast (vision)Computer scienceVisualizationRepresentation (politics)Information retrievalColor contrastArtificial intelligence

Abstract

fetched live from OpenAlex

Frequent pattern mining searches for frequently occurring sets of items or events. While users are interested in finding these frequent patterns in most situations, they may want to compare and contrast the mined frequent patterns in some other situations. For example, store managers may want to find out how the collections of frequently purchased items changed from one season to another. Similarly, regional managers may want to compare the frequently purchased items between two different branches. These are some examples of looking for temporal and/or spatial changes between mined frequent patterns. A visual representation of these patterns would be more comprehensive to users than the long textual list returned by many existing frequent pattern mining algorithms. However, many existing visualizers were not designed to show frequent patterns, let alone show the differences between them. In this paper, we propose a visualization system called Contrast Viz that enables users to visualize the mined frequent patterns and their differences.

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.001
metaresearch head score (Gemma)0.006
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: Empirical · Consensus signal: none
Teacher disagreement score0.011
Threshold uncertainty score0.038

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0050.003
Science and technology studies0.0010.000
Scholarly communication0.0030.004
Open science0.0010.002
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0110.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.036
GPT teacher head0.266
Teacher spread0.231 · 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
GenreEmpirical

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

Citations8
Published2011
Admission routes2
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207