## Twister Tutorial

K-means Clustering is typical iterative algorithm. In every iteration, the distance between data points and cluster centers are recalculated and the new cluster centers are re-expected. Twister K-means Clustering is a good example to unederstand Twister iterative MapReduce.

- Exercise 1: K-means Clustering: Algorithm and Application Introduction
- Exercise 2: How to run Twister K-Means Clustering
- Exercise 3: How to write Twister K-means Clustering

Twister Matrix Multiplication is another example which shows how to do matrix multiplication in an iterative way.