Hybrid Leap Boost (HLB) Algorithm for Detection of Attacks Using Intrusion Detection in Cloud Network
Bibliographic record
Abstract
The rapid revolution of technology development made the growth of communication and network technology towards increasing scale. Massive connectivity of devices over the cloud allows the unauthorized users to inject malwares. Intrusion attacks are security issues commonly occur in cloud connected systems that create degradation in cloud security. In terms of cloud security, the impacted parameters that involved in the attack scenario is important. The proposed system focused on Brute force FTP attack (BF-FTP), Brute force SSH attack (BF-SSH), DoS attack, DDoS attack, Web attack (WA), Botnet (BN) etc. The novel algorithm is derived through Sailing frog leap-based optimization algorithm for feature mapping, Density weighted boosted regression (DWB) for classification mapping. The Novel hybrid leap boost algorithm (HLB) is formulated here. The proposed approach focused on classification accuracy on specified attacks from labeled IDS2017 dataset. The (CIC) Canadian institute of cyber security dataset is the publicly available reliable dataset on smart city recording. The data is unbalanced in nature. Classification of CIC data with proposed newly innovated HLB process is challenging. The system achieved the accuracy of 91%. Further the impacted values are required to be enhanced in research scope.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".