A K-means clustering implementation for command-line, Python, Matlab and C. This algorithm yields the very same solution as standard Kmeans, even after each iteration. However it uses some triangle inequalities and stores some distances. Therefore it is MUCH faster than standard Kmeans but uses more memory. See the corresponding paper for more details if you are interested.
- Changes to previous version:
Initial Announcement on mloss.org.
Leave a comment
You must be logged in to post comments.