Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.DataAnalysis/3.3/Symbolic/FullFunctionalExpressionGrammar.cs @ 6675

Last change on this file since 6675 was 5467, checked in by gkronber, 14 years ago

#1325: Merged r5060 from branch into trunk.

File size: 5.1 KB
RevLine 
[3841]1#region License Information
2/* HeuristicLab
[5445]3 * Copyright (C) 2002-2011 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[3841]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
22using System.Collections.Generic;
[4722]23using HeuristicLab.Common;
[3841]24using HeuristicLab.Core;
[4068]25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding.Symbols;
[3841]27using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
28using HeuristicLab.Problems.DataAnalysis.Symbolic.Symbols;
29namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
30  [StorableClass]
31  [Item("FullFunctionalExpressionGrammar", "Represents a grammar for functional expressions using all available functions.")]
32  public class FullFunctionalExpressionGrammar : DefaultSymbolicExpressionGrammar {
[4722]33    [StorableConstructor]
34    protected FullFunctionalExpressionGrammar(bool deserializing) : base(deserializing) { }
35    protected FullFunctionalExpressionGrammar(FullFunctionalExpressionGrammar original, Cloner cloner) : base(original, cloner) { }
[3841]36    public FullFunctionalExpressionGrammar()
37      : base() {
38      Initialize();
39    }
40
[4722]41    public override IDeepCloneable Clone(Cloner cloner) {
42      return new FullFunctionalExpressionGrammar(this, cloner);
43    }
44
[3841]45    private void Initialize() {
46      var add = new Addition();
47      var sub = new Subtraction();
48      var mul = new Multiplication();
49      var div = new Division();
50      var mean = new Average();
51      var sin = new Sine();
52      var cos = new Cosine();
53      var tan = new Tangent();
54      var log = new Logarithm();
[5288]55      var pow = new Power();
[5384]56      pow.InitialFrequency = 0.0;
57      var root = new Root();
58      root.InitialFrequency = 0.0;
[3841]59      var exp = new Exponential();
60      var @if = new IfThenElse();
61      var gt = new GreaterThan();
62      var lt = new LessThan();
63      var and = new And();
64      var or = new Or();
65      var not = new Not();
[5373]66
67      var timeLag = new TimeLag();
68      timeLag.InitialFrequency = 0.0;
69      var integral = new Integral();
70      integral.InitialFrequency = 0.0;
71      var derivative = new Derivative();
72      derivative.InitialFrequency = 0.0;
73
[5467]74      var variableCondition = new VariableCondition();
75      variableCondition.InitialFrequency = 0.0;
76
[3841]77      var constant = new Constant();
78      constant.MinValue = -20;
79      constant.MaxValue = 20;
[4249]80      var variableSymbol = new HeuristicLab.Problems.DataAnalysis.Symbolic.Symbols.Variable();
81      var laggedVariable = new LaggedVariable();
82      laggedVariable.InitialFrequency = 0.0;
[3841]83
[5467]84      var allSymbols = new List<Symbol>() { add, sub, mul, div, mean, sin, cos, tan, log, pow, root, exp, @if, gt, lt, and, or, not, timeLag, integral, derivative, constant, variableSymbol, laggedVariable, variableCondition };
[5373]85      var unaryFunctionSymbols = new List<Symbol>() { sin, cos, tan, log, exp, not, timeLag, integral, derivative };
86
[5467]87      var binaryFunctionSymbols = new List<Symbol>() { pow, root, gt, lt, variableCondition };
[3993]88      var functionSymbols = new List<Symbol>() { add, sub, mul, div, mean, and, or };
[4249]89      var terminalSymbols = new List<Symbol>() { variableSymbol, constant, laggedVariable };
[3841]90
91      foreach (var symb in allSymbols)
92        AddSymbol(symb);
93
94      foreach (var funSymb in functionSymbols) {
95        SetMinSubtreeCount(funSymb, 1);
96        SetMaxSubtreeCount(funSymb, 3);
97      }
98      foreach (var funSymb in unaryFunctionSymbols) {
99        SetMinSubtreeCount(funSymb, 1);
100        SetMaxSubtreeCount(funSymb, 1);
101      }
102      foreach (var funSymb in binaryFunctionSymbols) {
103        SetMinSubtreeCount(funSymb, 2);
104        SetMaxSubtreeCount(funSymb, 2);
105      }
106
[4249]107      foreach (var terminalSymbol in terminalSymbols) {
108        SetMinSubtreeCount(terminalSymbol, 0);
109        SetMaxSubtreeCount(terminalSymbol, 0);
110      }
111
[3841]112      SetMinSubtreeCount(@if, 3);
113      SetMaxSubtreeCount(@if, 3);
114
[4249]115
[3841]116      // allow each symbol as child of the start symbol
117      foreach (var symb in allSymbols) {
118        SetAllowedChild(StartSymbol, symb, 0);
119      }
120
121      // allow each symbol as child of every other symbol (except for terminals that have maxSubtreeCount == 0)
122      foreach (var parent in allSymbols) {
123        for (int i = 0; i < GetMaxSubtreeCount(parent); i++)
124          foreach (var child in allSymbols) {
125            SetAllowedChild(parent, child, i);
126          }
127      }
128    }
129  }
130}
Note: See TracBrowser for help on using the repository browser.