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
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
|
/*
fuzzylite (R), a fuzzy logic control library in C++.
Copyright (C) 2010-2017 FuzzyLite Limited. All rights reserved.
Author: Juan Rada-Vilela, Ph.D. <jcrada@fuzzylite.com>
This file is part of fuzzylite.
fuzzylite is free software: you can redistribute it and/or modify it under
the terms of the FuzzyLite License included with the software.
You should have received a copy of the FuzzyLite License along with
fuzzylite. If not, see <http://www.fuzzylite.com/license/>.
fuzzylite is a registered trademark of FuzzyLite Limited.
*/
#include "fl/term/Aggregated.h"
#include "fl/imex/FllExporter.h"
#include "fl/norm/s/Maximum.h"
namespace fl {
Aggregated::Aggregated(const std::string& name, scalar minimum, scalar maximum,
SNorm* aggregation)
: Term(name), _minimum(minimum), _maximum(maximum), _aggregation(aggregation) { }
Aggregated::Aggregated(const Aggregated& other) : Term(other) {
copyFrom(other);
}
Aggregated& Aggregated::operator=(const Aggregated& other) {
if (this != &other) {
clear();
_aggregation.reset(fl::null);
Term::operator=(other);
copyFrom(other);
}
return *this;
}
Aggregated::~Aggregated() { }
void Aggregated::copyFrom(const Aggregated& source) {
_minimum = source._minimum;
_maximum = source._maximum;
if (source._aggregation.get())
_aggregation.reset(source._aggregation->clone());
for (std::size_t i = 0; i < source._terms.size(); ++i) {
_terms.push_back(source._terms.at(i));
}
}
std::string Aggregated::className() const {
return "Aggregated";
}
Complexity Aggregated::complexity() const {
return complexityOfMembership();
}
Complexity Aggregated::complexityOfMembership() const {
Complexity result;
result.comparison(3);
if (_aggregation.get()) {
result += _aggregation->complexity().multiply(scalar(_terms.size()));
}
for (std::size_t i = 0; i < _terms.size(); ++i) {
result += _terms.at(i).complexity();
}
return result;
}
scalar Aggregated::membership(scalar x) const {
if (Op::isNaN(x)) return fl::nan;
if (not (_terms.empty() or _aggregation.get())) { //Exception for IntegralDefuzzifiers
throw Exception("[aggregation error] "
"aggregation operator needed to aggregate variable "
"<" + getName() + ">", FL_AT);
}
scalar mu = 0.0;
for (std::size_t i = 0; i < _terms.size(); ++i) {
mu = _aggregation->compute(mu, _terms.at(i).membership(x));
}
return mu;
}
Complexity Aggregated::complexityOfActivationDegree() const {
Complexity result;
result.comparison(2);
if (_aggregation.get()) {
result += _aggregation->complexity();
} else result.arithmetic(1);
result.multiply(scalar(_terms.size()));
return result;
}
scalar Aggregated::activationDegree(const Term* forTerm) const {
scalar result = 0.0;
for (std::size_t i = 0; i < _terms.size(); ++i) {
const Activated& activatedTerm = _terms.at(i);
if (activatedTerm.getTerm() == forTerm) {
if (_aggregation.get())
result = _aggregation->compute(result, activatedTerm.getDegree());
else
result += activatedTerm.getDegree(); //Default for WeightDefuzzifier
}
}
return result;
}
const Activated* Aggregated::highestActivatedTerm() const {
const Activated* maximumTerm = fl::null;
scalar maximumActivation = -fl::inf;
for (std::size_t i = 0; i < _terms.size(); ++i) {
const Activated& activated = _terms.at(i);
if (Op::isGt(activated.getDegree(), maximumActivation)) {
maximumActivation = activated.getDegree();
maximumTerm = &activated;
}
}
return maximumTerm;
}
std::string Aggregated::parameters() const {
FllExporter exporter;
std::ostringstream ss;
ss << exporter.toString(getAggregation());
ss << " " << Op::str(getMinimum()) << " " << Op::str(getMaximum()) << " ";
for (std::size_t i = 0; i < terms().size(); ++i) {
ss << " " << exporter.toString(&terms().at(i));
}
return ss.str();
}
void Aggregated::configure(const std::string& parameters) {
FL_IUNUSED(parameters);
}
Aggregated* Aggregated::clone() const {
return new Aggregated(*this);
}
std::string Aggregated::toString() const {
std::vector<std::string> aggregate;
for (std::size_t i = 0; i < terms().size(); ++i) {
aggregate.push_back(terms().at(i).toString());
}
FllExporter exporter;
std::ostringstream ss;
if (getAggregation()) {
ss << getName() << ": " << className() << " "
<< exporter.toString(getAggregation()) << "["
<< Op::join(aggregate, ",") << "]";
} else {
ss << getName() << ": " << className() << " " << "["
<< Op::join(aggregate, "+") << "]"; //\u2295: (+)
}
return ss.str();
}
void Aggregated::setMinimum(scalar minimum) {
this->_minimum = minimum;
}
scalar Aggregated::getMinimum() const {
return this->_minimum;
}
void Aggregated::setMaximum(scalar maximum) {
this->_maximum = maximum;
}
scalar Aggregated::getMaximum() const {
return this->_maximum;
}
void Aggregated::setRange(scalar minimum, scalar maximum) {
setMinimum(minimum);
setMaximum(maximum);
}
scalar Aggregated::range() const {
return getMaximum() - getMinimum();
}
void Aggregated::setAggregation(SNorm* aggregation) {
this->_aggregation.reset(aggregation);
}
SNorm* Aggregated::getAggregation() const {
return this->_aggregation.get();
}
/**
* Operations for std::vector _terms
*/
void Aggregated::addTerm(const Term* term, scalar degree, const TNorm* implication) {
_terms.push_back(Activated(term, degree, implication));
FL_DBG("Aggregating " << _terms.back().toString());
}
void Aggregated::addTerm(const Activated& term) {
_terms.push_back(term);
FL_DBG("Aggregating " << _terms.back().toString());
}
const Activated& Aggregated::removeTerm(std::size_t index) {
const Activated& term = _terms.at(index);
_terms.erase(_terms.begin() + index);
return term;
}
void Aggregated::clear() {
_terms.clear();
}
const Activated& Aggregated::getTerm(std::size_t index) const {
return _terms.at(index);
}
void Aggregated::setTerms(const std::vector<Activated>& terms) {
this->_terms = terms;
}
const std::vector<Activated>& Aggregated::terms() const {
return this->_terms;
}
std::vector<Activated>& Aggregated::terms() {
return this->_terms;
}
std::size_t Aggregated::numberOfTerms() const {
return _terms.size();
}
bool Aggregated::isEmpty() const {
return _terms.empty();
}
}
|
