Kardi Teknomo
Kardi Teknomo Kardi Teknomo Kardi Teknomo
   
 
Research
Publications
Tutorials
Resume
Personal
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-Mean Clustering Tutorials

By Kardi Teknomo, PhD.
KMean e-book

Share this: Google+

This tutorial will introduce you to the heart of Pattern Recognition, unsupervised learning of Neural network called k-means clutering. When User click picture box to input new data (X,Y), the program will make group/cluster the data by minimizing the sum of squares of distances between data and the corresponding cluster centroids. Different color code represent the clusters. This algorithm is a standard and popular algorithm for unsupervised learning of Neural network, Pattern recognitions, Classification analysis, clustering analysis etc.

Tired of ads? Do want to read comfortably this tutorial from any device? Purchase the complete e-book of this k means clustering tutorial.


Topics of this k means tutorials:

What is K-Mean Clustering?
Numerical Example (hand calculation); Spanish translation available here
How the K-Mean Clustering algorithm works?
Download Code in VB (Screenshot)
Download code in Matlab
What is the mimimum number of attributes?
What are the applications of K-mean clustering?
What are the weaknesses of K-Mean Clustering?
Are there any other resources for K-mean Clustering?
Citation (other papers that has reference to this tutorial)

Rate this tutorial

See also:

Similarity and Dissmilarity Measurements (for multivariate distances)
Discriminant Analysis (LDA)
K Nearest Neighbor

Do you have question regarding this k means tutorial? Ask your question here

Read this tutorial off-line in any device. Purchase the complete e-book of K Means Clustering tutorial here

Share |

This tutorial is copyrighted.

Preferable reference for this tutorial is

Teknomo, Kardi. K-Means Clustering Tutorials. http:\\people.revoledu.com\kardi\ tutorial\kMean\

 




 

 

 
© 2006 Kardi Teknomo. All Rights Reserved.
Designed by CNV Media