Découverte de motifs fréquents dans les bases de données. Un cadre formel pour les méthodes
Bibliographic record
Abstract
We present here a formal framework introduced by Heikki Mannila et Hannu Toivonen for the frequent pattern mining and their uses. We detail the computation of a theory w.r.t. an antimonotonous constraint, with the algorithm GUESS & CORRECT. We then explain the levelwise algorithm and different ways to depth-first algorithms. Finally we examine the DIVIDE & CONQUER strategy. We then show that the difficulty of frequent patterns mining can be bypassed by using condensed representations of patterns. In order to highlight the interest of the frequent patterns, we end this article with introducing the uses of this patterns, which allow the classical task of data-mining: associations, supervised or unsupervised classification.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.010 | 0.047 |
| Meta-epidemiology (narrow) | 0.003 | 0.002 |
| Meta-epidemiology (broad) | 0.003 | 0.004 |
| Bibliometrics | 0.007 | 0.006 |
| Science and technology studies | 0.001 | 0.003 |
| Scholarly communication | 0.006 | 0.005 |
| Open science | 0.003 | 0.003 |
| Research integrity | 0.002 | 0.007 |
| Insufficient payload (model declined to judge) | 0.006 | 0.004 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".