MétaCan
Menu
Back to cohort
Record W1853932977 · doi:10.1504/ijbidm.2015.071324

High performance framework for mining association rules from hierarchical data cubes

2015· article· en· W1853932977 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

VenueInternational Journal of Business Intelligence and Data Mining · 2015
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsConcordia University
Fundersnot available
KeywordsOnline analytical processingComputer scienceData cubeAssociation rule learningData miningDimension (graph theory)HierarchyCube (algebra)Data stream miningGranularityData warehouseOverhead (engineering)DatabaseTheoretical computer scienceInformation retrievalProgramming language

Abstract

fetched live from OpenAlex

Online analytical processing (OLAP) is considered as a database prototype that gives a platform for the rich analysis of multidimensional data. A logical data structure known as the data cube often supports the OLAP. However, mining association rules from multidimensional data using OLAP techniques with data mining facilities is an issue of substantial complexity. In practice, the complexity is excited by the existence of dimension hierarchies that subdivide dimensions into aggregation layers of various granularity. Discovery of hierarchy-sensitive association rules can be very costly on large cubes. In this paper, we present an OLAP hierarchy-sensitive framework that supports the efficient and transparent manipulation of dimension hierarchies for extracting association rules from data cube. The experimental results show that, when compared to the alternatives, very slight overhead is required to handle streams of inter-dimensional association rules requests.

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.003
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.980
Threshold uncertainty score0.945

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.003
Open science0.0050.002
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.134
GPT teacher head0.359
Teacher spread0.226 · 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