Data Mining: A Bagged Decision Tree Classifier Algorithm For Ids Intrusion Detection System Based Attacks Classification
| Autor: | Sunita Chaudhary, Sandeep Adhikari |
|---|---|
| Rok vydání: | 2021 |
| Předmět: |
Network security
business.industry Computer science Decision tree learning Data classification General Engineering Denial-of-service attack Intrusion detection system computer.software_genre Variety (cybernetics) Resource (project management) Key (cryptography) Data mining business Algorithm computer |
| Zdroj: | Design Engineering. :1826-1839 |
| ISSN: | 0011-9342 |
| DOI: | 10.17762/de.v2021i04.1800 |
| Popis: | The exponential growth in the use of computers over networks, as well as the proliferation of applications that operate on different platforms, has drawn attention to network security. This paradigm takes advantage of security flaws in all operating systems that are both technically difficult and costly to fix. As a result, intrusion is used as a key to worldwide a computer resource's credibility, availability, and confidentiality. The Intrusion Detection System (IDS) is critical in detecting network anomalies and attacks. In this paper, the data mining principle is combined with IDS to efficiently and quickly identify important, secret data of interest to the user. The proposed algorithm addresses four issues: data classification, high levels of human interaction, lack of labeled data, and the effectiveness of distributed denial of service attacks. We're also working on a decision tree classifier that has a variety of parameters. The previous algorithm classified IDS up to 90% of the time and was not appropriate for large data sets. Our proposed algorithm was designed to accurately classify large data sets. Aside from that, we quantify a few more decision tree classifier parameters. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|