Uncertainty Oriented-Incremental Erasable Pattern Mining Over Data Streams
Bibliographic record
Abstract
In a manufacturing factory, product lines are organized by several constituents and exhibit a profit value, i.e., income from products. Erasable patterns are less profitable patterns whose gain, i.e., the sum of product profits, does not exceed a user-defined threshold. Mining erasable patterns provides the necessary information to users who want to increase profits by erasing less profitable patterns. There are requirements for a method which efficiently manages uncertain databases in incremental environments to identify erasable patterns that consider uncertainty. Because our novel technique uses a list structure, it is more efficient at finding erasable patterns from incremental databases. Moreover, accumulated stream data should be handled efficiently to identify new useful patterns in both additional data and the existing data. In this article, an algorithm using a list-based structure is proposed to extract erasable patterns containing valuable knowledge from uncertain databases in real time with effective and productive performance. In order to derive erasable patterns from continuously accumulated stream databases, the structure efficiently manages the information gathered from the previous database. Extensive performance and pattern quality evaluations were conducted using real and synthetic datasets. The results show that the algorithm performs up to seven times faster than state-of-the-art erasable pattern mining algorithms on real datasets and scales adeptly on synthetic datasets while delivering reliable and significant result patterns.
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.001 | 0.006 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".