@ARTICLE { Rsds4376,
author = {Pujari, Arun K. and Gulati, V.P. and Rawat, Sanjay}, 
title = {A Fast Host-Based Intrusion Detection System Using Rough Set Theory}, 
booktitle = {T. Rough Sets}, 
journal = {Transactions on Rough Sets}, 
number = 	{(no. IV)}, 
volume = 3700, 
pages = {144--161}, 
publisher = {Springer-Verlag}, 
address = {Heidelberg - Berlin, Germany}, 
year = 2005, 
issn = {0302-9743}, 
isbn = {978-3-540-29830-4}, 
abstract = {Intrusion Detection system has become the main research focus in the area of information security. Last few years have witnessed a large variety of technique and model to provide increasingly efficient intrusion detection solutions. We advocate here that the intrusive behavior of a process is highly localized characteristics of the process. There are certain smaller episodes in a process that make the process intrusive in an otherwise normal stream. As a result it is unnecessary and most often misleading to consider the whole process in totality and to attempt to characterize its abnormal features. In the present work we establish that subsequences of reasonably small length of sequence of system calls would suffice to identify abnormality in a process. We make use of rough set theory to demonstrate this concept. Rough set theory also facilitates identifying rules for intrusion detection. The main contributions of the paper are the following- (a) It is established that very small subsequence of system call is sufficient to identify intrusive behavior with high accuracy. We demonstrate our result using DARPA'98 BSM data; (b) A rough set based system is developed that can extract rules for intrusion detection; (c) An algorithm is presented that can determine the status of a process as either normal or abnormal on-line.}, 
keywords = {data mining, decision table, rough set, intrusion detection, anomaly, misuse, }, 
}