Intrusion detection system (IDS) has played a central role as an appliance to effectively defend our crucial computer systems or networks against attackers on the Internet. The most widely deployed and commercially available methods for intrusion detection employ signaturebased detection. However, they cannot detect unknown intrusions intrinsically which are not matched to the signatures, and their methods consume huge amounts of cost and time to acquire the signatures. In order to cope with the problems, many researchers have proposed various kinds of methods that are based on unsupervised learning techniques. Although they enable one to construct intrusion detection model with low cost and effort, and have capability to detect unforeseen attacks, they still have mainly two problems in intrusion detection: a low detection rate and a high false positive rate. In this paper, we present a new clustering method to improve the detection rate while maintaining a low false positive rate. We evaluated our method using KDD Cup 1999 data set. Evaluation results show that superiority of our approach to other existing algorithms reported in the literature. Copyright © 2008 The Institute of Electronics, Information and Communication Engineers.
CITATION STYLE
Song, J., Ohira, K., Takakura, H., Okabe, Y., & Kwon, Y. (2008). A clustering method for improving performance of anomaly-based intrusion detection system. IEICE Transactions on Information and Systems, E91-D(5), 1282–1291. https://doi.org/10.1093/ietisy/e91-d.5.1282
Mendeley helps you to discover research relevant for your work.