KMeansClustering

Various K Means Clustering methods in Java
KMeansClustering is a free, open-source and Java based library that implements various methods of K Means Clustering.

One of the algorithms is Elkan K-Means Clustering, which uses triangle inequality to speed up assignment of points to their closest cluster.

K-Means KDTree Clustering is another implemented algorithm that speeds up the assignment of points to their closest cluster using a KD Tree.

Finally, the K-Means KD Forest Clustering method ca select assignments of points to their closest cluster using a forest of KD trees.

last updated on:
November 1st, 2012, 2:16 GMT
file size:
28 KB
price:
FREE!
license type:
BSD 
developed by:
KMeansClustering Team
operating system(s):
Mac OS X
binary format:
-
category:
Home \ Development \ Libraries
KMeansClustering
Download Button

In a hurry? Add it to your Download Basket!

user rating

UNRATED
0.0/5
 

0/5

Rate it!

Add your review!

SUBMIT