kmeans_test, an Octave code which calls kmeans(), which handles the K-Means problem, which organizes a set of N points in M dimensions into K clusters;
The computer code and data files described and made available on this web page are distributed under the MIT license
kmeans, an Octave code which contains several different algorithms for the K-Means problem, which organizes a set of N points in M dimensions into K clusters;
There are data files read by the sample code:
TEST01 applies HMEANS_01 to points_100.txt:
TEST02 applies HMEANS_02 to points_100.txt:
TEST03 applies KMEANS_01 to points_100.txt:
TEST04 applies KMEANS_02 to points_100.txt:
TEST05 applies KMEANS_03 to points_100.txt:
TEST06 applies HMEANS_01 + KMEANS_01 to points_100.txt:
TEST07 applies HMEANS_01 + KMEANS_02 to points_100.txt:
TEST08 applies KMEANS_01 + KMEANS_03 to points_100.txt:
TEST09 applies HMEANS_W_01 to points_100.txt and weights_equal_100.txt:
TEST10 applies HMEANS_W_02 to points_100.txt and weights_equal_100.txt:
TEST11 applies KMEANS_W_01 to points_100.txt and weights_equal_100.txt:
TEST12 applies KMEANS_W_03 to points_100.txt and weights_equal_100.txt:
TEST13 applies HMEANS_W_01 to points_100.txt and weights_unequal_100.txt:
TEST14 applies HMEANS_W_02 to points_100.txt and weights_unequal_100.txt:
TEST15 applies KMEANS_W_01 to points_100.txt and weights_unequal_100.txt:
TEST16 applies KMEANS_W_03 to points_100.txt and weights_unequal_100.txt: