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
|
// Copyright (C) 2011 Davis E. King (davis@dlib.net)
// License: Boost Software License See LICENSE.txt for the full license.
#include <sstream>
#include <string>
#include <cstdlib>
#include <ctime>
#include <dlib/svm.h>
#include <dlib/matrix.h>
#include "tester.h"
namespace
{
using namespace test;
using namespace dlib;
using namespace std;
logger dlog("test.kmeans");
dlib::rand rnd;
template <typename sample_type>
void run_test(
const std::vector<sample_type>& seed_centers
)
{
print_spinner();
sample_type samp;
std::vector<sample_type> samples;
for (unsigned long j = 0; j < seed_centers.size(); ++j)
{
for (int i = 0; i < 250; ++i)
{
samp = randm(seed_centers[0].size(),1,rnd) - 0.5;
samples.push_back(samp + seed_centers[j]);
}
}
randomize_samples(samples);
std::vector<sample_type> centers;
pick_initial_centers(seed_centers.size(), centers, samples, linear_kernel<sample_type>());
find_clusters_using_kmeans(samples, centers);
DLIB_TEST(centers.size() == seed_centers.size());
std::vector<int> hits(centers.size(),0);
for (unsigned long i = 0; i < samples.size(); ++i)
{
unsigned long best_idx = 0;
double best_dist = 1e100;
for (unsigned long j = 0; j < centers.size(); ++j)
{
if (length(samples[i] - centers[j]) < best_dist)
{
best_dist = length(samples[i] - centers[j]);
best_idx = j;
}
}
hits[best_idx]++;
}
for (unsigned long i = 0; i < hits.size(); ++i)
{
DLIB_TEST(hits[i] == 250);
}
}
class test_kmeans : public tester
{
public:
test_kmeans (
) :
tester ("test_kmeans",
"Runs tests on the find_clusters_using_kmeans() function.")
{}
void perform_test (
)
{
{
dlog << LINFO << "test dlib::vector<double,2>";
typedef dlib::vector<double,2> sample_type;
std::vector<sample_type> seed_centers;
seed_centers.push_back(sample_type(10,10));
seed_centers.push_back(sample_type(10,-10));
seed_centers.push_back(sample_type(-10,10));
seed_centers.push_back(sample_type(-10,-10));
run_test(seed_centers);
}
{
dlog << LINFO << "test dlib::vector<double,2>";
typedef dlib::vector<float,2> sample_type;
std::vector<sample_type> seed_centers;
seed_centers.push_back(sample_type(10,10));
seed_centers.push_back(sample_type(10,-10));
seed_centers.push_back(sample_type(-10,10));
seed_centers.push_back(sample_type(-10,-10));
run_test(seed_centers);
}
{
dlog << LINFO << "test dlib::matrix<double,3,1>";
typedef dlib::matrix<double,3,1> sample_type;
std::vector<sample_type> seed_centers;
sample_type samp;
samp = 10,10,0; seed_centers.push_back(samp);
samp = -10,10,1; seed_centers.push_back(samp);
samp = -10,-10,2; seed_centers.push_back(samp);
run_test(seed_centers);
}
}
} a;
}
|
