Kardi Teknomo Kardi Teknomo
Kardi Teknomo Kardi Teknomo Kardi Teknomo
     
Research
Publications
Tutorials
Resume
Service
Resources
Contact

Visit Tutorials below:
Adaptive Learning from Histogram
Adjacency matrix
Analytic Hierarchy Process (AHP)
ArcGIS tutorial
Arithmetic Mean
Bayes Theorem
Bootstrap Sampling
Bray Curtis Distance
Break Even Point
Chebyshev Distance
City Block Distance
Conditional Probability
Continued Fraction
Data Analysis from Questionnaire
Data Revival from Statistics
Decimal to Rational
Decision tree
Difference equations
Digital Root
Discriminant analysis
Divisibility
Eigen Value using Excel
Euclidean Distance
Euler Integration
Euler Number
Excel Iteration
Excel Macro
Excel Tutorial
Feasibility Study
Financial Analysis
Generalized Inverse
Generalized Mean
Geometric Mean
Ginger Bread Man and Chaos
Graph Theory
Growth Model
Hamming Distance
Harmonic Mean
Hierarchical Clustering
Independent Events
Incident matrix
Jaccard Coefficient
Kernel basis function
Kernel Regression
k-Means clustering
K Nearest Neighbor
LAN Connections Switch
Learning from data
Lehmer Mean
Linear Algebra
Logarithm Rules
Mahalanobis Distance
Market Basket Analysis
Mean Absolute Deviation
Mean and Average
Mean, median, mode
Minkowski Distance
Minkowski Mean
Monte Carlo Simulation
Multi Agent System
Multicriteria decision making
Mutivariate Distance
Newton Raphson
Non-Linear Transformation
Normalization Index
Normalized Rank
Ordinary Differential Equation
Page Rank
Palindrome
PI
Power rules
Prime Factor
Prime Number
Q Learning
Quadratic Function
Queueing Theory
Rank Reversal
Recursive Statistics
Regression Model
Reinforcement Learning
Root of Polynomial
Runge-Kutta
Scenario Analysis
Sierpinski gasket
Sieve of Erastosthenes
Similarity and Distance
Solving System Equation
Standard deviation
String Distance
Summation Tricks
Support Vector Machines
System dynamic
Time Average
Tower of Hanoi
Variance
Vedic Square
Visual Basic (VB) tutorial
What If Analysis

K Nearest Neighbors Tutorial

By Kardi Teknomo, PhD.

KNN e-book

Share this: Google+

This tutorial is an introduction to an instance based learning called K-Nearest Neighbor or KNN algorithm. KNN is part of supervised learning that has been used in many applications in the field of data mining, statistical pattern recognition, image processing and many others. Some successful applications are including recognition of handwriting, satellite image and EKG pattern. Instead of using sophisticated software or any programming language, I will use only spreadsheet functions of Microsoft Excel, without any macro. If you purchase the ebook of this tutorial, you can download the spreadsheet companion of this tutorial.

First, you will learn KNN for classification, then we will extend the same method for smoothing and prediction in solving time series data.

Topics of this tutorial are:

What is K-Nearest Neighbor (KNN) Algorithm?
How K-Nearest Neighbor (KNN) Algorithm works?
Numerical Example (hand computation)
KNN for Smoothing and Prediction
KNN for Interpolation, Smoothing
KNN for Extrapolation, Prediction, Forecasting
How do we use the spreadsheet for KNN?
Strength and Weakness of K-Nearest Neighbor Algorithm
Resources for K Nearest Neighbors Algorithm
Give your feedback and rate this tutorial

Read it off line on any device. Click here to purchase the complete E-book of this tutorial

See Also:
K means clustering, Similarity Measurement, Reinforcement Learning (Q-Learning), Discriminant Analysis, Kernel Regression, Clustering, Decision Tree

Share |

This tutorial is copyrighted.

Preferable reference for this tutorial is

Teknomo, Kardi. K-Nearest Neighbors Tutorial. http:\\people.revoledu.com\kardi\ tutorial\KNN\

 
© 2015 Kardi Teknomo. All Rights Reserved.