MétaCan
Menu
Back to cohort
Record W1854757958

The 3W Model and Algebra for Unified Data Mining

2000· article· en· W1854757958 on OpenAlexaff
Theodore Johnson, Laks V. S. Lakshmanan, Raymond T. Ng

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicData Mining Algorithms and Applications
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceDimension (graph theory)Process (computing)Process calculusTask (project management)Relational algebraTheoretical computer scienceExtensional definitionComputationProcess miningKnowledge extractionData miningAlgebra over a fieldWork in processAlgorithmProgramming languageMathematicsRelational database
DOInot available

Abstract

fetched live from OpenAlex

Real data mining/analysis applications call for a framework which adequately supports knowledge discovery as a multi-step process, where the input of one mining operation can be the output of another. Previous studies, primarily focusing on fast computation of one specific mining task at a time, ignore this vital issue. Motivated by this observation, we develop a unified model supporting all major mining and analysis tasks. Our model consists of three distinct worlds, corresponding to intensional and extensional dimensions, and to data sets. The notion of dimension is a centerpiece of the model. Equipped with hierarchies, dimensions integrate the output of seemingly dissimilar mining and analysis operations in a clean manner. We propose an algebra, called the dimension algebra, for manipulating (intensional) dimensions, as well as operators that serve as "bridges" between the worlds. We demonstrate by examples that several real data mining processes can be captured ...

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.005
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.006
Threshold uncertainty score0.025

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0050.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.003
Bibliometrics0.0030.004
Science and technology studies0.0020.005
Scholarly communication0.0060.012
Open science0.0020.004
Research integrity0.0020.003
Insufficient payload (model declined to judge)0.0050.002

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.061
GPT teacher head0.293
Teacher spread0.233 · 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 designTheoretical or conceptual
Domainnot available
GenreMethods

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

Citations53
Published2000
Admission routes1
Has abstractyes

Explore more

Same topicData Mining Algorithms and ApplicationsFrench-language works237,207