Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/SymbolicDataAnalysisExpressionPruningOperator.cs @ 12720

Last change on this file since 12720 was 12720, checked in by bburlacu, 9 years ago

#2359: Changed the impact calculators so that the quality value necessary for impacts calculation is calculated with a separate method. Refactored the CalculateImpactAndReplacementValues method to return the new quality in an out-parameter (adjusted method signature in interface accordingly). Added Evaluate method to the regression and classification pruning operators that re-evaluates the tree using the problem evaluator after pruning was performed.

File size: 10.7 KB
RevLine 
[10368]1#region License Information
2
3/* HeuristicLab
[12012]4 * Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[10368]5 *
6 * This file is part of HeuristicLab.
7 *
8 * HeuristicLab is free software: you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation, either version 3 of the License, or
11 * (at your option) any later version.
12 *
13 * HeuristicLab is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
16 * GNU General Public License for more details.
17 *
18 * You should have received a copy of the GNU General Public License
19 * along with HeuristicLab. If not, see <http://www.gnu.org/licenses/>.
20 */
21
22#endregion
23
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Core;
27using HeuristicLab.Data;
28using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
29using HeuristicLab.Operators;
30using HeuristicLab.Parameters;
31using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
32
33namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
34  [StorableClass]
35  [Item("SymbolicExpressionTreePruningOperator", "An operator that replaces introns with constant values in a symbolic expression tree.")]
[12358]36  public abstract class SymbolicDataAnalysisExpressionPruningOperator : SingleSuccessorOperator, ISymbolicExpressionTreeOperator {
[10469]37    #region parameter names
38    private const string ProblemDataParameterName = "ProblemData";
39    private const string SymbolicDataAnalysisModelParameterName = "SymbolicDataAnalysisModel";
40    private const string ImpactValuesCalculatorParameterName = "ImpactValuesCalculator";
41    private const string PrunedSubtreesParameterName = "PrunedSubtrees";
42    private const string PrunedTreesParameterName = "PrunedTrees";
[12361]43    private const string PrunedNodesParameterName = "PrunedNodes";
[10469]44    private const string FitnessCalculationPartitionParameterName = "FitnessCalculationPartition";
45    private const string NodeImpactThresholdParameterName = "ImpactThreshold";
46    private const string PruneOnlyZeroImpactNodesParameterName = "PruneOnlyZeroImpactNodes";
47    private const string SymbolicExpressionTreeParameterName = "SymbolicExpressionTree"; // the tree to be pruned
48    private const string QualityParameterName = "Quality"; // the quality
49    private const string EstimationLimitsParameterName = "EstimationLimits";
50    private const string InterpreterParameterName = "SymbolicExpressionTreeInterpreter";
[12720]51    private const string ApplyLinearScalingParameterName = "ApplyLinearScaling";
[10469]52    #endregion
53
[10368]54    #region parameter properties
[10469]55    public ILookupParameter<ISymbolicExpressionTree> SymbolicExpressionTreeParameter {
56      get { return (ILookupParameter<ISymbolicExpressionTree>)Parameters[SymbolicExpressionTreeParameterName]; }
[10368]57    }
[10469]58    public ILookupParameter<DoubleValue> QualityParameter {
59      get { return (ILookupParameter<DoubleValue>)Parameters[QualityParameterName]; }
[10368]60    }
[10469]61    public ILookupParameter<IDataAnalysisProblemData> ProblemDataParameter {
62      get { return (ILookupParameter<IDataAnalysisProblemData>)Parameters[ProblemDataParameterName]; }
63    }
64    public IValueParameter<ISymbolicDataAnalysisSolutionImpactValuesCalculator> ImpactValuesCalculatorParameter {
65      get { return (IValueParameter<ISymbolicDataAnalysisSolutionImpactValuesCalculator>)Parameters[ImpactValuesCalculatorParameterName]; }
66    }
67    public ILookupParameter<IntRange> FitnessCalculationPartitionParameter {
68      get { return (ILookupParameter<IntRange>)Parameters[FitnessCalculationPartitionParameterName]; }
69    }
70    public ILookupParameter<IntValue> PrunedSubtreesParameter {
71      get { return (ILookupParameter<IntValue>)Parameters[PrunedSubtreesParameterName]; }
72    }
73    public ILookupParameter<IntValue> PrunedTreesParameter {
74      get { return (ILookupParameter<IntValue>)Parameters[PrunedTreesParameterName]; }
75    }
[12361]76    public ILookupParameter<IntValue> PrunedNodesParameter {
77      get { return (ILookupParameter<IntValue>)Parameters[PrunedNodesParameterName]; }
78    }
[10469]79    public IFixedValueParameter<DoubleValue> NodeImpactThresholdParameter {
80      get { return (IFixedValueParameter<DoubleValue>)Parameters[NodeImpactThresholdParameterName]; }
81    }
82    public IFixedValueParameter<BoolValue> PruneOnlyZeroImpactNodesParameter {
83      get { return (IFixedValueParameter<BoolValue>)Parameters[PruneOnlyZeroImpactNodesParameterName]; }
84    }
85    public ILookupParameter<DoubleLimit> EstimationLimitsParameter {
86      get { return (ILookupParameter<DoubleLimit>)Parameters[EstimationLimitsParameterName]; }
87    }
88    public ILookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter> InterpreterParameter {
89      get { return (ILookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter>)Parameters[InterpreterParameterName]; }
90    }
[12720]91    public ILookupParameter<BoolValue> ApplyLinearScalingParameter {
92      get { return (ILookupParameter<BoolValue>)Parameters[ApplyLinearScalingParameterName]; }
93    }
[10368]94    #endregion
[11025]95
[10368]96    #region properties
[12358]97    public ISymbolicDataAnalysisSolutionImpactValuesCalculator ImpactValuesCalculator {
98      get { return ImpactValuesCalculatorParameter.Value; }
99      set { ImpactValuesCalculatorParameter.Value = value; }
100    }
101    public bool PruneOnlyZeroImpactNodes {
[11025]102      get { return PruneOnlyZeroImpactNodesParameter.Value.Value; }
103      set { PruneOnlyZeroImpactNodesParameter.Value.Value = value; }
104    }
[12358]105    public double NodeImpactThreshold {
[11025]106      get { return NodeImpactThresholdParameter.Value.Value; }
107      set { NodeImpactThresholdParameter.Value.Value = value; }
108    }
[10368]109    #endregion
[10417]110
111    [StorableConstructor]
112    protected SymbolicDataAnalysisExpressionPruningOperator(bool deserializing) : base(deserializing) { }
113    protected SymbolicDataAnalysisExpressionPruningOperator(SymbolicDataAnalysisExpressionPruningOperator original, Cloner cloner)
[10469]114      : base(original, cloner) { }
[10368]115
[12189]116    protected SymbolicDataAnalysisExpressionPruningOperator(ISymbolicDataAnalysisSolutionImpactValuesCalculator impactValuesCalculator) {
[10469]117      #region add parameters
118      Parameters.Add(new LookupParameter<IDataAnalysisProblemData>(ProblemDataParameterName));
119      Parameters.Add(new LookupParameter<ISymbolicDataAnalysisModel>(SymbolicDataAnalysisModelParameterName));
120      Parameters.Add(new LookupParameter<IntRange>(FitnessCalculationPartitionParameterName));
[12361]121      Parameters.Add(new LookupParameter<IntValue>(PrunedNodesParameterName, "A counter of how many nodes were pruned."));
[10469]122      Parameters.Add(new LookupParameter<IntValue>(PrunedSubtreesParameterName, "A counter of how many subtrees were replaced."));
123      Parameters.Add(new LookupParameter<IntValue>(PrunedTreesParameterName, "A counter of how many trees were pruned."));
124      Parameters.Add(new FixedValueParameter<BoolValue>(PruneOnlyZeroImpactNodesParameterName, "Specify whether or not only zero impact nodes should be pruned."));
125      Parameters.Add(new FixedValueParameter<DoubleValue>(NodeImpactThresholdParameterName, "Specifies an impact value threshold below which nodes should be pruned."));
126      Parameters.Add(new LookupParameter<DoubleLimit>(EstimationLimitsParameterName));
127      Parameters.Add(new LookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter>(InterpreterParameterName));
128      Parameters.Add(new LookupParameter<ISymbolicExpressionTree>(SymbolicExpressionTreeParameterName));
129      Parameters.Add(new LookupParameter<DoubleValue>(QualityParameterName));
[12720]130      Parameters.Add(new LookupParameter<BoolValue>(ApplyLinearScalingParameterName));
[12189]131      Parameters.Add(new ValueParameter<ISymbolicDataAnalysisSolutionImpactValuesCalculator>(ImpactValuesCalculatorParameterName, impactValuesCalculator));
[10469]132      #endregion
[10368]133    }
[11025]134
[12189]135    protected abstract ISymbolicDataAnalysisModel CreateModel(ISymbolicExpressionTree tree, ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, IDataAnalysisProblemData problemData, DoubleLimit estimationLimits);
[11025]136
137    protected abstract double Evaluate(IDataAnalysisModel model);
138
[10469]139    public override IOperation Apply() {
[12358]140      var tree = SymbolicExpressionTreeParameter.ActualValue;
141      var problemData = ProblemDataParameter.ActualValue;
142      var fitnessCalculationPartition = FitnessCalculationPartitionParameter.ActualValue;
143      var estimationLimits = EstimationLimitsParameter.ActualValue;
144      var interpreter = InterpreterParameter.ActualValue;
145
146      var model = CreateModel(tree, interpreter, problemData, estimationLimits);
147      var nodes = tree.Root.GetSubtree(0).GetSubtree(0).IterateNodesPrefix().ToList();
[12720]148      var rows = Enumerable.Range(fitnessCalculationPartition.Start, fitnessCalculationPartition.Size).ToList();
[10469]149      var prunedSubtrees = 0;
150      var prunedTrees = 0;
[12361]151      var prunedNodes = 0;
[10414]152
[12720]153      double qualityForImpactsCalculation = double.NaN;
[10368]154
[10469]155      for (int i = 0; i < nodes.Count; ++i) {
156        var node = nodes[i];
[10368]157        if (node is ConstantTreeNode) continue;
158
[10469]159        double impactValue, replacementValue;
[12720]160        double newQualityForImpacts;
161        ImpactValuesCalculator.CalculateImpactAndReplacementValues(model, node, problemData, rows, out impactValue, out replacementValue, out newQualityForImpacts, qualityForImpactsCalculation);
[10368]162
[12358]163        if (PruneOnlyZeroImpactNodes && !impactValue.IsAlmost(0.0)) continue;
164        if (!PruneOnlyZeroImpactNodes && impactValue > NodeImpactThreshold) continue;
[10368]165
[11025]166        var constantNode = (ConstantTreeNode)node.Grammar.GetSymbol("Constant").CreateTreeNode();
167        constantNode.Value = replacementValue;
168
[12361]169        var length = node.GetLength();
[10368]170        ReplaceWithConstant(node, constantNode);
[12361]171        i += length - 1; // skip subtrees under the node that was folded
[10368]172
173        prunedSubtrees++;
[12361]174        prunedNodes += length;
[12720]175
176        qualityForImpactsCalculation = newQualityForImpacts;
[10368]177      }
178
[10469]179      if (prunedSubtrees > 0) prunedTrees = 1;
180      PrunedSubtreesParameter.ActualValue = new IntValue(prunedSubtrees);
181      PrunedTreesParameter.ActualValue = new IntValue(prunedTrees);
[12361]182      PrunedNodesParameter.ActualValue = new IntValue(prunedNodes);
[10469]183
[12720]184      if (prunedSubtrees > 0) // if nothing was pruned then there's no need to re-evaluate the tree
185        QualityParameter.ActualValue.Value = Evaluate(model);
186
[10368]187      return base.Apply();
188    }
[11025]189
[12189]190    protected static void ReplaceWithConstant(ISymbolicExpressionTreeNode original, ISymbolicExpressionTreeNode replacement) {
[10368]191      var parent = original.Parent;
192      var i = parent.IndexOfSubtree(original);
193      parent.RemoveSubtree(i);
194      parent.InsertSubtree(i, replacement);
195    }
196  }
197}
Note: See TracBrowser for help on using the repository browser.