Towards a New Approach to Empower Periodic Pattern Mining for Massive Data using Map-Reduce
Bibliographic record
Abstract
Recent applications like social networks and IoT are the main source of the massive amount of data generated every day. Time series data is a major form where data is sequenced and indexed by timestamps. Multiple data mining techniques are applied to discover the behavior of time series datasets, periodic pattern mining is one of them. Many sequential pattern mining algorithms were presented, some of them built suffix trees and performed early pruning while other algorithms used pattern-growth techniques such as projection. A few algorithms performed Apriori-based techniques where lattice trees were built and traversed. However, most algorithms suffer from time and space issues when mining large scale time series sequences. In our paper, we present a solution that utilizes advanced and sophisticated distributed systems such as MapReduce framework. It splits the original sequence and distributes its segments across thousands of nodes in the MapReduce infrastructure. We use different training datasets to evaluate both traditional pattern mining algorithms and our MapReduce solution. After analyzing our solution in terms of time complexity, efficiency and accuracy, we clarify the advantages of processing data segments using periodic pattern mining along with MapReduce framework.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.003 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".