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
|
/**
* @file msvmmaj_pred.c
* @author Gertjan van den Burg (burg@ese.eur.nl)
* @date August 9, 2013
* @brief Main functions for predicting class labels..
*
*/
#include <cblas.h>
#include "libMSVMMaj.h"
#include "MSVMMaj.h"
#include "matrix.h"
#include "msvmmaj_pred.h"
/**
* @name predict_labels
* @brief Predict class labels of data given and output in predy
*
* The labels are predicted by mapping each instance in data to the
* simplex space using the matrix V in the given model. Next, for each
* instance the nearest simplex vertex is determined using an Euclidean
* norm. The nearest simplex vertex determines the predicted class label,
* which is recorded in predy
*
* @param [in] data data to predict labels for
* @param [in] model model with optimized V
* @param [out] predy pre-allocated vector to record predictions in
*/
void msvmmaj_predict_labels(struct MajData *data, struct MajModel *model, long *predy)
{
long i, j, k, label;
double norm, min_dist;
long n = data->n; // note that model->n is the size of the training sample.
long m = data->m;
long K = model->K; //data->K does not necessarily equal the original K.
double *S = Calloc(double, K-1);
double *ZV = Calloc(double, n*(K-1));
double *U = Calloc(double, K*(K-1));
// Get the simplex matrix
msvmmaj_simplex_gen(K, U);
// Generate the simplex-space vectors
cblas_dgemm(
CblasRowMajor,
CblasNoTrans,
CblasNoTrans,
n,
K-1,
m+1,
1.0,
data->Z,
m+1,
model->V,
K-1,
0.0,
ZV,
K-1);
// Calculate the distance to each of the vertices of the simplex.
// The closest vertex defines the class label.
for (i=0; i<n; i++) {
label = 0;
min_dist = 1000000000.0;
for (j=0; j<K; j++) {
for (k=0; k<K-1; k++) {
S[k] = matrix_get(ZV, K-1, i, k) - matrix_get(U, K-1, j, k);
}
norm = cblas_dnrm2(K, S, 1);
if (norm < min_dist) {
label = j+1; // labels start counting from 1
min_dist = norm;
}
}
predy[i] = label;
}
free(ZV);
free(U);
free(S);
}
/**
* @name msvmmaj_prediction_perf
* @brief Calculate the predictive performance (percentage correct)
*
* The predictive performance is calculated by simply counting the number
* of correctly classified samples and dividing by the total number of
* samples, multiplying by 100.
*
* @param [in] data the dataset with known labels
* @param [in] predy the predicted class labels
*
* @returns percentage correctly classified.
*/
double msvmmaj_prediction_perf(struct MajData *data, long *predy)
{
long i, correct = 0;
double performance;
for (i=0; i<data->n; i++)
if (data->y[i] == predy[i])
correct++;
performance = ((double) correct)/((double) data->n)* 100.0;
return performance;
}
|
