Mahout: k-means Clustering

I committed a first crack at k-means clustering to Mahout last night, thanks again to Jeff Eastman’s excellent work.  This means Mahout now has two clustering algorithms designed to run using Hadoop‘s map reduce algorithm, meaning it should be able to scale up to very large data sets.

To learn more about k-means, see the Mahout wiki, specifically our page on k-means.

One Response to “Mahout: k-means Clustering”

  1. the link https://cwiki.apache.org/MAHOUT/k-means.html is broken

Leave a Reply

*
To prove that you're not a bot, enter this code
Anti-Spam Image