Analysis of Distance Measures Using K-Nearest Neighbor Algorithm on KDD Dataset

Punam Mulak, Nitin Talhar

Abstract: Classification is the process of analyzing the input data and building a model that describes data classes. K-Nearest Neighbor is a classification algorithm that is used to find class label of unknown tuples. Distance measure functions are very important for calculating distance between test and training tuples. Main aim of this paper is to analyze and compare Euclidian distance, Chebychev distance and Manhattan distance function using K-Nearest Neighbor. These distance measures are compared in terms of accuracy, specificity, sensitivity, false positive rate and false negative rate on KDD dataset. Manhattan distance gives high performance.

Keywords: K-nearest neighbor, lazy learner, eager learner, knowledge discovery and data mining, intrusion detection system

How to Cite?: Punam Mulak, Nitin Talhar, "Analysis of Distance Measures Using K-Nearest Neighbor Algorithm on KDD Dataset", Volume 4 Issue 7, July 2015, International Journal of Science and Research (IJSR), Pages: 2101-2104, https://www.ijsr.net/getabstract.php?paperid=SUB156942, DOI: https://dx.doi.org/10.21275/SUB156942