Use of dimensionality reduction for intrusion detection

  • Authors:
  • Subrat Kumar Dash;Sanjay Rawat;Arun K. Pujari

  • Affiliations:
  • Artificial Intelligence Lab, Dept. of CIS, University of Hyderabad, India;Dipartimento di Ingegneria e Scienza dell'Informazione, Università di Trento, Italy;LNMIIT, Jaipur, India and Artificial Intelligence Lab, Dept. of CIS, University of Hyderabad, India

  • Venue:
  • ICISS'07 Proceedings of the 3rd international conference on Information systems security
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Dimensionality reduction is crucial when data mining techniques are applied for intrusion detection. Usually, the Host based intrusion detection problem is formulated as a classification problem and different classification algorithms are applied to high dimensional vectors that represent the system call sequences. Any such classification algorithm demands repeated computation of similarity between pairs of vectors and the computational overhead increases with the increase in the dimensionality of the vectors. Here, we believe that dimensionality reduction of these vectors will help in classification. However, the choice of dimensionality reduction method critically depends on preservation of similarity for efficient classification. We show that Locally Linear Embedding (LLE) preserves the similarity in this context. In this paper, we examine its applicability in two different approaches for system call data with benchmark dataset.