Clustering Application Benchmark
Oğuz Altun, Nilgun Dursunoglu, Mehmet Fatih Amasyalı · 2006
An application benchmark based on a set of clustering algorithms is described in this paper. The details of algorithms (K-means online, K-means batch, SOM-1 dimension, SOM-2 dimension, Hierarchical K-means online and Hierarchical SOM-1 dimension) are given. The code provided complies with ANSI C specifications, as a result is highly portable. The benchmark has been tested on various platforms using different compilers.