You are in the accessibility menu

Please use this identifier to cite or link to this item: http://acervodigital.unesp.br/handle/11449/72855
Title: 
Intrusion detection system using optimum-path forest
Author(s): 
Institution: 
  • Universidade Estadual Paulista (UNESP)
  • São Paulo State Technology College at Bauru
ISSN: 
0742-1303
Abstract: 
Intrusion detection systems that make use of artificial intelligence techniques in order to improve effectiveness have been actively pursued in the last decade. Neural networks and Support Vector Machines have been also extensively applied to this task. However, their complexity to learn new attacks has become very expensive, making them inviable for a real time retraining. In this research, we introduce a new pattern classifier named Optimum-Path Forest (OPF) to this task, which has demonstrated to be similar to the state-of-the-art pattern recognition techniques, but extremely more efficient for training patterns. Experiments on public datasets showed that OPF classifier may be a suitable tool to detect intrusions on computer networks, as well as allow the algorithm to learn new attacks faster than the other techniques. © 2011 IEEE.
Issue Date: 
1-Dec-2011
Citation: 
Proceedings - Conference on Local Computer Networks, LCN, p. 183-186.
Time Duration: 
183-186
Keywords: 
  • Artificial intelligence techniques
  • Data sets
  • Intrusion Detection Systems
  • Pattern classifier
  • Pattern recognition techniques
  • Real time
  • Training patterns
  • Computer crime
  • Forestry
  • Neural networks
  • Pattern recognition
  • Telecommunication networks
  • Intrusion detection
  • Algorithms
  • Artificial Intelligence
  • Neural Networks
  • Pattern Recognition
  • Telecommunications
Source: 
http://dx.doi.org/10.1109/LCN.2011.6115182
URI: 
Access Rights: 
Acesso restrito
Type: 
outro
Source:
http://repositorio.unesp.br/handle/11449/72855
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.