H A D | kmeans.h | 26 inline void sum(T values[], int len, int dimension, int stride, N dst[]) { argument 32 for (x = 0; x < len; x+= stride) { 88 void initialPickHeuristicRandom(int k, T values[], int len, int dimension, int stride, T dst[], argument 91 num_vals = len / stride; 111 r *= stride; 115 cntr += stride; 123 inline int findClosest(T values[], T oldCenters[], int dimension, int stride, int pop_size) { argument 127 for (y = stride; y < pop_size; y+=stride) { 141 int calculateNewCentroids(int k, T values[], int len, int dimension, int stride, argument 179 runKMeansWithPicks(int k, T finalCentroids[], T values[], int len, int dimension, int stride, int iterations, T initialPicks[]) argument 209 runKMeans(int k, T finalCentroids[], T values[], int len, int dimension, int stride, int iterations, unsigned int seed) argument 223 applyCentroids(int k, T centroids[], T values[], int len, int dimension, int stride) argument [all...] |