<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>KDDCUP’99 Network Traffic Data Set | Tuhin Sharma</title><link>https://tuhinsharma.netlify.app/tags/kddcup99-network-traffic-data-set/</link><atom:link href="https://tuhinsharma.netlify.app/tags/kddcup99-network-traffic-data-set/index.xml" rel="self" type="application/rss+xml"/><description>KDDCUP’99 Network Traffic Data Set</description><generator>Hugo Blox Builder (https://hugoblox.com)</generator><language>en-us</language><lastBuildDate>Thu, 20 Dec 2012 00:00:00 +0000</lastBuildDate><image><url>https://tuhinsharma.netlify.app/media/icon_hu55b84836e614877e119cbfa37f6d5a66_1386708_512x512_fill_lanczos_center_3.png</url><title>KDDCUP’99 Network Traffic Data Set</title><link>https://tuhinsharma.netlify.app/tags/kddcup99-network-traffic-data-set/</link></image><item><title>Dynamic Network Traffic Data Classification for Intrusion Detection Using Genetic Algorithm</title><link>https://tuhinsharma.netlify.app/publications/dynamic-network-traffic-data-classification-for-intrusion-detection-using-genetic-algorithm/</link><pubDate>Thu, 20 Dec 2012 00:00:00 +0000</pubDate><guid>https://tuhinsharma.netlify.app/publications/dynamic-network-traffic-data-classification-for-intrusion-detection-using-genetic-algorithm/</guid><description>&lt;h2> Abstract &lt;/h2>
&lt;p>Intrusion Detection System (IDS) classifies network traffic data either (anomaly( or (normal( to protect computer systems from different types of attacks. In this paper, data mining concepts and genetic algorithm have been applied to classify online traffic data efficiently by developing a rule based lazy classifier. The proposed method updates the rule set dynamically to accommodate the changing pattern in the traffic data in order to attain highest classification accuracy and at the same time maintaining consistency. The classifier is able to detect variants of common network traffic data patterns or modified existing security attacks based on the knowledge gained from its existing training data set with significant classification accuracy.&lt;/p></description></item><item><title>Generation of Sufficient Cut Points to Discretize Network Traffic Data Sets</title><link>https://tuhinsharma.netlify.app/publications/generation-of-sufficient-cut-points-to-discretize-network-traffic-data-sets/</link><pubDate>Thu, 20 Dec 2012 00:00:00 +0000</pubDate><guid>https://tuhinsharma.netlify.app/publications/generation-of-sufficient-cut-points-to-discretize-network-traffic-data-sets/</guid><description>&lt;h2> Abstract &lt;/h2>
&lt;p>Classification accuracy and efficiency of an intrusion detection system (IDS) are largely affected by the discretization methods applied on continuous attributes. Cut generation is one of the methods of discretization and by applying variable number of cuts (in a partition) to the continuous attributes, different classification accuracy are obtained. In the paper to maximize accuracy of classifying network traffic data either ‘normal’ or ‘anomaly’, the proposed algorithm determines the set of cut points for each of the continuous attributes. After generation of appropriate and necessary cut points, they are mapped into corresponding intervals following centre-spread encoding technique. The learnt cut points are applied on the test data set for discretization to achieve maximum classification accuracy.&lt;/p></description></item></channel></rss>