Feature Selection For Intrusion Detection Systems

Lieferzeit: Lieferbar innerhalb 14 Tagen

54,90 

Using data mining techniques

ISBN: 3659515108
ISBN 13: 9783659515101
Autor: Kumar, Yogesh/Kumar, Krishan/Kumar, Gulshan
Verlag: LAP LAMBERT Academic Publishing
Umfang: 100 S.
Erscheinungsdatum: 31.01.2014
Auflage: 1/2014
Format: 0.6 x 22 x 15
Gewicht: 167 g
Produktform: Kartoniert
Einband: Kartoniert
Artikelnummer: 6166528 Kategorie:

Beschreibung

Network security is a serious global concern. The increasing prevalence of malware and incidents of attacks hinders the utilization of the Internet to its greatest benefit and incur significant economic losses. The traditional approaches in securing systems against threats are designing mechanisms that create a protective shield, almost always with vulnerabilities. This has created Intrusion Detection Systems to be developed that complement traditional approaches. However, with the advancement of computer technology, the behavior of intrusions has become complex that makes the work of security experts hard to analyze and detect intrusions. In order to address these challenges, data mining techniques have become a possible solution. However, the performance of data mining algorithms is affected when no optimized features are provided. This is because, complex relationships can be seen as well between the features and intrusion classes contributing to high computational costs in processing tasks, subsequently leads to delays in identifying intrusions. Feature selection is thus important in detecting intrusions by allowing the data mining system to focus on what is really important.

Autorenporträt

Yogesh Kumar has done M Tech (CSE) from PIT (PTU Main campus), Kapurthala, India. Currently, he is an Assistant Professor at BGIET, Sangrur, India. His general research Interests are in the areas of Information Security and Computer Networks.

Herstellerkennzeichnung:


BoD - Books on Demand
In de Tarpen 42
22848 Norderstedt
DE

E-Mail: info@bod.de

Das könnte Ihnen auch gefallen …