-
Notifications
You must be signed in to change notification settings - Fork 9
/
Test.cpp
70 lines (58 loc) · 2.05 KB
/
Test.cpp
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
/*=========================================================================
*
* Copyright David Doria 2011 daviddoria@gmail.com
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0.txt
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*=========================================================================*/
#include "KMeansClustering.h"
#include <iostream>
KMeansClustering::VectorOfPoints GenerateData();
int main(int, char *[])
{
KMeansClustering::VectorOfPoints points = GenerateData();
KMeansClustering kmeans;
kmeans.SetK(2);
kmeans.SetPoints(points);
kmeans.SetInitMethod(KMeansClustering::KMEANSPP);
kmeans.SetRandom(false); // for repeatable results
kmeans.Cluster();
std::vector<unsigned int> labels = kmeans.GetLabels();
if(labels[0] != 0 || labels[1] != 0 || labels[2] != 0 ||
labels[3] != 1 || labels[4] != 1 || labels[5] != 1)
{
return EXIT_FAILURE;
}
// Get all points that belong to cluster 0
std::vector<unsigned int> pointsInCluster0 = kmeans.GetPointIdsWithLabel(0);
std::cout << "There are " << pointsInCluster0.size() << " pointsInCluster0" << std::endl;
return EXIT_SUCCESS;
}
KMeansClustering::VectorOfPoints GenerateData()
{
KMeansClustering::VectorOfPoints points;
KMeansClustering::PointType p = KMeansClustering::PointType::Zero(2);
p[0] = 10; p[1] = 10;
points.push_back(p);
p[0] = 10.1; p[1] = 10.1;
points.push_back(p);
p[0] = 10.2; p[1] = 10.2;
points.push_back(p);
p[0] = 5; p[1] = 5;
points.push_back(p);
p[0] = 5.1; p[1] = 5.1;
points.push_back(p);
p[0] = 5.2; p[1] = 5.2;
points.push_back(p);
return points;
}