Network Intrusion Detection Using Fast k-nearest Neighbor Classifier
|
|
- Edgar Warren
- 6 years ago
- Views:
Transcription
1 Network Intrusion Detection Using Fast k-nearest Neighbor Classifier K. Swathi 1, D. Sree Lakshmi 2 1,2 Asst. Professor, Prasad V. Potluri Siddhartha Institute of Technology, Vijayawada Abstract: Fast k Nearest Neighborhood algorithm (FkNN) is used to find patterns of Network Intrusion Detection (IDS) and experimental task carried with KDD CUP99 dataset. FkNN algorithm is applied on texture image classification problems. The objective of this paper is to implement this algorithm along with traditional knn classification algorithm on KDDCUP 99 dataset. FkNN algorithm experimental results are provided and performance compared with knn algorithm. The method reduces the computational and time complexities over the k Nearest Neighbor Classifier (knn) algorithm. The result shows that FkNN is more accurate than other method. KEY WORDS: k Nearest Neighbor classifier, Intrusion Detection. 1. Introduction Data Mining is concerned with extracting useful insights from large and detailed collections of data. With the increasing possibilities in modern society for institutions and industries to acquire data cheaply and efficiently, has become of increasing importance. This interest has inspired a rapidly maturing research field with developments both on a theoretical, as well as on a practical level with the availability of a range of commercial tools. The growth of storage capacity in recent computers allows collection of more and more data. Thus the analysis of such amount of data without computational techniques is almost impossible. Methods described as Knowledge Discovery in Databases could be used for this purpose, especially, the main step of it called Data Mining. There are several strategies/techniques that could be used in clustering, classification, or pattern discovery. Among these strategies the author has chosen classification technique for Intrusion Detection System (IDS). IDS provide a large amount of intrusion data from various sources through internet, that can kept in storage media. The aspect of the problem that Intrusion Detection addresses is to alert users or networks that they are under attack or is the case with web application may not even involve any malware but is based on abusing a protocol. Today s IDS s are very far from the kind of level of performance that makes such comparisons relevant. Many security and privacy problems cannot be optimally solved due to their complexity. In these situations, heuristic approaches should be used and data mining has proven to be extremely useful and well-fitted to solve these problems. Data mining is a 85
2 vast field which goes from the rather "primitive" to the very sophisticated. More recently there has been interest in the more sophisticated approaches like knowledge base approach to data mining. As a result of that situation, most of the attempts to introduce data mining in intrusion detection consisted in trying to apply existing tools developed or used in data mining. They are used in many places both inside and outside security perimeters and in many different ways. Always quintessential is that the information collected through detection can be made into powerful intelligence if put to use to strengthen computer security in the areas of intrusion prevention, preemption, deterrence, deflection, and countermeasures. Understandably, a protected system or network is only as secure as its defenses are strong. In the intrusion detection systems that we focus on in this paper, we show how pattern matching is a critical ability, and that it must be the strength of the system. Security in networks is becoming more and more challenging as the network usage is increased drastically. Apart from encryption and defense mechanisms, Intrusion Detection System (IDS) is also playing a vital role in network security. As audit-data of security as well as complex and dynamic properties of intrusion behaviors are available in large volumes, the optimized performance of IDS receiving the attention from the research community. IDS monitor for critical security events and detect attacks and malicious users. Whenever a suspicious activity is identified by IDS it calls for investigation and through analysis is made into the details for the suspicious activity. IDS is generally used as a secondary line of defense, as it cannot be completely relied. Misuse detection and Anomaly detection are the main categories in IDS. Misuse detection aims to detect known attacks by characterizing the rules that govern these attacks. Anomaly detection attempts to find data patterns that are deviations in that they do not conform to expected behaviors. These deviations or non-conforming patterns are the anomalies. knn Classification Approach: A more sophisticated approach, k-nearest neighbor (knn) classification is to find a group of k Patterns in the training set that are closest to the test pattern, and bases the assignment of a label on the predominance of a particular class in this neighborhood. This addresses, in many data sets, it is unlikely that one pattern will exactly match another, as well as the fact that conflicting information about the class of a pattern may be provided by the patterns closest to it. There are many key elements of this model: (i) the set of labeled patterns to be used for evaluating a test pattern s class, (ii) a distance or similarity metric that can be used to compute the closeness of patterns (iii) the value of k, the number of nearest neighbors, and 86
3 (iv) the method used to determine the class of the target pattern based on the classes and distances of the k nearest neighbors. standard Euclidean distance d(x, y) between two instances x and y is defined as In its simplest form, knn can involve assigning a pattern of the class of its nearest neighbor or of the majority of its nearest neighbors. Generally, knn is a special case of instance-based learning and is also an example of a lazy learning technique, that is, a technique that waits until the query arrives to generalize beyond the training data. Although knn classification is a classification technique that is easy to understand and implement, it performs well in many situations. Also, because of its simplicity, knn is easy to modify for more complicated classification problems. For instance, knn is particularly well-suited for multimodal classes as well as applications in which an object can have many class labels. The complexity storage space using this algorithm is O(n), where n is the number of training patterns. The time complexity is also O(n), since the distance needs to be computed between the target and each training object. Thus, knn is different from most other classification techniques which have moderately to quite expensive model-building stages, but very inexpensive O(constant) classification steps. There are several techniques for classification such as Bayesian Classification, Decision Tree Induction, and Neural Networks. knn classifier has been widely used in classification problems[4]. knn classifier is based on a distance function that measures the difference or similarity between two instances. The where is the i th feature of the instance and is the total number of features in the data set. When all the attributes are of nominal, the distance can be measured as where if and if. DARPA dataset that contains only network data is termed as KDDCup 99 dataset. It contains seven weeks of training data and two weeks of test data. KDD dataset is widely used as a benchmark dataset for offline network traffic, which helps the researchers to test and implement their algorithms [7]. 10% of KDD Cup 99 dataset was chosen for training and test datasets. This KDD Cup 99 data set contains 41 features. As class labels are provided, this data set is widely used for classification algorithms. Each sample is labeled as either normal or attack. Denial of Service (DOS), Probe, U2R and R2L are the categories of attacks available. Even though, knn Classifier is one of the efficient data mining techniques that give best accuracy this method suffers from severe problem, especially when 87
4 we are using the large datasets like KDDCup 99. To find distance for all the available samples for a given request, store and sort those distances kills the performance. Our approach aims at implementing a knn Classifier and Fast knn Classifier algorithms to predict the attacks on KDD CUP 99 dataset. We also perform a comparative study for both of these classifiers in terms of performance. The remainder of the paper is organized as follows: Section 2 includes Related Work on IDS. Section 3 briefly introduces the knn and Fast knn classification algorithms. Section 3 elaborates the methodology and Section 4 describes the Results and the discussion on the results. Section 5 gives conclusion and remarks. storage becomes poor when large datasets are used [6]. Many researchers have focused on performance improvement of knn method and proposed alternatives such as Fast knn, and modified knnclassifiers[5]. Some of the researches on knn are WeightedkNN Classifier, Class based knn Classifier, Variable knn Classifier were concentrated on increase in the accuracy of the algorithm [4]. 3. Methodology As the KDD data set is of categorical, some of its features are in categorical and should be converted into numeric. In data preprocessing stage we have converted the KDD data set into numeric. 2. Related Work Intrusion detection can be thought of as a classification problem: we wish to classify each audit record into one of a discrete set of possible categories, normal or a particular kind of intrusion [9]. There are many variations of KNN Classifiers to reduce the time as well as increase the accuracy. As the KDD CUP99 is large data set, to identify the intrusion using knn classifier is time consuming. One of the variations of knn classifiers is known as Fast knn classifier that reduces the processing time as well as the storage space. The knn classifier mentioned above classifies a new data object by finding its k number of nearest neighbors with respect to a suitable distance function. Although the knn classifier method to solve the classification problem quite fast, its performance and Simple knn A k-nearest neighbor (knn) classifier does not build a classifier in advance. That is what makes it suitable for data streams. When a new sample arrives, knn finds the k neighbors nearest to the new sample from the training space based on some suitable similarity 88
5 or distance metric. The plurality class among the nearest neighbors is the class label of the new sample. Fast knn This approach of Fast knn classifier will work just as knn classifier but the difference is that it doesn t store all the distances that are calculated instead it just stores and sorts the first k distances. From k+1 th instance, each distance is compared with the k th distance and if the k th distance is greater, k th distance is replaced by the new distance and again sorted otherwise the new distance is discarded. In this approach only k distances are stored at any time which reduces the storage space and sorting will be done on only k elements. This algorithm is widely used especially for larger data sets. Step 2.1: Compare C yloc2+l withc max. If C YLoc2+l C max is satisfied, then Y Loc2+l to Y S can be deleted, go to step 3. Otherwise, go to step 2.2. Step 2.2: Perform the WKPDS algorithm. If d(x, Y Loc2+l ) <d min, update and reorder the k distances as [4]. Set d min = d k, C min =const.d min, C min =C x -const.d min. Go to step 3. Step 3: If Loc1 l < 1 or the vector Y Loc1-l to Y 1 have been deleted, go to step 4. Otherwise check Y Loc1-l. Step 3.1: Compare C yloc1 l with C min. If C yloc1-l C min is satisfied, then Y Loc1-l to Y 1 can be deleted, go to step 4. Otherwise, go to step 3.2. Step 3.2 : Perform the WKPDS algorithm. If d(x, Y Loc1-l ) <d min, update and reorder the k distances as step 2.2. Set d min = d k, C max = C x + const. d min, C min = C x const. d min. Go to step 4. Fast knn Classifier Algorithm To find k closest vectors, sort the vectors according to their approximate coefficients. Step 1: Set p=argmin C x -C yi. Initialize the k current closest distances as d i =d(x,y ji ), i=1,2,,k j i =S-k+i. Let Loc1=j i and Loc2=j k. Then, reorder the k distances such that d 1 d d k. Set l=1, Step 4: Set l = l+1. If Loc2 +l > S and Loc1 l < 1 or all vector have been deleted, terminate the algorithm. Otherwise go to step 2. Finally we get knumber ofnearest neighbors for sample y j, the class label for y j is y t is considered as the class c which has the highest count from the k nearest samples is denoted by the formula const=, d min = d k, C max = C x + cost.d min, C min = C x - cost.d min. Step 2: If Loc2 +l > S or the vector Y Loc2+l to Y S have been deleted, go to step 3. Otherwise check Y Loc2+l. 4. Results & Discussion 89
6 We have implemented the algorithm using Java. KDD CUP 99 data set is separated as training data and test data set and selected as shown below. Figure 1: Selecting the training and test data sets Figure 2: The original data of KDD cup 99 0,3,19,10,181,5450,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,8,8, 0,0,0,0,1,0,0,9,9,1,0,0.11,0,0,0,0,22 0,3,19,10,239,486,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,8,8,0,0,0,0,1,0,0,19,19,1,0,0.05,0,0,0,0,22 Figure 3: After data transformation After the transformation process, classification algorithm will be applied on the training dta set based on the test samples inorder to predict the class of each test set. By providing the k value and applying the algorithm of Fast knn Classification the actual class and predicted class labels for each data sample is shown in figure 4. After the selection of the data sets data preprocessing is performed, in which all the categorical data is converted into numeric, for example the class label normal is converted into 22 and service type tcp is converted into 3. The following is the example of 2 data samples figure 2 shows the original KDD data samples and figure 3 shows the transformation of the categorical values into nominal values. 0,tcp,http,SF,181,5450,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0, 8,8,0.00,0.00,0.00,0.00,1.00,0.00,0.00,9,9,1.00,0.00,0.11,0.00,0.00,0.00,0.00,0.00,normal. 0,tcp,http,SF,239,486,0,0,0,0,0,1,0,0,0,0,0,0,0,0,0,0,8,8,0.00,0.00,0.00,0.00,1.00,0.00,0.00,19,19,1.00,0.00, 0.05,0.00,0.00,0.00,0.00,0.00,normal. Figure 4: Results after providing the k Value We have provided the algorithm with four different sizes of training data sets. For test data set 35 normal and various types of attacks instances and 20 as the k value. The experiment yields accuracy of 90
7 No. of iterations Dept of Computer Science, P B SIDDHARTHA COLLEGE OF ARTS & SCIENCE, VIJAYAWADA. 91.4%. The total number of iterations taken by both KNN Classifier and Fast KNN classifier for four different sizes of training data sets are tabulated as shown in table 1. Table 1: Comparison of two algorithms in terms of number of iterations Probe U2r r2l dos Figure 6: Accuracy Fast knn knn S.No No. of Instances knn Classifier Fast knn Classifier The results are shown that the fast knn classifier has taken very less number of iterations when compared to the knn classifier algorithm knn Classifier No. of Instances Fast knn Classifier Fast knn knn Probe U2r r2l dos Figure 5: Kappa Statistics Figure 7: Graph showing the comparison of two algorithms 5. Conclusion and Future Work In this paper we proposed Fast knn Classifier algorithm for intrusion detection on large, mixed data set. Analysis of result gives a better prediction of result for different data set in KDD, but also suffered problem in Alarm generation. The processing speed of this algorithm is shown in terms of the number of 91
8 iterations, and is compared with general knn Classifier. Two algorithms complexity is also shown. Rough Set Theory and the Support Vector Machine is used as a tool to enhance the accuracy of the present intrusion detection algorithms [10]. As a Future work we are planning to use Rough-set Theory for detecting intrusions. References: [1] Stephen Northcutt, Judy Novak Network Intrusion Deteciton, Third Edition, New Riders Publishing. [2] Jiawei Han and MichelineKamber data mining Concepts and techniques Morgan Kaufmann Publishers, an imprint of Elseiver, ISBN [3] RamasamyMariappan, An intelligent approach for intrusion detection system using KNN classifier , ISDA 2004 IEEE 4 th International Conference on Intelligent Systems Design and Application August 26-28, [4] Zacharias Volulgaris and George d. Magoulas, Extensions of the k Nearest Neighbor Methods for Classification Problems, AIA '08 Proceedings of the 26th IASTED International Conference on Artificial Intelligence and Applications, Algorithm, IEICE Trans, Fundamentals, Vol. E87-A,No4, April [6] Abidin, T. and Perrizo, W. SMART-TV: A Fast and Scalable Nearest Neighbor Based Classifier for Data Mining, Proceedings of ACM SAC-06, Dijon, France, ACM Press, New York, NY, pp April 23-27, [7] R. Shanmugavadivu, Dr. N. Nagarajan Network Intrusion Detection System Using Fuzzy Logic, Indian Journal of Computer Science and Engineering (IJCSE), [8] Dr. S.SivaSathya, Dr. R. GeethaRamani and K. Sivaselvi, Discriminant Analysis based Feature Selection in KDD intrusion Dataset, International Journal of Computer Applications, Vol 31, No.11, October [9] Wenke Lee, Salvatore J. Stolfo and Kui W. Mok, A Data Mining Framework for Building Intrusion Detection Models, Proceedings of the 1999 IEEE Symposium pp May on [10] Shailendra Kumar Shrivastava and Preeti Jain, Effective Anomaly based Intrusion Detection using Rough Set Theory and Support Vector Machine, International Journal of Computer Applications ( ), Volume 18 No.3, March [11] up99.html [5] Jeng-Shyang, Yu-Long, and Sheng-He SUN A Fast K Nearest Neighbors Classification 92
9 93
Review on Data Mining Techniques for Intrusion Detection System
Review on Data Mining Techniques for Intrusion Detection System Sandeep D 1, M. S. Chaudhari 2 Research Scholar, Dept. of Computer Science, P.B.C.E, Nagpur, India 1 HoD, Dept. of Computer Science, P.B.C.E,
More informationK-Nearest-Neighbours with a Novel Similarity Measure for Intrusion Detection
K-Nearest-Neighbours with a Novel Similarity Measure for Intrusion Detection Zhenghui Ma School of Computer Science The University of Birmingham Edgbaston, B15 2TT Birmingham, UK Ata Kaban School of Computer
More informationHybrid Feature Selection for Modeling Intrusion Detection Systems
Hybrid Feature Selection for Modeling Intrusion Detection Systems Srilatha Chebrolu, Ajith Abraham and Johnson P Thomas Department of Computer Science, Oklahoma State University, USA ajith.abraham@ieee.org,
More informationA Detailed Analysis on NSL-KDD Dataset Using Various Machine Learning Techniques for Intrusion Detection
A Detailed Analysis on NSL-KDD Dataset Using Various Machine Learning Techniques for Intrusion Detection S. Revathi Ph.D. Research Scholar PG and Research, Department of Computer Science Government Arts
More informationTopic 1 Classification Alternatives
Topic 1 Classification Alternatives [Jiawei Han, Micheline Kamber, Jian Pei. 2011. Data Mining Concepts and Techniques. 3 rd Ed. Morgan Kaufmann. ISBN: 9380931913.] 1 Contents 2. Classification Using Frequent
More informationEnhancing Forecasting Performance of Naïve-Bayes Classifiers with Discretization Techniques
24 Enhancing Forecasting Performance of Naïve-Bayes Classifiers with Discretization Techniques Enhancing Forecasting Performance of Naïve-Bayes Classifiers with Discretization Techniques Ruxandra PETRE
More informationOptimized Intrusion Detection by CACC Discretization Via Naïve Bayes and K-Means Clustering
54 Optimized Intrusion Detection by CACC Discretization Via Naïve Bayes and K-Means Clustering Vineet Richhariya, Nupur Sharma 1 Lakshmi Narain College of Technology, Bhopal, India Abstract Network Intrusion
More informationAn Ensemble Data Mining Approach for Intrusion Detection in a Computer Network
International Journal of Science and Engineering Investigations vol. 6, issue 62, March 2017 ISSN: 2251-8843 An Ensemble Data Mining Approach for Intrusion Detection in a Computer Network Abisola Ayomide
More informationOutlier Detection Using Unsupervised and Semi-Supervised Technique on High Dimensional Data
Outlier Detection Using Unsupervised and Semi-Supervised Technique on High Dimensional Data Ms. Gayatri Attarde 1, Prof. Aarti Deshpande 2 M. E Student, Department of Computer Engineering, GHRCCEM, University
More informationA Network Intrusion Detection System Architecture Based on Snort and. Computational Intelligence
2nd International Conference on Electronics, Network and Computer Engineering (ICENCE 206) A Network Intrusion Detection System Architecture Based on Snort and Computational Intelligence Tao Liu, a, Da
More informationInternational Journal of Scientific Research & Engineering Trends Volume 4, Issue 6, Nov-Dec-2018, ISSN (Online): X
Analysis about Classification Techniques on Categorical Data in Data Mining Assistant Professor P. Meena Department of Computer Science Adhiyaman Arts and Science College for Women Uthangarai, Krishnagiri,
More informationFlow-based Anomaly Intrusion Detection System Using Neural Network
Flow-based Anomaly Intrusion Detection System Using Neural Network tational power to analyze only the basic characteristics of network flow, so as to Intrusion Detection systems (KBIDES) classify the data
More informationInternational Journal of Scientific & Engineering Research, Volume 4, Issue 7, July-2013 ISSN
1 Review: Boosting Classifiers For Intrusion Detection Richa Rawat, Anurag Jain ABSTRACT Network and host intrusion detection systems monitor malicious activities and the management station is a technique
More informationMine Blood Donors Information through Improved K- Means Clustering Bondu Venkateswarlu 1 and Prof G.S.V.Prasad Raju 2
Mine Blood Donors Information through Improved K- Means Clustering Bondu Venkateswarlu 1 and Prof G.S.V.Prasad Raju 2 1 Department of Computer Science and Systems Engineering, Andhra University, Visakhapatnam-
More informationINTRUSION DETECTION SYSTEM USING BIG DATA FRAMEWORK
INTRUSION DETECTION SYSTEM USING BIG DATA FRAMEWORK Abinesh Kamal K. U. and Shiju Sathyadevan Amrita Center for Cyber Security Systems and Networks, Amrita School of Engineering, Amritapuri, Amrita Vishwa
More informationDynamic Clustering of Data with Modified K-Means Algorithm
2012 International Conference on Information and Computer Networks (ICICN 2012) IPCSIT vol. 27 (2012) (2012) IACSIT Press, Singapore Dynamic Clustering of Data with Modified K-Means Algorithm Ahamed Shafeeq
More informationApproach Using Genetic Algorithm for Intrusion Detection System
Approach Using Genetic Algorithm for Intrusion Detection System 544 Abhijeet Karve Government College of Engineering, Aurangabad, Dr. Babasaheb Ambedkar Marathwada University, Aurangabad, Maharashtra-
More informationData Mining Based Online Intrusion Detection
International Journal of Engineering Research and Development e-issn: 2278-067X, p-issn: 2278-800X, www.ijerd.com Volume 3, Issue 12 (September 2012), PP. 59-63 Data Mining Based Online Intrusion Detection
More informationEfficiency of k-means and K-Medoids Algorithms for Clustering Arbitrary Data Points
Efficiency of k-means and K-Medoids Algorithms for Clustering Arbitrary Data Points Dr. T. VELMURUGAN Associate professor, PG and Research Department of Computer Science, D.G.Vaishnav College, Chennai-600106,
More informationIntrusion Detection System Using K-SVMeans Clustering Algorithm
Intrusion Detection System Using K-eans Clustering Algorithm 1 Jaisankar N, 2 Swetha Balaji, 3 Lalita S, 4 Sruthi D, Department of Computer Science and Engineering, Misrimal Navajee Munoth Jain Engineering
More informationDesign of Trust Model For Efficient Cyber Attack Detection on Fuzzified Large Data using Data Mining techniques
Design of Trust Model For Efficient Cyber Attack Detection on Fuzzified Large Data using Data Mining techniques Vineet Richhariya, Dr. J.L.Rana,Dr. R.C.Jain,Dr. R.K.Pandey Asst. Professor Director, Director,
More informationKeywords Intrusion Detection System, Artificial Neural Network, Multi-Layer Perceptron. Apriori algorithm
Volume 3, Issue 6, June 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Detecting and Classifying
More informationART 알고리즘특강자료 ( 응용 01)
An Adaptive Intrusion Detection Algorithm Based on Clustering and Kernel-Method ART 알고리즘특강자료 ( 응용 01) DB 및데이터마이닝연구실 http://idb.korea.ac.kr 2009 년 05 월 01 일 1 Introduction v Background of Research v In
More informationDisquisition of a Novel Approach to Enhance Security in Data Mining
Disquisition of a Novel Approach to Enhance Security in Data Mining Gurpreet Kaundal 1, Sheveta Vashisht 2 1 Student Lovely Professional University, Phagwara, Pin no. 144402 gurpreetkaundal03@gmail.com
More informationFeature selection using closeness to centers for network intrusion detection
Feature selection using closeness to centers for network intrusion detection 1 S. Sethuramalingam, 2 Dr. E.R. Naganathan 1 Department of Computer Science, Aditanar College, Tiruchur, India 2 Department
More information9. Conclusions. 9.1 Definition KDD
9. Conclusions Contents of this Chapter 9.1 Course review 9.2 State-of-the-art in KDD 9.3 KDD challenges SFU, CMPT 740, 03-3, Martin Ester 419 9.1 Definition KDD [Fayyad, Piatetsky-Shapiro & Smyth 96]
More informationModeling Intrusion Detection Systems With Machine Learning And Selected Attributes
Modeling Intrusion Detection Systems With Machine Learning And Selected Attributes Thaksen J. Parvat USET G.G.S.Indratrastha University Dwarka, New Delhi 78 pthaksen.sit@sinhgad.edu Abstract Intrusion
More informationBayesian Learning Networks Approach to Cybercrime Detection
Bayesian Learning Networks Approach to Cybercrime Detection N S ABOUZAKHAR, A GANI and G MANSON The Centre for Mobile Communications Research (C4MCR), University of Sheffield, Sheffield Regent Court, 211
More informationDeep Learning Approach to Network Intrusion Detection
Deep Learning Approach to Network Intrusion Detection Paper By : Nathan Shone, Tran Nguyen Ngoc, Vu Dinh Phai, Qi Shi Presented by : Romi Bajracharya Overview Introduction Limitation with NIDS Proposed
More informationAbnormal Network Traffic Detection Based on Semi-Supervised Machine Learning
2017 International Conference on Electronic, Control, Automation and Mechanical Engineering (ECAME 2017) ISBN: 978-1-60595-523-0 Abnormal Network Traffic Detection Based on Semi-Supervised Machine Learning
More informationA study of classification algorithms using Rapidminer
Volume 119 No. 12 2018, 15977-15988 ISSN: 1314-3395 (on-line version) url: http://www.ijpam.eu ijpam.eu A study of classification algorithms using Rapidminer Dr.J.Arunadevi 1, S.Ramya 2, M.Ramesh Raja
More informationClustering of Data with Mixed Attributes based on Unified Similarity Metric
Clustering of Data with Mixed Attributes based on Unified Similarity Metric M.Soundaryadevi 1, Dr.L.S.Jayashree 2 Dept of CSE, RVS College of Engineering and Technology, Coimbatore, Tamilnadu, India 1
More informationDomain Independent Prediction with Evolutionary Nearest Neighbors.
Research Summary Domain Independent Prediction with Evolutionary Nearest Neighbors. Introduction In January of 1848, on the American River at Coloma near Sacramento a few tiny gold nuggets were discovered.
More informationA Data Mining Approach for Intrusion Detection System Using Boosted Decision Tree Approach
A Data Mining Approach for Intrusion Detection System Using Boosted Decision Tree Approach 1 Priyanka B Bera, 2 Ishan K Rajani, 1 P.G. Student, 2 Professor, 1 Department of Computer Engineering, 1 D.I.E.T,
More informationIntrusion Detection Based On Clustering Algorithm
International Journal of Electronics and Computer Science Engineering 1059 Available Online at www.ijecse.org ISSN- 2277-1956 Intrusion Detection Based On Clustering Algorithm Nadya El MOUSSAID 1, Ahmed
More informationEnhanced Multivariate Correlation Analysis (MCA) Based Denialof-Service
International Journal of Computer Science & Mechatronics A peer reviewed International Journal Article Available online www.ijcsm.in smsamspublications.com Vol.1.Issue 2. 2015 Enhanced Multivariate Correlation
More informationDetermining the Number of Hidden Neurons in a Multi Layer Feed Forward Neural Network
Determining the Number of Hidden Neurons in a Multi Layer Feed Forward Neural Network Lynn Ray University of Maryland University College 3501 University Blvd East Adelphi, MD 20783. USA ABSTRACT: A neural
More informationPreprocessing of Stream Data using Attribute Selection based on Survival of the Fittest
Preprocessing of Stream Data using Attribute Selection based on Survival of the Fittest Bhakti V. Gavali 1, Prof. Vivekanand Reddy 2 1 Department of Computer Science and Engineering, Visvesvaraya Technological
More informationDistance-based Outlier Detection: Consolidation and Renewed Bearing
Distance-based Outlier Detection: Consolidation and Renewed Bearing Gustavo. H. Orair, Carlos H. C. Teixeira, Wagner Meira Jr., Ye Wang, Srinivasan Parthasarathy September 15, 2010 Table of contents Introduction
More informationMore Efficient Classification of Web Content Using Graph Sampling
More Efficient Classification of Web Content Using Graph Sampling Chris Bennett Department of Computer Science University of Georgia Athens, Georgia, USA 30602 bennett@cs.uga.edu Abstract In mining information
More informationFeature Selection Technique to Improve Performance Prediction in a Wafer Fabrication Process
Feature Selection Technique to Improve Performance Prediction in a Wafer Fabrication Process KITTISAK KERDPRASOP and NITTAYA KERDPRASOP Data Engineering Research Unit, School of Computer Engineering, Suranaree
More informationINTRUSION DETECTION MODEL IN DATA MINING BASED ON ENSEMBLE APPROACH
INTRUSION DETECTION MODEL IN DATA MINING BASED ON ENSEMBLE APPROACH VIKAS SANNADY 1, POONAM GUPTA 2 1Asst.Professor, Department of Computer Science, GTBCPTE, Bilaspur, chhattisgarh, India 2Asst.Professor,
More informationIntrusion Detection Using Data Mining Technique (Classification)
Intrusion Detection Using Data Mining Technique (Classification) Dr.D.Aruna Kumari Phd 1 N.Tejeswani 2 G.Sravani 3 R.Phani Krishna 4 1 Associative professor, K L University,Guntur(dt), 2 B.Tech(1V/1V),ECM,
More informationPerformance Analysis of Data Mining Classification Techniques
Performance Analysis of Data Mining Classification Techniques Tejas Mehta 1, Dr. Dhaval Kathiriya 2 Ph.D. Student, School of Computer Science, Dr. Babasaheb Ambedkar Open University, Gujarat, India 1 Principal
More informationIntrusion Detection System based on Support Vector Machine and BN-KDD Data Set
Intrusion Detection System based on Support Vector Machine and BN-KDD Data Set Razieh Baradaran, Department of information technology, university of Qom, Qom, Iran R.baradaran@stu.qom.ac.ir Mahdieh HajiMohammadHosseini,
More informationInternational Journal of Computer Engineering and Applications, Volume VIII, Issue III, Part I, December 14
International Journal of Computer Engineering and Applications, Volume VIII, Issue III, Part I, December 14 DESIGN OF AN EFFICIENT DATA ANALYSIS CLUSTERING ALGORITHM Dr. Dilbag Singh 1, Ms. Priyanka 2
More informationIteration Reduction K Means Clustering Algorithm
Iteration Reduction K Means Clustering Algorithm Kedar Sawant 1 and Snehal Bhogan 2 1 Department of Computer Engineering, Agnel Institute of Technology and Design, Assagao, Goa 403507, India 2 Department
More informationSathyamangalam, 2 ( PG Scholar,Department of Computer Science and Engineering,Bannari Amman Institute of Technology, Sathyamangalam,
IOSR Journal of Computer Engineering (IOSR-JCE) e-issn: 2278-0661, p- ISSN: 2278-8727Volume 8, Issue 5 (Jan. - Feb. 2013), PP 70-74 Performance Analysis Of Web Page Prediction With Markov Model, Association
More informationClassification Of Attacks In Network Intrusion Detection System
International Journal of Scientific & Engineering Research Volume 4, Issue 2, February-2013 1 Classification Of Attacks In Network Intrusion Detection System 1 Shwetambari Ramesh Patil, 2 Dr.Pradeep Deshmukh,
More informationSemi-Supervised Clustering with Partial Background Information
Semi-Supervised Clustering with Partial Background Information Jing Gao Pang-Ning Tan Haibin Cheng Abstract Incorporating background knowledge into unsupervised clustering algorithms has been the subject
More informationData Mining. Lecture 03: Nearest Neighbor Learning
Data Mining Lecture 03: Nearest Neighbor Learning Theses slides are based on the slides by Tan, Steinbach and Kumar (textbook authors) Prof. R. Mooney (UT Austin) Prof E. Keogh (UCR), Prof. F. Provost
More informationK Nearest Neighbor Wrap Up K- Means Clustering. Slides adapted from Prof. Carpuat
K Nearest Neighbor Wrap Up K- Means Clustering Slides adapted from Prof. Carpuat K Nearest Neighbor classification Classification is based on Test instance with Training Data K: number of neighbors that
More informationLecture Notes on Critique of 1998 and 1999 DARPA IDS Evaluations
Lecture Notes on Critique of 1998 and 1999 DARPA IDS Evaluations Prateek Saxena March 3 2008 1 The Problems Today s lecture is on the discussion of the critique on 1998 and 1999 DARPA IDS evaluations conducted
More informationNaïve Bayes for text classification
Road Map Basic concepts Decision tree induction Evaluation of classifiers Rule induction Classification using association rules Naïve Bayesian classification Naïve Bayes for text classification Support
More informationClassifying Twitter Data in Multiple Classes Based On Sentiment Class Labels
Classifying Twitter Data in Multiple Classes Based On Sentiment Class Labels Richa Jain 1, Namrata Sharma 2 1M.Tech Scholar, Department of CSE, Sushila Devi Bansal College of Engineering, Indore (M.P.),
More informationKeywords Hadoop, Map Reduce, K-Means, Data Analysis, Storage, Clusters.
Volume 6, Issue 3, March 2016 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Special Issue
More informationPerformance Analysis of various classifiers using Benchmark Datasets in Weka tools
Performance Analysis of various classifiers using Benchmark Datasets in Weka tools Abstract Intrusion occurs in the network due to redundant and irrelevant data that cause problem in network traffic classification.
More informationCISC 4631 Data Mining
CISC 4631 Data Mining Lecture 03: Nearest Neighbor Learning Theses slides are based on the slides by Tan, Steinbach and Kumar (textbook authors) Prof. R. Mooney (UT Austin) Prof E. Keogh (UCR), Prof. F.
More informationDomestic electricity consumption analysis using data mining techniques
Domestic electricity consumption analysis using data mining techniques Prof.S.S.Darbastwar Assistant professor, Department of computer science and engineering, Dkte society s textile and engineering institute,
More informationStatistical based Approach for Packet Classification
Statistical based Approach for Packet Classification Dr. Mrudul Dixit 1, Ankita Sanjay Moholkar 2, Sagarika Satish Limaye 2, Devashree Chandrashekhar Limaye 2 Cummins College of engineering for women,
More informationAnalysis of Feature Selection Techniques: A Data Mining Approach
Analysis of Feature Selection Techniques: A Data Mining Approach Sheena M.Tech Scholar CSE, SBSSTC Krishan Kumar Associate Professor CSE, SBSSTC Gulshan Kumar Assistant Professor MCA, SBSSTC ABSTRACT Feature
More informationIntrusion Detection System with FGA and MLP Algorithm
Intrusion Detection System with FGA and MLP Algorithm International Journal of Engineering Research & Technology (IJERT) Miss. Madhuri R. Yadav Department Of Computer Engineering Siddhant College Of Engineering,
More informationDatasets Size: Effect on Clustering Results
1 Datasets Size: Effect on Clustering Results Adeleke Ajiboye 1, Ruzaini Abdullah Arshah 2, Hongwu Qin 3 Faculty of Computer Systems and Software Engineering Universiti Malaysia Pahang 1 {ajibraheem@live.com}
More informationANALYSIS AND EVALUATION OF DISTRIBUTED DENIAL OF SERVICE ATTACKS IDENTIFICATION METHODS
ANALYSIS AND EVALUATION OF DISTRIBUTED DENIAL OF SERVICE ATTACKS IDENTIFICATION METHODS Saulius Grusnys, Ingrida Lagzdinyte Kaunas University of Technology, Department of Computer Networks, Studentu 50,
More informationADVANCES in NATURAL and APPLIED SCIENCES
ADVANCES in NATURAL and APPLIED SCIENCES ISSN: 1995-0772 Published BYAENSI Publication EISSN: 1998-1090 http://www.aensiweb.com/anas 2017 February 11(2): pages 14-18 Open Access Journal A Novel Framework
More informationCOMPARISON OF DIFFERENT CLASSIFICATION TECHNIQUES
COMPARISON OF DIFFERENT CLASSIFICATION TECHNIQUES USING DIFFERENT DATASETS V. Vaithiyanathan 1, K. Rajeswari 2, Kapil Tajane 3, Rahul Pitale 3 1 Associate Dean Research, CTS Chair Professor, SASTRA University,
More informationData Mining and Data Warehousing Classification-Lazy Learners
Motivation Data Mining and Data Warehousing Classification-Lazy Learners Lazy Learners are the most intuitive type of learners and are used in many practical scenarios. The reason of their popularity is
More informationText Document Clustering Using DPM with Concept and Feature Analysis
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology IJCSMC, Vol. 2, Issue. 10, October 2013,
More informationKeywords: Intrusion Detection System, k-nearest neighbor, Support Vector Machine, Primal Dual, Particle Swarm Optimization
University of Maiduguri Faculty of Engineering Seminar Series Volume 8, march 2017 A Hybridized SVM-kNN-pdAPSO Approach to Intrusion Detection System E.G. Dada Department of Computer Engineering, Faculty
More informationDetecting Botnets Using Cisco NetFlow Protocol
Detecting Botnets Using Cisco NetFlow Protocol Royce Clarenz C. Ocampo 1, *, and Gregory G. Cu 2 1 Computer Technology Department, College of Computer Studies, De La Salle University, Manila 2 Software
More informationInternational Journal of Advance Engineering and Research Development. A Survey on Data Mining Methods and its Applications
Scientific Journal of Impact Factor (SJIF): 4.72 International Journal of Advance Engineering and Research Development Volume 5, Issue 01, January -2018 e-issn (O): 2348-4470 p-issn (P): 2348-6406 A Survey
More informationA NEW HYBRID APPROACH FOR NETWORK TRAFFIC CLASSIFICATION USING SVM AND NAÏVE BAYES ALGORITHM
Available Online at www.ijcsmc.com International Journal of Computer Science and Mobile Computing A Monthly Journal of Computer Science and Information Technology ISSN 2320 088X IMPACT FACTOR: 6.017 IJCSMC,
More informationAn Empirical Study of Hoeffding Racing for Model Selection in k-nearest Neighbor Classification
An Empirical Study of Hoeffding Racing for Model Selection in k-nearest Neighbor Classification Flora Yu-Hui Yeh and Marcus Gallagher School of Information Technology and Electrical Engineering University
More informationSelecting Features for Intrusion Detection: A Feature Relevance Analysis on KDD 99 Intrusion Detection Datasets
Selecting Features for Intrusion Detection: A Feature Relevance Analysis on KDD 99 Intrusion Detection Datasets H. Günes Kayacık, A. Nur Zincir-Heywood, Malcolm I. Heywood Dalhousie University, Faculty
More informationAnomaly Intrusion Detection System Using Hierarchical Gaussian Mixture Model
264 IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.8, August 2008 Anomaly Intrusion Detection System Using Hierarchical Gaussian Mixture Model M. Bahrololum and M. Khaleghi
More informationPerformance of data mining algorithms in unauthorized intrusion detection systems in computer networks
RESEARCH ARTICLE Performance of data mining algorithms in unauthorized intrusion detection systems in computer networks Hadi Ghadimkhani, Ali Habiboghli*, Rouhollah Mostafaei Department of Computer Science
More informationCS570: Introduction to Data Mining
CS570: Introduction to Data Mining Classification Advanced Reading: Chapter 8 & 9 Han, Chapters 4 & 5 Tan Anca Doloc-Mihu, Ph.D. Slides courtesy of Li Xiong, Ph.D., 2011 Han, Kamber & Pei. Data Mining.
More informationA study on fuzzy intrusion detection
A study on fuzzy intrusion detection J.T. Yao S.L. Zhao L. V. Saxton Department of Computer Science University of Regina Regina, Saskatchewan, Canada S4S 0A2 E-mail: [jtyao,zhao200s,saxton]@cs.uregina.ca
More informationInternational Journal of Modern Engineering and Research Technology
Volume 2, Issue 4, October 2015 ISSN: 2348-8565 (Online) International Journal of Modern Engineering and Research Technology Website: http://www.ijmert.org Privacy Preservation in Data Mining Using Mixed
More informationA Neuro-Fuzzy Classifier for Intrusion Detection Systems
. 11 th International CSI Computer Conference (CSICC 2006), School of Computer Science, IPM, Jan. 24-26, 2006, Tehran, Iran. A Neuro-Fuzzy Classifier for Intrusion Detection Systems Adel Nadjaran Toosi
More informationIntrusion Detection and Malware Analysis
Intrusion Detection and Malware Analysis Anomaly-based IDS Pavel Laskov Wilhelm Schickard Institute for Computer Science Taxonomy of anomaly-based IDS Features: Packet headers Byte streams Syntactic events
More informationAn Intelligent Clustering Algorithm for High Dimensional and Highly Overlapped Photo-Thermal Infrared Imaging Data
An Intelligent Clustering Algorithm for High Dimensional and Highly Overlapped Photo-Thermal Infrared Imaging Data Nian Zhang and Lara Thompson Department of Electrical and Computer Engineering, University
More informationIndex Terms Data Mining, Classification, Rapid Miner. Fig.1. RapidMiner User Interface
A Comparative Study of Classification Methods in Data Mining using RapidMiner Studio Vishnu Kumar Goyal Dept. of Computer Engineering Govt. R.C. Khaitan Polytechnic College, Jaipur, India vishnugoyal_jaipur@yahoo.co.in
More informationData Mining Classification: Alternative Techniques. Lecture Notes for Chapter 4. Instance-Based Learning. Introduction to Data Mining, 2 nd Edition
Data Mining Classification: Alternative Techniques Lecture Notes for Chapter 4 Instance-Based Learning Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar Instance Based Classifiers
More informationCHAPTER 4 STOCK PRICE PREDICTION USING MODIFIED K-NEAREST NEIGHBOR (MKNN) ALGORITHM
CHAPTER 4 STOCK PRICE PREDICTION USING MODIFIED K-NEAREST NEIGHBOR (MKNN) ALGORITHM 4.1 Introduction Nowadays money investment in stock market gains major attention because of its dynamic nature. So the
More informationDeep Tensor: Eliciting New Insights from Graph Data that Express Relationships between People and Things
Deep Tensor: Eliciting New Insights from Graph Data that Express Relationships between People and Things Koji Maruhashi An important problem in information and communications technology (ICT) is classifying
More informationAn Effective Performance of Feature Selection with Classification of Data Mining Using SVM Algorithm
Proceedings of the National Conference on Recent Trends in Mathematical Computing NCRTMC 13 427 An Effective Performance of Feature Selection with Classification of Data Mining Using SVM Algorithm A.Veeraswamy
More informationA Comparison Between the Silhouette Index and the Davies-Bouldin Index in Labelling IDS Clusters
A Comparison Between the Silhouette Index and the Davies-Bouldin Index in Labelling IDS Clusters Slobodan Petrović NISlab, Department of Computer Science and Media Technology, Gjøvik University College,
More informationEVALUATIONS OF THE EFFECTIVENESS OF ANOMALY BASED INTRUSION DETECTION SYSTEMS BASED ON AN ADAPTIVE KNN ALGORITHM
EVALUATIONS OF THE EFFECTIVENESS OF ANOMALY BASED INTRUSION DETECTION SYSTEMS BASED ON AN ADAPTIVE KNN ALGORITHM Assosiate professor, PhD Evgeniya Nikolova, BFU Assosiate professor, PhD Veselina Jecheva,
More informationRouting Scheme in Energy efficient based Protocols for Wireless Sensor Networks
Routing Scheme in Energy efficient based Protocols for Wireless Sensor Networks 1 Chiranjeevi Rampilla, 2 Pallikonda Anil Kumar, 1 Student, DEPT.OF CSE, PVPSIT, KANURU, VIJAYAWADA. 2 Asst.Professor, DEPT.OF
More informationDynamic Optimization of Generalized SQL Queries with Horizontal Aggregations Using K-Means Clustering
Dynamic Optimization of Generalized SQL Queries with Horizontal Aggregations Using K-Means Clustering Abstract Mrs. C. Poongodi 1, Ms. R. Kalaivani 2 1 PG Student, 2 Assistant Professor, Department of
More informationStudy of Machine Learning Based Intrusion Detection System
ISSN 2395-1621 Study of Machine Learning Based Intrusion Detection System #1 Prashant Wakhare, #2 Dr S.T.Singh 1 Prashant_mitr@rediffmail.com 2 stsingh47@gmail.com Computer Engineering, Savitribai Phule
More informationFeature Selection in the Corrected KDD -dataset
Feature Selection in the Corrected KDD -dataset ZARGARI, Shahrzad Available from Sheffield Hallam University Research Archive (SHURA) at: http://shura.shu.ac.uk/17048/ This document is the author deposited
More informationComparison of variable learning rate and Levenberg-Marquardt back-propagation training algorithms for detecting attacks in Intrusion Detection Systems
Comparison of variable learning rate and Levenberg-Marquardt back-propagation training algorithms for detecting attacks in Intrusion Detection Systems Tummala Pradeep 1 IV th Year Student, Department of
More informationInternational Journal of Advanced Research in Computer Science and Software Engineering
Volume 3, Issue 4, April 2013 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com Discovering Knowledge
More informationCluster Based detection of Attack IDS using Data Mining
Cluster Based detection of Attack IDS using Data Mining 1 Manisha Kansra, 2 Pankaj Dev Chadha 1 Research scholar, 2 Assistant Professor, 1 Department of Computer Science Engineering 1 Geeta Institute of
More informationData Mining. Part 2. Data Understanding and Preparation. 2.4 Data Transformation. Spring Instructor: Dr. Masoud Yaghini. Data Transformation
Data Mining Part 2. Data Understanding and Preparation 2.4 Spring 2010 Instructor: Dr. Masoud Yaghini Outline Introduction Normalization Attribute Construction Aggregation Attribute Subset Selection Discretization
More informationCURRENT RESEARCH ON EXPLORATORY LANDSCAPE ANALYSIS
CURRENT RESEARCH ON EXPLORATORY LANDSCAPE ANALYSIS HEIKE TRAUTMANN. MIKE PREUSS. 1 EXPLORATORY LANDSCAPE ANALYSIS effective and sophisticated approach to characterize properties of optimization problems
More informationAn advanced data leakage detection system analyzing relations between data leak activity
An advanced data leakage detection system analyzing relations between data leak activity Min-Ji Seo 1 Ph. D. Student, Software Convergence Department, Soongsil University, Seoul, 156-743, Korea. 1 Orcid
More informationData Mining. 3.5 Lazy Learners (Instance-Based Learners) Fall Instructor: Dr. Masoud Yaghini. Lazy Learners
Data Mining 3.5 (Instance-Based Learners) Fall 2008 Instructor: Dr. Masoud Yaghini Outline Introduction k-nearest-neighbor Classifiers References Introduction Introduction Lazy vs. eager learning Eager
More information