Sign inSubmit
computersciencejournal.org is not ours. This journal is published only at thescipub.com/jcs. Report a suspicious emailcomputersciencejournal.org is not ours · Report
ArticleArticle metrics
Research Article · Free to read · Published 18 June 2013

The use of Random Forest Classification and K-means Clustering Algorithm for Detecting Time Stamped Signatures in the Active Networks

Kamalanaban Ethala1, R. Shesadri1 & N. G. Renganathan2

Journal of Computer Science, Volume 9, Issue 7, pp. 875–882 · doi.org/10.3844/jcssp.2013.875.882

7,496 accesses8,815 downloads0 citations (Crossref)Journal metrics
Cite Check for updates

Abstract

In day to day information security infrastructure, intrusion detection is indispensible. Signature based intrusion detection system mechanisms are often available in detecting many types of attacks. But this mechanism alone is not sufficient in many cases. Another intrusion detection method viz K-means is employed for clustering and classifying the unlabelled data. IDS is a special embedded device or relied software package which process of monitoring the events occurring in a computer system or network (WLAN (Wi-Fi, Wimax)) and LAN ((Ethernet, FDDI, ADSL, Token ring) based) and analysing them for sign of possible incident which are violations or forthcoming threats of violations of computer security policies or standard security policies (i.e., DMA acts). We proposed a new methodology for detecting intrusions by means of clustering and classification algorithms. There we used correlation clustering and K-means clustering algorithm for clustering and random forest algorithm for classification. This type of extension establishes a layer which refines the escalated alerts using signature-based correlation. In this study, signature based intrusion detection system with optimised algorithm for better prediction of intrusions has been addressed. Results are presented and discussed.

Licence and reuse

Free to read. This article carries the publisher’s copyright, as printed on it: © 2013 Science Publications. It is free to read; ask us before reusing it.

How to reuse this article

Responses (0)

Have a comment on this research? Sign in to respond. Responses are moderated and published with your name and affiliation; the authors are invited to reply. How we use your dataWrite a response

About this article

Cite this article

Ethala, K., Shesadri, R. & Renganathan, N. G. (2013). The use of Random Forest Classification and K-means Clustering Algorithm for Detecting Time Stamped Signatures in the Active Networks. Journal of Computer Science, 9(7), 875–882. https://doi.org/10.3844/jcssp.2013.875.882

Licence
© Science Publications
Issue
Volume 9, Issue 7
Policies
Editorial independenceUse of generative AIData availabilityAppeals and complaints
Version
Version of record
The use of Random Forest Classification and K-means Clustering Algorithm for Detecting Time Stamped Signatures in the Active NetworksJournal of Computer Science · Volume 9, Issue 7 · pp. 875–882 · © Science PublicationsDownload