[7832] | 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 |
|
---|
| 22 | using HeuristicLab.Common;
|
---|
| 23 | using HeuristicLab.Core;
|
---|
| 24 | using HeuristicLab.Data;
|
---|
[8206] | 25 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
[7832] | 26 | using HeuristicLab.Operators;
|
---|
| 27 | using HeuristicLab.Optimization;
|
---|
| 28 | using HeuristicLab.Parameters;
|
---|
| 29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 30 |
|
---|
[8206] | 31 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Regression {
|
---|
[7832] | 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 |
|
---|
| 51 | [StorableConstructor]
|
---|
| 52 | protected ReplaceBranchMoveMaker(bool deserializing) : base(deserializing) { }
|
---|
| 53 | protected ReplaceBranchMoveMaker(ReplaceBranchMoveMaker original, Cloner cloner) : base(original, cloner) { }
|
---|
| 54 | public ReplaceBranchMoveMaker()
|
---|
| 55 | : base() {
|
---|
| 56 | Parameters.Add(new LookupParameter<DoubleValue>("Quality", "The quality of the solution."));
|
---|
| 57 | Parameters.Add(new LookupParameter<ReplaceBranchMove>("ReplaceBranchMove", "The move to evaluate."));
|
---|
| 58 | Parameters.Add(new LookupParameter<DoubleValue>("MoveQuality", "The relative quality of the move."));
|
---|
| 59 | Parameters.Add(new LookupParameter<ISymbolicExpressionTree>("SymbolicExpressionTree", "The symbolic expression tree on which the move should be applied."));
|
---|
| 60 | }
|
---|
| 61 |
|
---|
| 62 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
| 63 | return new ReplaceBranchMoveMaker(this, cloner);
|
---|
| 64 | }
|
---|
| 65 |
|
---|
| 66 | public override IOperation Apply() {
|
---|
| 67 | var move = ReplaceBranchMoveParameter.ActualValue;
|
---|
| 68 | DoubleValue moveQuality = MoveQualityParameter.ActualValue;
|
---|
| 69 | DoubleValue quality = QualityParameter.ActualValue;
|
---|
| 70 |
|
---|
| 71 | var newNode = (ISymbolicExpressionTreeNode)move.NewBranch.Clone();
|
---|
| 72 | move.Parent.RemoveSubtree(move.SubtreeIndex);
|
---|
[8206] | 73 | move.Parent.InsertSubtree(move.SubtreeIndex, Scale(newNode, move.Alpha, move.Beta));
|
---|
[7832] | 74 |
|
---|
| 75 | quality.Value = moveQuality.Value;
|
---|
| 76 |
|
---|
| 77 | return base.Apply();
|
---|
| 78 | }
|
---|
[8206] | 79 |
|
---|
| 80 |
|
---|
| 81 | private Addition add = new Addition();
|
---|
| 82 | private Multiplication mul = new Multiplication();
|
---|
| 83 | private Constant constant = new Constant();
|
---|
| 84 |
|
---|
| 85 | private ISymbolicExpressionTreeNode Scale(ISymbolicExpressionTreeNode node, double alpha, double beta) {
|
---|
| 86 | var constAlpha = (ConstantTreeNode)constant.CreateTreeNode();
|
---|
| 87 | var constBeta = (ConstantTreeNode)constant.CreateTreeNode();
|
---|
| 88 | constAlpha.Value = alpha;
|
---|
| 89 | constBeta.Value = beta;
|
---|
| 90 | var sum = add.CreateTreeNode();
|
---|
| 91 | var prod = mul.CreateTreeNode();
|
---|
| 92 | prod.AddSubtree(node); prod.AddSubtree(constBeta);
|
---|
| 93 | sum.AddSubtree(prod); sum.AddSubtree(constAlpha);
|
---|
| 94 | return sum;
|
---|
| 95 | }
|
---|
[7832] | 96 | }
|
---|
| 97 | }
|
---|