Repository navigation
Expand file tree
/
Copy pathNearestNeighbours.cpp
More file actions
119 lines (92 loc) · 2.51 KB
/
Copy pathNearestNeighbours.cpp
File metadata and controls
119 lines (92 loc) · 2.51 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
#include <cmath>
#include <iostream>
using namespace std;
#include "armadillo.hpp"
using namespace arma;
class KNN
{
private:
mat dataX;
mat dataY;
mat dataXtest;
public:
KNN(string XfileName, string YfileName, string testfileName);
~KNN();
mat read_data(string fileName);
void Train(mat dataX, mat dataXtest, mat dataY, int k = 5);
};
// Constructor
KNN::KNN(string XfileName, string YfileName, string testfileName)
{
dataX = read_data(XfileName);
dataY = read_data(YfileName);
dataXtest = read_data(testfileName);
Train(dataX, dataXtest, dataY);
}
KNN::~KNN()
{}
// method to read data for this purpose
mat KNN::read_data(string fileName)
{
ifstream file(fileName);
mat data;
data.load(file);
return data;
}
void KNN::Train(mat dataX, mat dataXtest, mat dataY, int k)
{
mat distanceMat;
//distanceMat.set_size(dataX.n_rows);
distanceMat.zeros(dataXtest.n_rows, dataXtest.n_cols);
mat labels;
labels.set_size(dataXtest.n_rows);
int label = 0;
int index;
vec distancesum;
for (int i = 0; i < dataXtest.n_rows; i++)
{
//mat sub;
/*
for(int j = 0; j < dataX.n_rows; j++)
{
for(int k = 0; k < dataX.n_cols; k++)
{
distanceMat(j, k) = pow( dataX(j,k) - dataXtest(i, k), 2);
}
} */
// euclidian distance
distanceMat = dataX.each_row() - dataXtest.row(i);
distanceMat = square(distanceMat);
//distanceMat.transform([](double value){return pow(value, 2);});
distancesum = sum(distanceMat, 1);
distancesum.transform([](double value){return sqrt(value);});
for (int m = 0; m < k; m++)
{
//index = index_min(distancesum);
index = distancesum.index_min();
label += dataY(index);
// making sure the index is not reused
distancesum(index) = 10000;
}
if (label < 0)
{
labels(i) = -1;
} else {
labels(i) = 1;
}
// reset label
label = 0;
}
std::ofstream write_file("NN.dat");
for (int i = 0; i < labels.n_rows; i++)
{
write_file << labels[i] << "\n";
}
write_file.close();
}
int main(int argc, char* argv[])
{
KNN calculations("dataX.dat", "dataY.dat", "dataXtest.dat");
// string XfileName, string YfileName, string testfileName
return 0;
}