1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2008 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
4 | *
|
---|
5 | * This file is part of HeuristicLab.
|
---|
6 | *
|
---|
7 | * HeuristicLab is free software: you can redistribute it and/or modify
|
---|
8 | * it under the terms of the GNU General Public License as published by
|
---|
9 | * the Free Software Foundation, either version 3 of the License, or
|
---|
10 | * (at your option) any later version.
|
---|
11 | *
|
---|
12 | * HeuristicLab is distributed in the hope that it will be useful,
|
---|
13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of
|
---|
14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
---|
15 | * GNU General Public License for more details.
|
---|
16 | *
|
---|
17 | * You should have received a copy of the GNU General Public License
|
---|
18 | * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
|
---|
19 | */
|
---|
20 | #endregion
|
---|
21 |
|
---|
22 | using System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using System.Text;
|
---|
26 | using HeuristicLab.DataAnalysis;
|
---|
27 | using HeuristicLab.Core;
|
---|
28 | using System.Xml;
|
---|
29 | using System.Diagnostics;
|
---|
30 | using HeuristicLab.Data;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.GP.Boolean {
|
---|
33 | internal class BooleanTreeInterpreter {
|
---|
34 | private const double EPSILON = 0.00001;
|
---|
35 | private Dataset dataset;
|
---|
36 | private List<LightWeightFunction> expression;
|
---|
37 | private int targetVariable;
|
---|
38 | private int currentRow;
|
---|
39 | private int pc;
|
---|
40 |
|
---|
41 | public void Reset(Dataset dataset, BakedFunctionTree tree, int targetVariable) {
|
---|
42 | this.dataset = dataset;
|
---|
43 | this.expression = tree.LinearRepresentation;
|
---|
44 | this.targetVariable = targetVariable;
|
---|
45 | }
|
---|
46 |
|
---|
47 | internal int GetNumberOfErrors(int start, int end) {
|
---|
48 | int errors = 0;
|
---|
49 | for (int i = start; i < end; i++) {
|
---|
50 | pc = 0;
|
---|
51 | currentRow = i;
|
---|
52 | int result = Step() ? 1 : 0;
|
---|
53 | if (Math.Abs(result - dataset.GetValue(i, targetVariable)) > EPSILON) errors++;
|
---|
54 | }
|
---|
55 | return errors;
|
---|
56 | }
|
---|
57 |
|
---|
58 | internal bool Step() {
|
---|
59 | LightWeightFunction curFun = expression[pc++];
|
---|
60 | int symbol = SymbolTable.MapFunction(curFun.functionType);
|
---|
61 | switch (symbol) {
|
---|
62 | case SymbolTable.AND: return Step() & Step();
|
---|
63 | case SymbolTable.OR: return Step() | Step();
|
---|
64 | case SymbolTable.NOT: return !Step();
|
---|
65 | case SymbolTable.XOR: return Step() ^ Step();
|
---|
66 | case SymbolTable.NAND: return !(Step() & Step());
|
---|
67 | case SymbolTable.NOR: return !(Step() | Step());
|
---|
68 | case SymbolTable.VARIABLE:
|
---|
69 | return dataset.GetValue(currentRow, (int)curFun.data[0]) != 0.0;
|
---|
70 | case SymbolTable.UNKNOWN:
|
---|
71 | default:
|
---|
72 | throw new InvalidOperationException(curFun.functionType.ToString());
|
---|
73 |
|
---|
74 | }
|
---|
75 | }
|
---|
76 | }
|
---|
77 | }
|
---|