Improved C-Fuzzy Decision Tree with controllable membership Characteristics for Intrusion Detection

Makkithaya, Krishnamoorthi and Subbareddy , NV and Acharya, Dinesh U (2008) Improved C-Fuzzy Decision Tree with controllable membership Characteristics for Intrusion Detection. In: INternational Conference on Artificial Intelligence and Pattern Recognition, 7-10 July 2008, Orlando, Florida, USA..

[img] PDF
aipr174.pdf - Published Version
Restricted to Registered users only

Download (393kB) | Request a copy

Abstract

As the number of networked computers grows, intrusion detection is an essential component in keeping networks secure. Various approaches for intrusion detection are currently being in use with eash one has its own merits and demerits. This paper presents an improved c-fuzzy desisio tree with controllable membership characteristics for intrusion detection.The tree grows gradually by using fuzzy C-means clustering (FCM) algorithm to split the patterns in a selected node with the maximum heterogeneity into C corresponding children nodes. We use a modified fuzzy C-means algorithm with an extended distance measure to include an additional higher order tern, as defined in. We also used a hybrid model to select suitable intial points for the FCM. Experimental results have shown that our improved version performs beter resulting in an effective intrusion detection system.

Item Type: Conference or Workshop Item (Paper)
Uncontrolled Keywords: Data mining, Decision tree Intrusion detection, Hybrid model, Fuzzy c-means clustering.
Subjects: Engineering > MIT Manipal > Computer Science and Engineering
Engineering > MIT Manipal > MCA
Depositing User: MIT Library
Date Deposited: 08 Jul 2011 11:04
Last Modified: 08 Jul 2011 11:04
URI: http://eprints.manipal.edu/id/eprint/570

Actions (login required)

View Item View Item