You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/8282
Title: 
An Optimum-Path Forest framework for intrusion detection in computer networks
Author(s): 
Institution: 
Universidade Estadual Paulista (UNESP)
ISSN: 
0952-1976
Sponsorship: 
Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP)
Sponsorship Process Number: 
  • FAPESP: 09/16206-1
  • FAPESP: 10/02045-3
  • FAPESP: 10/11676-7
Abstract: 
Intrusion detection systems that make use of artificial intelligence techniques in order to improve effectiveness have been actively pursued in the last decade. However, their complexity to learn new attacks has become very expensive, making them inviable for a real time retraining. In order to overcome such limitations, we have introduced a new pattern recognition technique called optimum-path forest (OPF) to this task. Our proposal is composed of three main contributions: to apply OPF for intrusion detection, to identify redundancy in some public datasets and also to perform feature selection over them. The experiments have been carried out on three datasets aiming to compare OPF against Support Vector Machines, Self Organizing Maps and a Bayesian classifier. We have showed that OPF has been the fastest classifier and the always one with the top results. Thus, it can be a suitable tool to detect intrusions on computer networks, as well as to allow the algorithm to learn new attacks faster than other techniques. (C) 2012 Elsevier Ltd. All rights reserved.
Issue Date: 
1-Sep-2012
Citation: 
Engineering Applications of Artificial Intelligence. Oxford: Pergamon-Elsevier B.V. Ltd, v. 25, n. 6, p. 1226-1234, 2012.
Time Duration: 
1226-1234
Publisher: 
Pergamon-Elsevier B.V. Ltd
Keywords: 
  • Intrusion detection system
  • Optimum-Path Forest
  • Computer security
  • Machine learning
Source: 
http://dx.doi.org/10.1016/j.engappai.2012.03.008
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/8282
Appears in Collections:Artigos, TCCs, Teses e Dissertações da Unesp

There are no files associated with this item.
 

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.