Free cookie consent management tool by TermsFeed Policy Generator

source: branches/GP-MoveOperators/HeuristicLab.Problems.DataAnalysis.Symbolic.Regression/3.4/ReplaceBranchMoveMaker.cs @ 8292

Last change on this file since 8292 was 8292, checked in by gkronber, 10 years ago

#1847: worked on move operators. version of the final EMSS submission

File size: 6.3 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2012 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
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Operators;
27using HeuristicLab.Optimization;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Regression {
32  [Item("ReplaceBranchMoveMaker", "")]
33  [StorableClass]
34  public class ReplaceBranchMoveMaker : SingleSuccessorOperator, ISymbolicExpressionTreeMoveOperator, IMoveMaker {
35    public override bool CanChangeName {
36      get { return false; }
37    }
38    public ILookupParameter<DoubleValue> QualityParameter {
39      get { return (ILookupParameter<DoubleValue>)Parameters["Quality"]; }
40    }
41    public ILookupParameter<DoubleValue> MoveQualityParameter {
42      get { return (ILookupParameter<DoubleValue>)Parameters["MoveQuality"]; }
43    }
44    public ILookupParameter<ReplaceBranchMove> ReplaceBranchMoveParameter {
45      get { return (ILookupParameter<ReplaceBranchMove>)Parameters["ReplaceBranchMove"]; }
46    }
47    public ILookupParameter<ISymbolicExpressionTree> SymbolicExpressionTreeParameter {
48      get { return (ILookupParameter<ISymbolicExpressionTree>)Parameters["SymbolicExpressionTree"]; }
49    }
50    public ILookupParameter<ItemList<ISymbolicExpressionTree>> FragmentsParameter {
51      get { return (ILookupParameter<ItemList<ISymbolicExpressionTree>>)Parameters["Fragments"]; }
52    }
53    public ILookupParameter<ItemList<DoubleArray>> FragmentOutputsParameter {
54      get { return (ILookupParameter<ItemList<DoubleArray>>)Parameters["FragmentOutputs"]; }
55    }
56
57    [StorableConstructor]
58    protected ReplaceBranchMoveMaker(bool deserializing) : base(deserializing) { }
59    protected ReplaceBranchMoveMaker(ReplaceBranchMoveMaker original, Cloner cloner) : base(original, cloner) { }
60    public ReplaceBranchMoveMaker()
61      : base() {
62      Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality of the solution."));
63      Parameters.Add(new LookupParameter<ReplaceBranchMove>("ReplaceBranchMove", "The move to evaluate."));
64      Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The relative quality of the move."));
65      Parameters.Add(new LookupParameter<ISymbolicExpressionTree>("SymbolicExpressionTree", "The symbolic expression tree on which the move should be applied."));
66      Parameters.Add(new LookupParameter<ItemList<ISymbolicExpressionTree>>("Fragments"));
67      Parameters.Add(new LookupParameter<ItemList<DoubleArray>>("FragmentOutputs"));
68    }
69
70    public override IDeepCloneable Clone(Cloner cloner) {
71      return new ReplaceBranchMoveMaker(this, cloner);
72    }
73
74    public override IOperation Apply() {
75      var fragments = FragmentsParameter.ActualValue;
76      var fragmentOutputs = FragmentOutputsParameter.ActualValue;
77
78      var move = ReplaceBranchMoveParameter.ActualValue;
79      DoubleValue moveQuality = MoveQualityParameter.ActualValue;
80      DoubleValue quality = QualityParameter.ActualValue;
81
82      var newNode = (ISymbolicExpressionTreeNode)move.NewBranch.Clone();
83      var oldBranch = move.Parent.GetSubtree(move.SubtreeIndex);
84
85      move.Parent.RemoveSubtree(move.SubtreeIndex);
86      move.Parent.InsertSubtree(move.SubtreeIndex, Scale(newNode, move.Alpha, move.Beta));
87
88      // move oldBranch into pool
89      var fragmentStart = fragments[move.FragmentIndex].Root.GetSubtree(0);
90      fragmentStart.RemoveSubtree(0);
91      fragmentStart.AddSubtree(oldBranch);
92      fragmentOutputs[move.FragmentIndex] = new DoubleArray(move.NewOutput);
93      quality.Value = moveQuality.Value;
94      // update solution
95      SymbolicExpressionTreeParameter.ActualValue = move.Tree;
96
97      return base.Apply();
98    }
99
100
101    private Addition add = new Addition();
102    private Multiplication mul = new Multiplication();
103    private Constant constant = new Constant();
104
105    private ISymbolicExpressionTreeNode Scale(ISymbolicExpressionTreeNode node, double alpha, double beta) {
106      var constNode = node as ConstantTreeNode;
107      if (constNode != null) {
108        constNode.Value = constNode.Value * beta + alpha;
109        return constNode;
110      }
111      var varNode = node as VariableTreeNode;
112      if (varNode != null) {
113        varNode.Weight = varNode.Weight * beta;
114        var constAlpha = (ConstantTreeNode)constant.CreateTreeNode();
115        constAlpha.Value = alpha;
116        var sum = add.CreateTreeNode();
117        sum.AddSubtree(varNode); sum.AddSubtree(constAlpha);
118        return sum;
119      }
120      if (node.Symbol is Addition && node.GetSubtree(0).Symbol is Multiplication &&
121        node.GetSubtree(1).Symbol is Constant && node.GetSubtree(0).GetSubtree(1).Symbol is Constant) {
122        var constAlpha = node.GetSubtree(1) as ConstantTreeNode;
123        var constBeta = node.GetSubtree(0).GetSubtree(1) as ConstantTreeNode;
124        constAlpha.Value = beta * constAlpha.Value + alpha;
125        constBeta.Value = constBeta.Value * beta;
126        return node;
127      } else {
128        var constAlpha = (ConstantTreeNode)constant.CreateTreeNode();
129        var constBeta = (ConstantTreeNode)constant.CreateTreeNode();
130        constAlpha.Value = alpha;
131        constBeta.Value = beta;
132        var sum = add.CreateTreeNode();
133        var prod = mul.CreateTreeNode();
134        prod.AddSubtree(node);
135        prod.AddSubtree(constBeta);
136        sum.AddSubtree(prod);
137        sum.AddSubtree(constAlpha);
138        return sum;
139      }
140    }
141  }
142}
Note: See TracBrowser for help on using the repository browser.