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
|
/* FFNet_ActivationList_Categories.cpp
*
* Copyright (C) 1997-2019 David Weenink
*
* This code is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or (at
* your option) any later version.
*
* This code is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this work. If not, see <http://www.gnu.org/licenses/>.
*/
/*
djmw 19960322
djmw 20020712 GPL header
djmw 20040416 Better error messages
djmw 20071014 Melder_error<n>
*/
#include "FFNet_ActivationList_Categories.h"
static integer winnerTakesAll (FFNet me, constVEC activation) {
integer pos = 1;
double max = activation [1];
for (integer i = 2; i <= my numberOfOutputs; i ++)
if (activation [i] > max)
max = activation [pos = i];
return pos;
}
static integer stochastic (FFNet me, constVEC activation) {
double range = 0.0, lower = 0.0;
integer i;
for (i = 1; i <= my numberOfOutputs; i ++)
range += activation [i];
const double number = NUMrandomUniform (0.0, range);
for (i = 1; i <= my numberOfOutputs; i ++) {
lower += activation [i];
if (number < lower)
break;
}
return i;
}
autoCategories FFNet_ActivationList_to_Categories (FFNet me, ActivationList activation, int labeling) {
try {
integer (*labelingFunction) (FFNet me, constVEC act);
Melder_require (my outputCategories,
U"No Categories (has the FFNet been trained yet?).");
Melder_require (my numberOfOutputs == activation -> nx,
U"Number of columns and number of outputs should be equal.");
autoCategories thee = Categories_create ();
labelingFunction = labeling == 2 ? stochastic : winnerTakesAll;
for (integer i = 1; i <= activation->ny; i ++) {
const integer index = labelingFunction (me, activation -> z.row (i));
autoSimpleString item = Data_copy (my outputCategories->at [index]);
thy addItem_move (item.move());
}
return thee;
} catch (MelderError) {
Melder_throw (me, U": no Categories created.");
}
}
autoActivationList FFNet_Categories_to_ActivationList (FFNet me, Categories thee) {
try {
autoCategories uniq = Categories_selectUniqueItems (thee);
Melder_require (my outputCategories,
U"The FFNet does not have categories.");
Melder_require (OrderedOfString_containSameElements (uniq.get(), my outputCategories.get()),
U"The Categories should match the categories of the FFNet.");
autoActivationList him = ActivationList_create (thy size, my numberOfOutputs);
for (integer i = 1; i <= thy size; i ++) {
const SimpleString category = thy at [i];
const integer pos = OrderedOfString_indexOfItem (my outputCategories.get(), category -> string.get());
Melder_require (pos > 0,
U"The FFNet doesn't know the category ", category -> string.get(), U".");
his z [i] [pos] = 1.0;
}
return him;
} catch (MelderError) {
Melder_throw (me, U": no ActivationList created.");
}
}
/* End of file FFNet_ActivationList_Categories.cpp */
|
