-
Notifications
You must be signed in to change notification settings - Fork 9
Expand file tree
/
Copy pathNormalizationEasy.hpp
More file actions
188 lines (182 loc) · 8.58 KB
/
Copy pathNormalizationEasy.hpp
File metadata and controls
188 lines (182 loc) · 8.58 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
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
/*
* binary-cpp-api - Binary C++ API client
*
* Copyright (c) 2018 Elektro Yar. Email: git.electroyar@gmail.com
*
* Permission is hereby granted, free of charge, to any person obtaining a copy
* of this software and associated documentation files (the "Software"), to deal
* in the Software without restriction, including without limitation the rights
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
* copies of the Software, and to permit persons to whom the Software is
* furnished to do so, subject to the following conditions:
*
* The above copyright notice and this permission notice shall be included in
* all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#ifndef NORMALIZATIONEASY_HPP_INCLUDED
#define NORMALIZATIONEASY_HPP_INCLUDED
#include <vector>
#include <algorithm>
#include <numeric>
#include <cmath>
#include "BinaryApiCommon.hpp"
namespace NormalizationEasy
{
using namespace BinaryApiCommon;
//------------------------------------------------------------------------------
/** \brief MinMax нормализация данных
* \param in входные данные для нормализации
* \param out нормализованный вектор
* \param type тип нормализации (0 - нормализация данных к промежутку от 0 до 1, иначе от -1 до 1)
* \return вернет 0 в случае успеха
*/
template<class T1, class T2>
int calculate_min_max(std::vector<T1> &in, std::vector<T2> &out, int type)
{
if(in.size() == 0)
return INVALID_PARAMETER;
auto it_max_data = std::max_element(in.begin(), in.end());
auto it_min_data = std::min_element(in.begin(), in.end());
T1 max_data = in[0];
T1 min_data = in[0];
if(it_max_data != in.end() && it_min_data != in.end()) {
max_data = *it_max_data;
min_data = *it_min_data;
}
T1 ampl = max_data - min_data;
out.resize(in.size());
if(ampl != 0) {
for(size_t i = 0; i < in.size(); i++) {
out[i] = type == 0 ? (double)(in[i] - min_data) / ampl : 2.0 * ((double)(in[i] - min_data) / ampl) - 1.0;
}
} else {
for(size_t i = 0; i < in.size(); i++) {
out[i] = 0.0;
}
}
return OK;
}
//------------------------------------------------------------------------------
/** \brief Z-Score нормализация данных
* \param in входные данные для нормализации
* \param out нормализованный вектор
* \param d множитель для стандартного отклонения
* \return вернет 0 в случае успеха
*/
template<class T1, class T2>
int calculate_zscore(std::vector<T1> &in, std::vector<T2> &out, double d = 1.0) {
if(in.size() == 0)
return INVALID_PARAMETER;
T1 mean = std::accumulate(in.begin(), in.end(), T1(0));
mean /= (T1)in.size();
T1 diff = 0;
for(size_t k = 0; k < in.size(); ++k) {
diff += ((in[k] - mean) * (in[k] - mean));
}
T1 std_dev = diff > 0 ? std::sqrt(diff / (T1) (in.size() - 1)) : 0.0;
out.resize(in.size());
double dix = d * std_dev;
for(size_t k = 0; k < in.size(); ++k) {
out[k] = dix != 0 ? (in[k] - mean) / dix : 0.0;
if(out[k] > 1)
out[k] = 1;
if(out[k] < -1)
out[k] = -1;
}
return OK;
}
//------------------------------------------------------------------------------
/** \brief Посчитать массив разности элементов
* \param in входные данные для подсчета разницы
* \param out массив с разностью элементов
* \return вернет 0 в случае успеха
*/
template<class T1, class T2>
int calculate_difference(std::vector<T1> &in, std::vector<T2> &out) {
if(in.size() < 2) {
out.clear();
return INVALID_PARAMETER;
}
out.resize(in.size() - 1);
for(size_t i = 1; i < in.size(); i++) {
out[i - 1] = in[i] - in[i - 1];
}
return OK;
}
//------------------------------------------------------------------------------
#if(0)
/** \brief Максимизировать амплитуду
* \param in входные данные
* \param out получившееся данные
* \param norm вектор по которому нормируем данные
* \return вернет 0 в случае успеха
*/
template<class T1, class T2, class T3>
int maximize_amplitudes(std::vector<T1>& in, std::vector<T2>& out, std::vector<T3>& norm) {
if(in.size() != norm.size() || in.size() == 0) {
out.clear();
return INVALID_PARAMETER;
}
T1 max_data = *std::max_element(norm.begin(), norm.end());
T1 min_data = *std::min_element(norm.begin(), norm.end());
out.resize(in.size());
for(size_t i = 0; i < in.size(); i++) {
out[i] = in[i] > 0 ? (in[i] / max_data) : (in[i] < 0 ? (in[i] / -min_data) : 0.0);
}
return OK;
}
#endif
//------------------------------------------------------------------------------
/** \brief Нормализовать амплитуду
* \param in входные данные
* \param out получившееся данные
* \param max_amplitude максимальная амплитуда
* \return вернет 0 в случае успеха
*/
template<class T1, class T2, class T3>
int normalize_amplitudes(std::vector<T1>& in, std::vector<T2>& out, T3 max_amplitude) {
if(in.size() == 0) {
out.clear();
return INVALID_PARAMETER;
}
out.resize(in.size());
T1 max_data = *std::max_element(in.begin(), in.end());
T1 min_data = *std::min_element(in.begin(), in.end());
T1 max_data_ampl = std::max(abs(min_data),abs(max_data));
if(max_data_ampl == 0)
return OK;
T3 coeff = max_amplitude/max_data_ampl;
for(size_t i = 0; i < in.size(); i++) {
out[i] = coeff * in[i];
}
return OK;
}
//------------------------------------------------------------------------------
/** \brief Логарифм от данных
* \param in входные данные
* \param out получившееся данные
* \return вернет 0 в случае успеха
*/
template<class T1, class T2>
int calculate_log(std::vector<T1>& in, std::vector<T2>& out) {
if(in.size() == 0) {
out.clear();
return INVALID_PARAMETER;
}
out.resize(in.size());
for(size_t i = 0; i < in.size(); i++) {
out[i] = std::log(in[i]);
}
return OK;
}
//------------------------------------------------------------------------------
}
#endif // NORMALIZATIONEASY_HPP_INCLUDED