Bibliographic record
Abstract
The big data security and its management are significantly important given the increasing volume of data in computer networks.In this regard, data mining algorithms have been introduced as the applicable data analysis tools.Classification algorithms are important techniques in data mining.Decision tree algorithms have many applications in intrusion detection problems due to producing classified results in a meaningful and tree structure.Given the importance of intrusion detection velocity in networks, the parallel processing of classification algorithms on a big data context has been a challenging issue.In this research implemented a distributed and scalable method based on C5.0 decision tree for the intrusion detection problem using a new and advanced Spark framework in the field of data processing and used the most important feature selection to improve the system efficiency.Due to the use this framework and its high ability in in-memory processing.Finally, the proposed algorithm was evaluated using the standard KDDCUP99 dataset.The evaluation results indicated the scalability and high speed of the proposed algorithm.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.003 | 0.002 |
| Open science | 0.001 | 0.003 |
| Research integrity | 0.003 | 0.001 |
| Insufficient payload (model declined to judge) | 0.955 | 0.957 |
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; the direct Gemma label and the distilled Codex classifier agree on what is shown here.
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".