Machine Learning course by Stanford University / Andrew Ng

Find 16 colors out of millions of colors (24 bit to 4 bit reduction) which represents a picture best, using unsupervised learning algorithm K-means for clustering. You can see the result of my programming exercise at the top. Nice example to visualize how you can reduce highly dimensional problem spaces into something which a computer can handle better without losing the core information.