/
externalKmeans.c
208 lines (197 loc) · 5.49 KB
/
externalKmeans.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <malloc.h>
#include <math.h>
#include <time.h>
#include <sys/stat.h>
#include <fcntl.h>
#define memBlock 1024
#define lineMem 512
#define iterLimit 1000
#define delims ",\n"
int fillBuffer(FILE* inputFile, unsigned long fileSize, char* buffer){
unsigned int lastRead = 0, breakMe = 0;
unsigned long readAmt=0, readLen=0;
unsigned long p=0, q=0, r=0;
readAmt = memBlock - sizeof(char);
if(readAmt > (fileSize - ftell(inputFile))){
readAmt = fileSize - ftell(inputFile);
lastRead = 1;
}
readLen = fread(buffer, sizeof(char), readAmt, inputFile);
buffer[readLen] = '\0';
if(!lastRead){
for(p = strlen(buffer)-1; p>=0; --p){
for(r=0; r<strlen(delims); ++r){
if(buffer[p] == delims[r]){
buffer[p] = '\0';
breakMe = 1;
break;
}
}
if(breakMe){
breakMe = 0;
break;
}
}
q = readLen-p-1;
fseek(inputFile, -q, SEEK_CUR);
}
return lastRead;
}
double euclidDist(double* p1, double* p2, long dim){
double accumulator=0;
long i;
for(i=0; i<dim; ++i)
accumulator+=pow(p1[i]-p2[i], 2);
return sqrt(accumulator);
}
int findClosest(double* p1, double* centers, long dim, long k){
long closest = 0, i;
double minDist=0, testDist=0;
minDist = euclidDist(p1, centers, dim);
for(i=1; i<k; ++i){
testDist = euclidDist(p1, centers+(i*dim), dim);
if( minDist > testDist){
closest = i;
minDist = testDist;
}
}
return closest;
}
int centerDiff(double* centers1, double* centers2, double tol, long k, long dim){
long i;
double accum=0;
for(i=0; i<k; ++i){
accum += euclidDist(centers1+(i*dim), centers2+(i*dim), dim);
}
if(accum > tol)
return 1;
else
return 0;
}
int main(int argc, char* argv[]){
FILE *inputFile; //done
int breakMe = 0, lastRead = 0;
char *buffer, *tmpChar; //done
long i=0, j=0, n=0, l=0, colAmt=0, rowAmt=0, fileSize=0, k=atoi(argv[2]);
long closePoint = 0;
long iterCount = 0;
double *M, *centers1, *centers2, *tmpCenters, *centerWeights; //done
//Variable allocation and initialization
inputFile = fopen(argv[1], "r");
buffer = malloc(memBlock);
M = malloc(memBlock);
srand(time(NULL));
fgets(buffer, memBlock, inputFile);
tmpChar = strtok(buffer, delims);
while(tmpChar != NULL){
++colAmt;
tmpChar = strtok(NULL, delims);
}
rowAmt = memBlock/(sizeof(double)*colAmt);
fseek(inputFile, 0, SEEK_END);
fileSize = ftell(inputFile);
rewind(inputFile);
centers1 = (double*) malloc(sizeof(double)*k*colAmt);
centers2 = (double*) malloc(sizeof(double)*k*colAmt);
centerWeights = (double*) malloc(sizeof(double)*k);
/*******SEEDING**********************/
tmpChar = NULL;
lastRead = 0;
do{
fillBuffer(inputFile, fileSize, buffer);
for(i=0;i<(rowAmt*colAmt); ++i){
if(tmpChar == NULL){
if(lastRead){
breakMe=1;
break;
}
else{
lastRead = fillBuffer(inputFile, fileSize, buffer);
tmpChar = strtok(buffer, delims);
}
}
M[i] = atof(tmpChar);
tmpChar = strtok(NULL, delims);
}
}while(i<(rowAmt*colAmt) && !breakMe);
breakMe = 0;
for(j=0; j<k; ++j){
centerWeights[j] = 0;
memmove(centers1+(j*colAmt), M+((rand()%(i/colAmt))*colAmt), sizeof(double)*colAmt);
memmove(centers2+(j*colAmt), centers1+(j*colAmt), sizeof(double)*colAmt);
}
/********CLUSTERING**********************/
rewind(inputFile);
tmpChar = NULL;
lastRead = 0;
breakMe = 0;
iterCount = 0;
for(n=0; n<10; ++n){
do{
do{
for(i=0;i<(rowAmt*colAmt); ++i){
if(tmpChar == NULL){
if(lastRead){
breakMe=1;
break;
}
else{
printf("%zu : %lu\r", ftell(inputFile), fileSize);
lastRead = fillBuffer(inputFile, fileSize, buffer);
tmpChar = strtok(buffer, delims);
}
}
M[i] = atof(tmpChar);
tmpChar = strtok(NULL, delims);
}
for(j=0; j<(i/colAmt); ++j){
closePoint = findClosest(M+(j*colAmt), centers1, colAmt, k);
for(l=0; l<colAmt; ++l){
centers2[closePoint*colAmt+l] = ((centers2[closePoint*colAmt+l]
* centerWeights[closePoint]) + M[j*colAmt + l]) / (centerWeights[closePoint] +1);
}
++centerWeights[closePoint];
}
}while(!breakMe);
/*******PRINT CENTERS************************
printf("---CENTERS---\n");
for(j=0;j<k; ++j){
printf("%lu: ", j+1);
for(l=0; l<colAmt; ++l)
printf("%f ", centers2[j*colAmt + l]);
printf("\n");
}
********************************************/
for(i=0;i<k;++i)
centerWeights[i] = 0;
tmpCenters = centers1;
centers1 = centers2;
centers2 = tmpCenters;
breakMe = 0;
lastRead = 0;
rewind(inputFile);
++iterCount;
if(iterCount > iterLimit){
printf("ITERLIMITBREAK\n");
break;
}
}while(centerDiff(centers1, centers2, .0001, k, colAmt));
}
printf("---CENTERS---\n");
for(j=0;j<k; ++j){
printf("%lu: ", j+1);
for(l=0; l<colAmt; ++l)
printf("%f ", centers2[j*colAmt + l]);
printf("\n");
}
fclose(inputFile);
free(buffer);
free(M);
free(centers1);
free(centers2);
free(centerWeights);
return 1;
}