On the Use of Singular Value Decomposition for a Fast Intrusion Detection System

  • Authors:
  • Sanjay Rawat;Arun K. Pujari;V. P. Gulati

  • Affiliations:
  • Dept. of Computer & Information Sciences, University of Hyderabad, Hyderabad, India & IDRBT, Castle Hills, Masab Tank, Hyderabad, India;Dept. of Computer & Information Sciences, University of Hyderabad, Hyderabad, India;IDRBT, Castle Hills, Masab Tank, Hyderabad, India

  • Venue:
  • Electronic Notes in Theoretical Computer Science (ENTCS)
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

Traditionally, the application of data mining in intrusion detection systems (IDS) concentrates on the construction of operational IDSs. The main emphasis is on data mining steps, and other KDD (Knowledge Discovery in Databases) are largely ignored. The present study investigates the applicability of Spectral Analysis technique - singular value decomposition (SVD) as a preprocessing step to reduce the dimensionality of the data. This reduction highlights the most prominent features in the data by removing the noise. This preprocessing step not only makes the data noise-free, but also reduces the dimensionality of the data, thereby minimizing computational time. The proposed technique can be applied to other existing methods to improve their performance. We perform experiments on various data sets like DARPA'98, UNM sendmail, inetd, and login-ps data sets to show that reduction in the dimension of the data does not degrade the performance of the IDS. In fact, in case of single application monitoring like sendmail, by applying reduction techniques we get very encouraging results.