A Data Science Model for Big Data Analytics of Frequent Patterns
Bibliographic record
Abstract
Frequent pattern mining is an important data mining task. Since its introduction, it has drawn attention from many researchers. Consequently, many frequent pattern mining algorithms have been proposed, which include level-wise Apriori-based algorithms, tree-based algorithms, and hyperlinked array structure based algorithms. While these algorithms are popular and benefit from a few advantages, they also suffer from some disadvantages. In the current era of big data, a wide variety of high volumes of valuable data of different veracities can be easily collected and generated at a high velocity. These big data lead to additional challenges for frequent pattern mining. In this paper, we present a data science model for big data analytics of frequent patterns with MapReduce. We evaluated our model by using social networks, which are good examples of big data. Evaluation results show the efficiency and practicality of our data science model in mining and analyzing big data for the discovery of interesting frequent patterns from various real-life applications including social network analysis.
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.005 | 0.019 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.003 |
| Bibliometrics | 0.004 | 0.007 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.005 | 0.010 |
| Open science | 0.003 | 0.002 |
| Research integrity | 0.002 | 0.003 |
| Insufficient payload (model declined to judge) | 0.003 | 0.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.
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".