dc.contributorUniversidade Estadual Paulista (Unesp)
dc.date.accessioned2021-06-25T12:16:32Z
dc.date.accessioned2022-12-19T22:52:12Z
dc.date.available2021-06-25T12:16:32Z
dc.date.available2022-12-19T22:52:12Z
dc.date.created2021-06-25T12:16:32Z
dc.date.issued2021-05-12
dc.identifierEvolutionary Intelligence. Heidelberg: Springer Heidelberg, 18 p., 2021.
dc.identifier1864-5909
dc.identifierhttp://hdl.handle.net/11449/209385
dc.identifier10.1007/s12065-021-00609-7
dc.identifierWOS:000650060500001
dc.identifier.urihttps://repositorioslatinoamericanos.uchile.cl/handle/2250/5389983
dc.description.abstractMachine learning techniques have been extensively researched in the last years, mainly due to their effectiveness when dealing with recognition or classification applications. Typically, one can comprehend using a Machine Learning system to autonomously delegate routines, save human efforts, and produce great insights regarding decision-making tasks. This paper introduces and validates a stacking-based ensemble approach using Optimum-Path Forest classifiers in intrusion detection tasks. Instead of only using the famous NSL-KDD dataset, we propose a new dataset called uneSPY, which we believe will fill the gap concerning new intrusion detection datasets. Both datasets were evaluated under several classifiers, including Logistic Regression, Decision Trees, Support Vector Machines, Optimum-Path Forests, and compared against Optimum-Path Forest stacking-based ensembles. Experimental results showed an Optimum-Path Forest stacking-based ensemble classification suitability, particularly when considering its ability to generalize large volumes of data while sustaining its performance.
dc.languageeng
dc.publisherSpringer
dc.relationEvolutionary Intelligence
dc.sourceWeb of Science
dc.subjectMachine learning
dc.subjectOptimum-path forest
dc.subjectEnsemble
dc.subjectStacking-based ensemble
dc.subjectIntrusion detection
dc.titleOptimum-path forest stacking-based ensemble for intrusion detection
dc.typeArtículos de revistas


Este ítem pertenece a la siguiente institución