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
|
// Copyright (C) 2002 Ronan Collobert (collober@iro.umontreal.ca)
//
//
// This file is part of Torch. Release II.
// [The Ultimate Machine Learning Library]
//
// Torch 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.
//
// Torch 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 Torch; if not, write to the Free Software
// Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
#include "MultiClassFormat.h"
namespace Torch {
extern "C" int multiClassTriMelanie(const void *a, const void *b)
{
real *ar = (real *)a;
real *br = (real *)b;
if(*ar < *br)
return -1;
else
return 1;
}
MultiClassFormat::MultiClassFormat(DataSet *data)
{
tabclasses = NULL;
if(data->n_targets != 1)
warning("MultiClassFormat: the data has %d ouputs", data->n_targets);
int n_set = 0;
for(int i = 0; i < data->n_examples; i++)
{
data->setExample(i);
bool flag = false;
for(int k = 0; k < n_set; k++)
{
if(((real *)data->targets)[0] == tabclasses[k])
flag = true;
}
if(!flag)
{
tabclasses = (real *)xrealloc(tabclasses, sizeof(real)*(n_set+1));
tabclasses[n_set++] = ((real *)data->targets)[0];
}
}
switch(n_set)
{
case 0:
error("MultiClassFormat: you have no examples");
break;
case 1:
warning("MultiClassFormat: you have only one class [%g]", tabclasses[0]);
break;
default:
message("MultiClassFormat: %d classes detected", n_set);
break;
}
// He He He...
n_classes = n_set;
qsort(tabclasses, n_classes, sizeof(real), multiClassTriMelanie);
class_labels = (real **)xalloc(sizeof(real *)*n_classes);
for(int i = 0; i < n_classes; i++)
class_labels[i] = tabclasses+i;
}
MultiClassFormat::MultiClassFormat(int n_classes_, real *class_labels_)
{
n_classes = n_classes_;
tabclasses = (real *)xalloc(sizeof(real)*n_classes);
if(class_labels_)
{
for(int i = 0; i < n_classes; i++)
tabclasses[i] = class_labels_[i];
}
else
{
for(int i = 0; i < n_classes; i++)
tabclasses[i] = (real)i;
}
class_labels = (real **)xalloc(sizeof(real *)*n_classes);
for(int i = 0; i < n_classes; i++)
class_labels[i] = tabclasses+i;
}
int MultiClassFormat::getOutputSize()
{
return 1;
}
void MultiClassFormat::fromOneHot(List *outputs, List *one_hot_outputs)
{
real *out = (real*)outputs->ptr;
real max = -INF;
int index = -1;
int j = 0;
while (one_hot_outputs) {
real *one = (real*)one_hot_outputs->ptr;
for (int i=0;i<one_hot_outputs->n;i++,j++,one++) {
if (*one > max) {
max = *one;
index = j;
}
}
one_hot_outputs = one_hot_outputs->next;
}
*out = (real)index;
}
void MultiClassFormat::toOneHot(List *outputs, List *one_hot_outputs)
{
real out = *(real*)outputs->ptr;
// heuristic: find the one or two labels that are closer to "out" and
// attribute them the difference between out and their label. put 0 for
// all the other values
// first initialize one_hot_outputs with all zeros
List* one_hot = one_hot_outputs;
while (one_hot) {
real *one = (real*)one_hot->ptr;
for (int i=0;i<one_hot->n;i++) {
*one++ = 0.;
}
one_hot = one_hot->next;
}
// then there are 3 different cases
one_hot = one_hot_outputs;
if (out > n_classes-1) {
real diff = fabs(out - tabclasses[n_classes-1]);
int j = 0;
while (one_hot && j != n_classes-1) {
real *one = (real*)one_hot->ptr;
for (int i=0;i<one_hot->n;i++,j++,one++) {
if (j==n_classes-1) {
*one = diff;
break;
}
}
one_hot = one_hot->next;
}
} else if (out < 0) {
real diff = fabs(out - tabclasses[0]);
real *one = (real*)one_hot->ptr;
*one = diff;
} else {
int before = (int)floor(out);
int after = (int)ceil(out);
// the scores are reversed so the max score is given to the neirest
real diff_before = after - out;
real diff_after = out - before;
if (before == after) {
diff_before = diff_after = 1.;
}
int j = 0;
while (one_hot && j <= after) {
real *one = (real*)one_hot->ptr;
for (int i=0;i<one_hot->n;i++,j++,one++) {
if (j==before)
*one = diff_before;
if (j==after) {
*one = diff_after;
break;
}
}
one_hot = one_hot->next;
}
}
}
int MultiClassFormat::getTargetClass(void *target)
{
real out = *((real *)target);
real dist = fabs(out - tabclasses[0]);
int index = 0;
for(int i = 1; i < n_classes; i++)
{
real z = fabs(out - tabclasses[i]);
if(z < dist)
{
index = i;
dist = z;
}
}
return(index);
}
int MultiClassFormat::getOutputClass(List *outputs)
{
real out = *((real *)outputs->ptr);
real dist = fabs(out - tabclasses[0]);
int index = 0;
for(int i = 1; i < n_classes; i++)
{
real z = fabs(out - tabclasses[i]);
if(z < dist)
{
index = i;
dist = z;
}
}
return(index);
}
MultiClassFormat::~MultiClassFormat()
{
free(tabclasses);
free(class_labels);
}
}
|