Open Access Journal

ISSN : 2394-2320 (Online)

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

Open Access Journal

International Journal of Engineering Research in Computer Science and Engineering (IJERCSE)

Monthly Journal for Computer Science and Engineering

ISSN : 2394-2320 (Online)

Comparision of K-Means and Knn Algorithm in Data Mining

Author : S.R.Kalaiselvi 1 C. Karpagam 2

Date of Publication :21st December 2017

Abstract: Data mining is the procedure for analyzing data from the different perspective and shortening it into helpful information. It can be used to increase income, minimize the costs. Data mining software is one of the analytical tools for analyzing data. It allows users to examine data from many different proportions, classify it, and review the relationships identified. Theoretically, data mining is the process of ruling correlations or patterns among dozens of fields in huge relational databases. Nowadays, organizations are accumulating vast and growing amounts of data in different formats and different databases. A data mining algorithm is a set of calculations which creates a data mining model from data. To build a model, the algorithm first analyzes the data and it looks for the particular type of pattern. These algorithms use the outcome of the analyzed data to define the most favorable parameters for creating the mining model. K-means is the unsupervised learning algorithm and it is an incremental approach to clustering data dynamically adds one cluster center at a time through a deterministic global search procedure. It is a simple and easy way to classify a given data set through a certain number of clusters. The k-Nearest Neighbors algorithm (or k-NN for short) is a non-parametric method used for classification and regression. In k-NN algorithm, neighbors are taken from a set of objects for which the class (for k-NN classification) otherwise the object property value (for k-NN regression) is identified. This can be considered of as the training set for the algorithm, though no explicit training step is necessary.

Reference :

    1. 1. Tan, Steinbasc & Kumar. Introduction to Data Mining. 2006.
    2. 2. Zaki & Meira. Data Mining and Analysis Fundamental concepts and Algorithms. 2014
    3. 3. Cluster Detection. Retrieved from tuoitre.mobi/tukhoa/k-means-clustering-example-631198.html
    4. 4. K Nearest Neighbors. Retrieved from https://machinelearningmastery.com/tutorial-to-implementk-nearest-neighbors-in-python-from-scratch/

Recent Article