forked from litany-of-boredom/svm_wrappers
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmain.cpp
More file actions
327 lines (291 loc) · 11.5 KB
/
main.cpp
File metadata and controls
327 lines (291 loc) · 11.5 KB
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
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
#include "problem.hpp"
#include "libsvm.hpp"
#include "cplex.hpp"
#include "Eigen/Dense"
#include <ctime>
#include <ratio>
#include <chrono>
using namespace std::chrono;
using RowVector = Eigen::Matrix<double, 1, Eigen::Dynamic>;
using Hyperplane = Eigen::Hyperplane<double, Eigen::Dynamic>;
double average(int* arr, int size)
{
double sum = 0;
for(int i = 0; i < size; i++)
{
sum+= arr[i];
}
return sum/size;
}
double st_dev(int* arr, int size, double average)
{
double sumSquares = 0;
for(int i = 0; i < size; i++)
{
sumSquares += pow(arr[i] - average, 2);
}
return sqrt(sumSquares / size);
}
int main()
{
SVMWrappers::Problem<double, 2> p(8);
SVMWrappers::Problem<double, 3> p2(16);
RowVector rv(1,2);
RowVector rv2(1,3);
Hyperplane hp;
double randx1;
double randx2;
double randy1;
double randy2;
double randz1;
double randz2;
int distancex;
int distancey;
int distancez;
int numTrials = 1000;
int cplexLongestSquare = -1;
int libsvmLongestSquare = -1;
int cplexLongestCube = -1;
int libsvmLongestCube = -1;
int* times = new int[numTrials];
// 2d test
for(int i = 0; i < numTrials; i++)
{
while(true)
{
randx1 = (rand() % 10000) / 100;
randx2 = (rand() % 10000) / 100;
distancex = abs(randx1-randx2);
randy1 = (rand() % 10000) / 100;
randy2 = (rand() % 10000) / 100;
distancey = abs(randy1-randy2);
if(distancex > 0 && distancey > 0)
break;
}
double size = (rand() % (min(distancex, distancey) * 100)) / 100;
if(size > 0.01)
size -= 0.01;
rv(0,0) = randx1 - size/2; // bot left corner
rv(0,1) = randy1 - size/2;
p.set_vector(0, rv, 1);
rv(0,1) = randy1 + size/2; // top left
p.set_vector(1, rv, 1);
rv(0,0) = randx1 + size/2; // top right
p.set_vector(3, rv, 1);
rv(0,1) = randy1 - size/2; // bot right
p.set_vector(2, rv, 1);
rv(0,0) = randx2 - size/2; // bot left corner
rv(0,1) = randy2 - size/2;
p.set_vector(4, rv, -1);
rv(0,1) = randy2 + size/2; // top left
p.set_vector(5, rv, -1);
rv(0,0) = randx2 + size/2; // top right
p.set_vector(7, rv, -1);
rv(0,1) = randy2 - size/2; // bot right
p.set_vector(6, rv, -1);
high_resolution_clock::time_point t1 = high_resolution_clock::now();
hp = SVMWrappers::CPLEX::solve(p);
high_resolution_clock::time_point t2 = high_resolution_clock::now();
duration<double, std::milli> time_span = t2 - t1;
if(time_span.count() > cplexLongestSquare)
cplexLongestSquare = time_span.count();
std::cout << hp.normal() << " " << i << std::endl;
times[i] = time_span.count();
}
double cplexAverageSquare = average(times, numTrials);
double cplexStDevSquare = st_dev(times, numTrials, cplexAverageSquare);
for(int i = 0; i < numTrials; i++)
{
while(true)
{
randx1 = (rand() % 10000) / 100;
randx2 = (rand() % 10000) / 100;
distancex = abs(randx1-randx2);
randy1 = (rand() % 10000) / 100;
randy2 = (rand() % 10000) / 100;
distancey = abs(randy1-randy2);
if(distancex > 0 && distancey > 0)
break;
}
double size = (rand() % (min(distancex, distancey) * 100)) / 100;
if(size > 0.01)
size -= 0.01;
rv(0,0) = randx1 - size/2; // bot left corner
rv(0,1) = randy1 - size/2;
p.set_vector(0, rv, 1);
rv(0,1) = randy1 + size/2; // top left
p.set_vector(1, rv, 1);
rv(0,0) = randx1 + size/2; // top right
p.set_vector(3, rv, 1);
rv(0,1) = randy1 - size/2; // bot right
p.set_vector(2, rv, 1);
rv(0,0) = randx2 - size/2; // bot left corner
rv(0,1) = randy2 - size/2;
p.set_vector(4, rv, -1);
rv(0,1) = randy2 + size/2; // top left
p.set_vector(5, rv, -1);
rv(0,0) = randx2 + size/2; // top right
p.set_vector(7, rv, -1);
rv(0,1) = randy2 - size/2; // bot right
p.set_vector(6, rv, -1);
high_resolution_clock::time_point t1 = high_resolution_clock::now();
hp = SVMWrappers::LIBSVM::solve(p);
high_resolution_clock::time_point t2 = high_resolution_clock::now();
duration<double, std::milli> time_span = t2 - t1;
if(time_span.count() > libsvmLongestSquare)
libsvmLongestSquare = time_span.count();
std::cout << hp.normal() << " " << i << std::endl;
times[i] = time_span.count();
}
double libsvmAverageSquare = average(times, numTrials);
double libsvmStDevSquare = st_dev(times, numTrials, libsvmAverageSquare);
// 3d test
for(int i = 0; i < numTrials; i++)
{
while(true)
{
randx1 = (rand() % 10000) / 100;
randx2 = (rand() % 10000) / 100;
distancex = abs(randx1-randx2);
randy1 = (rand() % 10000) / 100;
randy2 = (rand() % 10000) / 100;
distancey = abs(randy1-randy2);
randz1 = (rand() % 10000) / 100;
randz2 = (rand() % 10000) / 100;
distancez = abs(randz1-randz2);
if(distancex > 0 && distancey > 0 && distancez > 0)
break;
}
double size = (rand() % (min(distancez, min(distancex, distancey)) * 100)) / 100;
if(size > 0.01)
size -= 0.01;
rv2(0,0) = randx1 - size/2; // bot left front corner
rv2(0,1) = randy1 - size/2;
rv2(0,2) = randz1 - size/2;
p2.set_vector(0, rv2, 1);
rv2(0,2) = randz1 + size/2; // bot left back
p2.set_vector(1, rv2, 1);
rv2(0,0) = randx1 + size/2; // bot right back
p2.set_vector(2, rv2, 1);
rv2(0,2) = randz1 - size/2; // bot right front
p2.set_vector(3, rv2, 1);
rv2(0,1) = randy1 + size/2; // top right front
p2.set_vector(4, rv2, 1);
rv2(0,0) = randx1 - size/2; // top left front
p2.set_vector(5, rv2, 1);
rv2(0,2) = randz1 + size/2; // top left back
p2.set_vector(6, rv2, 1);
rv2(0,0) = randx1 + size/2; // top right back
p2.set_vector(7, rv2, 1);
rv2(0,0) = randx2 - size/2; // bot left front corner
rv2(0,1) = randy2 - size/2;
rv2(0,2) = randz2 - size/2;
p2.set_vector(8, rv2, -1);
rv2(0,2) = randz2 + size/2; // bot left back
p2.set_vector(9, rv2, -1);
rv2(0,0) = randx2 + size/2; // bot right back
p2.set_vector(10, rv2, -1);
rv2(0,2) = randz2 - size/2; // bot right front
p2.set_vector(11, rv2, -1);
rv2(0,1) = randy2 + size/2; // top right front
p2.set_vector(12, rv2, -1);
rv2(0,0) = randx2 - size/2; // top left front
p2.set_vector(13, rv2, -1);
rv2(0,2) = randz2 + size/2; // top left back
p2.set_vector(14, rv2, -1);
rv2(0,0) = randx2 + size/2; // top right back
p2.set_vector(15, rv2, -1);
high_resolution_clock::time_point t1 = high_resolution_clock::now();
hp = SVMWrappers::CPLEX::solve(p2);
high_resolution_clock::time_point t2 = high_resolution_clock::now();
duration<double, std::milli> time_span = t2 - t1;
if(time_span.count() > cplexLongestCube)
cplexLongestCube = time_span.count();
std::cout << hp.normal() << " " << i << std::endl;
times[i] = time_span.count();
}
double cplexAverageCube = average(times, numTrials);
double cplexStDevCube = st_dev(times, numTrials, cplexAverageCube);
for(int i = 0; i < numTrials; i++)
{
while(true)
{
randx1 = (rand() % 10000) / 100;
randx2 = (rand() % 10000) / 100;
distancex = abs(randx1-randx2);
randy1 = (rand() % 10000) / 100;
randy2 = (rand() % 10000) / 100;
distancey = abs(randy1-randy2);
randz1 = (rand() % 10000) / 100;
randz2 = (rand() % 10000) / 100;
distancez = abs(randz1-randz2);
if(distancex > 0 && distancey > 0 && distancez > 0)
break;
}
double size = (rand() % (min(distancez, min(distancex, distancey)) * 100)) / 100;
if(size > 0.01)
size -= 0.01;
rv2(0,0) = randx1 - size/2; // bot left front corner
rv2(0,1) = randy1 - size/2;
rv2(0,2) = randz1 - size/2;
p2.set_vector(0, rv2, 1);
rv2(0,2) = randz1 + size/2; // bot left back
p2.set_vector(1, rv2, 1);
rv2(0,0) = randx1 + size/2; // bot right back
p2.set_vector(2, rv2, 1);
rv2(0,2) = randz1 - size/2; // bot right front
p2.set_vector(3, rv2, 1);
rv2(0,1) = randy1 + size/2; // top right front
p2.set_vector(4, rv2, 1);
rv2(0,0) = randx1 - size/2; // top left front
p2.set_vector(5, rv2, 1);
rv2(0,2) = randz1 + size/2; // top left back
p2.set_vector(6, rv2, 1);
rv2(0,0) = randx1 + size/2; // top right back
p2.set_vector(7, rv2, 1);
rv2(0,0) = randx2 - size/2; // bot left front corner
rv2(0,1) = randy2 - size/2;
rv2(0,2) = randz2 - size/2;
p2.set_vector(8, rv2, -1);
rv2(0,2) = randz2 + size/2; // bot left back
p2.set_vector(9, rv2, -1);
rv2(0,0) = randx2 + size/2; // bot right back
p2.set_vector(10, rv2, -1);
rv2(0,2) = randz2 - size/2; // bot right front
p2.set_vector(11, rv2, -1);
rv2(0,1) = randy2 + size/2; // top right front
p2.set_vector(12, rv2, -1);
rv2(0,0) = randx2 - size/2; // top left front
p2.set_vector(13, rv2, -1);
rv2(0,2) = randz2 + size/2; // top left back
p2.set_vector(14, rv2, -1);
rv2(0,0) = randx2 + size/2; // top right back
p2.set_vector(15, rv2, -1);
high_resolution_clock::time_point t1 = high_resolution_clock::now();
hp = SVMWrappers::LIBSVM::solve(p2);
high_resolution_clock::time_point t2 = high_resolution_clock::now();
duration<double, std::milli> time_span = t2 - t1;
if(time_span.count() > libsvmLongestCube)
libsvmLongestCube = time_span.count();
std::cout << hp.normal() << " " << i << std::endl;
times[i] = time_span.count();
}
double libsvmAverageCube = average(times, numTrials);
double libsvmStDevCube = st_dev(times, numTrials, libsvmAverageCube);
std::cout << "\nSquare test\n";
std::cout << "Cplex average: " << cplexAverageSquare << std::endl;
std::cout << "Cplex longest: " << cplexLongestSquare << std::endl;
std::cout << "Cplex st dev: " << cplexStDevSquare << std::endl;
std::cout << "Libsvm average: " << libsvmAverageSquare << std::endl;
std::cout << "Libsvm longest: " << libsvmLongestSquare << std::endl;
std::cout << "Libsvm st dev: " << libsvmStDevSquare << std::endl;
std::cout << "\nCube test\n";
std::cout << "Cplex average: " << cplexAverageCube << std::endl;
std::cout << "Cplex longest: " << cplexLongestCube << std::endl;
std::cout << "Cplex st dev: " << cplexStDevCube << std::endl;
std::cout << "Libsvm average: " << libsvmAverageCube << std::endl;
std::cout << "Libsvm longest: " << libsvmLongestCube << std::endl;
std::cout << "Libsvm st dev: " << libsvmStDevCube << std::endl;
delete[] times;
return 0;
}