 Efficient intrusion detection system using random treeA.J. Deepa and V. Kavitha International Journal of Enterprise Network Management, 2015, vol. 6, issue 4, 275-285 Abstract: Due to the rapid growth of the network technologies in today's society, new forms of network attacks are emerging and have made the computer network security a worldwide priority. Intrusion detection systems (IDS) methods are used for modelling and identifying normal and abusive system behaviour. IDSs employ misuse or signature-based and statistical anomaly models to detect intrusions. Due to large volumes of audit data as well as complex and dynamic properties of intrusion behaviour, optimising performance of IDS becomes an important problem. In this paper a novel method use the data mining technique like random tree for identifying intrusions is proposed. Random trees are an ensemble learning method for classification and regression that construct a number of decision trees at training time and produce the output that the mode of the classes output by individual trees. The experiment is evaluated on the KDD '99 datasets. The results show that the random tree algorithm achieves detection rates and false positive rates better than the existing system. Keywords: intrusion detection; anomaly detection; misuse detection; random tree; network security; data mining; ensemble learning. (search for similar items in EconPapers) Downloads: (external link) Related works: Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text Persistent link: https://EconPapers.repec.org/RePEc:ids:ijenma:v:6:y:2015:i:4:p:275-285 Access Statistics for this article More articles in International Journal of Enterprise Network Management from Inderscience Enterprises Ltd |
Is your work missing from RePEc? Here is how to contribute.
Questions or problems? Check the EconPapers FAQ or send mail to .
EconPapers is hosted by the
School of Business at Örebro University.