MétaCan
Menu
Back to cohort

PyramidViz: Visual Analytics and Big Data Visualization for Frequent Patterns

2016· article· en· W2529573579 on OpenAlexafffund
Carson K. Leung, Vadim V. Kononov, Adam G.M. Pazdor, Fan Jiang

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
KeywordsComputer scienceVisual analyticsVisualizationRepresentation (politics)Data visualizationAnalyticsBig dataData sciencePrefixInteractive visual analysisExtension (predicate logic)Information retrievalInformation visualizationData mining

Abstract

fetched live from OpenAlex

Frequent pattern mining aims discover implicit, previously unknown and potentially useful knowledge in the form of frequently co-occurring items, events, or objects. These discovered frequent patterns helps reveal interesting relationships such as consumer shopper behaviour. Existing mining algorithms mostly return a long textual list of frequent patterns to users. Such a long list may not be comprehensible by many users. As a picture is worth a thousand words, visual representation of frequent patterns is more comprehensible. Consequently, several visualizers have been proposed. While they are popular and benefit from a few advantages, they also suffer from some disadvantages. In this paper, we present a visual analytic solution, called PyramidViz, for visualizing and analyzing frequent patterns. PyramidViz shows frequent patterns in an informative and intuitive fashion so that users can easily get an insight about frequency of frequent patterns and relationships (e.g., prefix- extension relationships) among related frequent patterns. Evaluation results show the effectiveness and practicality of PyramidViz in visual analytics and big data visualization of frequent patterns for various reallife applications.

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.002
metaresearch head score (Gemma)0.010
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.017
Threshold uncertainty score0.056

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.010
Meta-epidemiology (narrow)0.0030.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0060.004
Science and technology studies0.0010.001
Scholarly communication0.0040.005
Open science0.0020.004
Research integrity0.0010.002
Insufficient payload (model declined to judge)0.0170.003

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.095
GPT teacher head0.338
Teacher spread0.243 · 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

Citations27
Published2016
Admission routes2
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207