18 using namespace shogun;
22 std(NULL), num_idx(0), divide_by_std(divide), initialized(false)
41 int32_t num_features = simple_features->get_num_features();
54 for (i=0; i<num_features; i++)
63 for (i=0; i<num_examples; i++)
65 for (j=0; j<num_features; j++)
66 mean[j]+=feature_matrix.
matrix[i*num_features+j];
69 for (j=0; j<num_features; j++)
70 mean[j]/=num_examples;
73 for (i=0; i<num_examples; i++)
75 for (j=0; j<num_features; j++)
80 int32_t* idx_ok=
SG_MALLOC(
int, num_features);
82 for (j=0; j<num_features; j++)
93 SG_INFO(
"Reducing number of features from %i to %i\n", num_features, num_ok) ;
100 for (j=0; j<num_ok; j++)
103 new_mean[j]=
mean[idx_ok[j]];
104 std[j]=sqrt(var[idx_ok[j]]);
137 int32_t num_vectors=0;
138 int32_t num_features=0;
141 SG_INFO(
"get Feature matrix: %ix%i\n", num_vectors, num_features);
142 SG_INFO(
"Preprocessing feature matrix\n");
143 for (int32_t vec=0; vec<num_vectors; vec++)
150 for (int32_t feat=0; feat<
num_idx; feat++)
151 v_dst[feat]=(v_src[
idx[feat]]-
mean[feat])/
std[feat];
155 for (int32_t feat=0; feat<
num_idx; feat++)
156 v_dst[feat]=(v_src[
idx[feat]]-
mean[feat]);
162 SG_INFO(
"new Feature matrix: %ix%i\n", num_vectors, num_features);
179 for (int32_t i=0; i<
num_idx; i++)
184 for (int32_t i=0; i<
num_idx; i++)
191 for (int32_t i=0; i<vector.
vlen; i++)