2023
DOI: 10.11591/beei.v12i4.4708
|View full text |Cite
|
Sign up to set email alerts
|

Machine learning techniques for accurate classification and detection of intrusions in computer network

Abstract: An incursion into the computer network or system in issue occurs whenever there is an attempt made to circumvent the defences that are in place. Training and examination are the two basic components that make up the intrusion detection system (IDS) and each one may be analysed separately. During training, a number of distinct models are built, each of which is able to distinguish between normal and abnormal behaviours that are included within the dataset. This article proposes a combination of ant colony optim… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 23 publications
0
2
0
Order By: Relevance
“…The equation above represents the core principle of gradient boosting, where each weak learner's contribution is optimized to improve the ensemble's performance iteratively. In (1) shows the gradient boosting algorithms, where 𝐴 𝑖 (π‘Ÿ) is the ensemble's prediction at iteration 𝑖 for input π‘₯. 𝐴 π‘–βˆ’1 (π‘Ÿ) is the ensemble's prediction at iteration 𝑖 βˆ’ 1 for input π‘Ÿ. 𝛾 𝑖 is the learning rate or step size for iteration 𝑖 controlling the contribution of the weak learner π‘˜ 𝑖 (π‘Ÿ) to the ensemble. π‘˜ 𝑖 (π‘Ÿ) is the weak learner's prediction at iteration 𝑖 for input π‘Ÿ.…”
Section: Gradient Boosting Machines In Cloud-based Machine Learning: ...mentioning
confidence: 99%
See 1 more Smart Citation
“…The equation above represents the core principle of gradient boosting, where each weak learner's contribution is optimized to improve the ensemble's performance iteratively. In (1) shows the gradient boosting algorithms, where 𝐴 𝑖 (π‘Ÿ) is the ensemble's prediction at iteration 𝑖 for input π‘₯. 𝐴 π‘–βˆ’1 (π‘Ÿ) is the ensemble's prediction at iteration 𝑖 βˆ’ 1 for input π‘Ÿ. 𝛾 𝑖 is the learning rate or step size for iteration 𝑖 controlling the contribution of the weak learner π‘˜ 𝑖 (π‘Ÿ) to the ensemble. π‘˜ 𝑖 (π‘Ÿ) is the weak learner's prediction at iteration 𝑖 for input π‘Ÿ.…”
Section: Gradient Boosting Machines In Cloud-based Machine Learning: ...mentioning
confidence: 99%
“…Intrusion detection finds these. An intrusion detection system (IDS) monitors network traffic for intrusions [1]. The majority of phishing assaults work because people have already developed trusting relationships with businesses [2].…”
Section: Introductionmentioning
confidence: 99%