Free cookie consent management tool by TermsFeed Policy Generator

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

Last change on this file since 10675 was 10469, checked in by bburlacu, 11 years ago

#2143: Refactored pruning analyzer and operators as per review.

File size: 9.1 KB
RevLine 
[10368]1#region License Information
2
3/* HeuristicLab
4 * Copyright (C) 2002-2014 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
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.")]
[10469]36  public abstract class SymbolicDataAnalysisExpressionPruningOperator : SingleSuccessorOperator {
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";
43    private const string FitnessCalculationPartitionParameterName = "FitnessCalculationPartition";
44    private const string NodeImpactThresholdParameterName = "ImpactThreshold";
45    private const string PruneOnlyZeroImpactNodesParameterName = "PruneOnlyZeroImpactNodes";
46    private const string SymbolicExpressionTreeParameterName = "SymbolicExpressionTree"; // the tree to be pruned
47    private const string QualityParameterName = "Quality"; // the quality
48    private const string EstimationLimitsParameterName = "EstimationLimits";
49    private const string InterpreterParameterName = "SymbolicExpressionTreeInterpreter";
50    #endregion
51
[10368]52    #region parameter properties
[10469]53    public ILookupParameter<ISymbolicExpressionTree> SymbolicExpressionTreeParameter {
54      get { return (ILookupParameter<ISymbolicExpressionTree>)Parameters[SymbolicExpressionTreeParameterName]; }
[10368]55    }
[10469]56    public ILookupParameter<DoubleValue> QualityParameter {
57      get { return (ILookupParameter<DoubleValue>)Parameters[QualityParameterName]; }
[10368]58    }
[10469]59    public ILookupParameter<IDataAnalysisProblemData> ProblemDataParameter {
60      get { return (ILookupParameter<IDataAnalysisProblemData>)Parameters[ProblemDataParameterName]; }
61    }
62    public IValueParameter<ISymbolicDataAnalysisSolutionImpactValuesCalculator> ImpactValuesCalculatorParameter {
63      get { return (IValueParameter<ISymbolicDataAnalysisSolutionImpactValuesCalculator>)Parameters[ImpactValuesCalculatorParameterName]; }
64    }
65    public ILookupParameter<IntRange> FitnessCalculationPartitionParameter {
66      get { return (ILookupParameter<IntRange>)Parameters[FitnessCalculationPartitionParameterName]; }
67    }
68    public ILookupParameter<IntValue> PrunedSubtreesParameter {
69      get { return (ILookupParameter<IntValue>)Parameters[PrunedSubtreesParameterName]; }
70    }
71    public ILookupParameter<IntValue> PrunedTreesParameter {
72      get { return (ILookupParameter<IntValue>)Parameters[PrunedTreesParameterName]; }
73    }
74    public IFixedValueParameter<DoubleValue> NodeImpactThresholdParameter {
75      get { return (IFixedValueParameter<DoubleValue>)Parameters[NodeImpactThresholdParameterName]; }
76    }
77    public IFixedValueParameter<BoolValue> PruneOnlyZeroImpactNodesParameter {
78      get { return (IFixedValueParameter<BoolValue>)Parameters[PruneOnlyZeroImpactNodesParameterName]; }
79    }
80    public ILookupParameter<DoubleLimit> EstimationLimitsParameter {
81      get { return (ILookupParameter<DoubleLimit>)Parameters[EstimationLimitsParameterName]; }
82    }
83    public ILookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter> InterpreterParameter {
84      get { return (ILookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter>)Parameters[InterpreterParameterName]; }
85    }
[10368]86    #endregion
87    #region properties
[10469]88    protected IDataAnalysisProblemData ProblemData { get { return ProblemDataParameter.ActualValue; } }
89    protected ISymbolicDataAnalysisSolutionImpactValuesCalculator ImpactValuesCalculator { get { return ImpactValuesCalculatorParameter.Value; } }
90    protected IntRange FitnessCalculationPartition { get { return FitnessCalculationPartitionParameter.ActualValue; } }
91    protected BoolValue PruneOnlyZeroImpactNodes { get { return PruneOnlyZeroImpactNodesParameter.Value; } }
92    protected DoubleValue NodeImpactThreshold { get { return NodeImpactThresholdParameter.Value; } }
93    protected ISymbolicExpressionTree SymbolicExpressionTree { get { return SymbolicExpressionTreeParameter.ActualValue; } }
94    protected DoubleValue Quality { get { return QualityParameter.ActualValue; } }
95    protected DoubleLimit EstimationLimits { get { return EstimationLimitsParameter.ActualValue; } }
96    protected ISymbolicDataAnalysisExpressionTreeInterpreter Interpreter { get { return InterpreterParameter.ActualValue; } }
[10368]97    #endregion
[10417]98
99    [StorableConstructor]
100    protected SymbolicDataAnalysisExpressionPruningOperator(bool deserializing) : base(deserializing) { }
101    protected SymbolicDataAnalysisExpressionPruningOperator(SymbolicDataAnalysisExpressionPruningOperator original, Cloner cloner)
[10469]102      : base(original, cloner) { }
[10368]103
[10469]104    protected SymbolicDataAnalysisExpressionPruningOperator() {
105      #region add parameters
106      Parameters.Add(new LookupParameter<IDataAnalysisProblemData>(ProblemDataParameterName));
107      Parameters.Add(new LookupParameter<ISymbolicDataAnalysisModel>(SymbolicDataAnalysisModelParameterName));
108      Parameters.Add(new LookupParameter<IntRange>(FitnessCalculationPartitionParameterName));
109      Parameters.Add(new LookupParameter<IntValue>(PrunedSubtreesParameterName, "A counter of how many subtrees were replaced."));
110      Parameters.Add(new LookupParameter<IntValue>(PrunedTreesParameterName, "A counter of how many trees were pruned."));
111      Parameters.Add(new FixedValueParameter<BoolValue>(PruneOnlyZeroImpactNodesParameterName, "Specify whether or not only zero impact nodes should be pruned."));
112      Parameters.Add(new FixedValueParameter<DoubleValue>(NodeImpactThresholdParameterName, "Specifies an impact value threshold below which nodes should be pruned."));
113      Parameters.Add(new LookupParameter<DoubleLimit>(EstimationLimitsParameterName));
114      Parameters.Add(new LookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter>(InterpreterParameterName));
115      Parameters.Add(new LookupParameter<ISymbolicExpressionTree>(SymbolicExpressionTreeParameterName));
116      Parameters.Add(new LookupParameter<DoubleValue>(QualityParameterName));
117      #endregion
[10368]118    }
[10469]119    public override IOperation Apply() {
120      var model = CreateModel();
121      var nodes = SymbolicExpressionTree.Root.GetSubtree(0).GetSubtree(0).IterateNodesPrefix().ToList();
122      var rows = Enumerable.Range(FitnessCalculationPartition.Start, FitnessCalculationPartition.Size).ToList();
[10368]123
[10469]124      var prunedSubtrees = 0;
125      var prunedTrees = 0;
[10414]126
[10469]127      double quality = Evaluate(model);
[10368]128
[10469]129      for (int i = 0; i < nodes.Count; ++i) {
130        var node = nodes[i];
[10368]131        if (node is ConstantTreeNode) continue;
132
[10469]133        double impactValue, replacementValue;
134        ImpactValuesCalculator.CalculateImpactAndReplacementValues(model, node, ProblemData, rows, out impactValue, out replacementValue, quality);
[10368]135
[10469]136        if (PruneOnlyZeroImpactNodes.Value && (!impactValue.IsAlmost(0.0))) continue;
137        else if (NodeImpactThreshold.Value < impactValue) continue;
[10368]138
139        var constantNode = new ConstantTreeNode(new Constant()) { Value = replacementValue };
140        ReplaceWithConstant(node, constantNode);
[10469]141        i += node.GetLength() - 1; // skip subtrees under the node that was folded
[10368]142
[10469]143        quality -= impactValue;
144
[10368]145        prunedSubtrees++;
146      }
147
[10469]148      if (prunedSubtrees > 0) prunedTrees = 1;
149      PrunedSubtreesParameter.ActualValue = new IntValue(prunedSubtrees);
150      PrunedTreesParameter.ActualValue = new IntValue(prunedTrees);
151
[10368]152      return base.Apply();
153    }
154    private static void ReplaceWithConstant(ISymbolicExpressionTreeNode original, ISymbolicExpressionTreeNode replacement) {
155      var parent = original.Parent;
156      var i = parent.IndexOfSubtree(original);
157      parent.RemoveSubtree(i);
158      parent.InsertSubtree(i, replacement);
159    }
[10469]160    protected abstract ISymbolicDataAnalysisModel CreateModel();
161    protected abstract double Evaluate(IDataAnalysisModel model);
[10368]162  }
163}
Note: See TracBrowser for help on using the repository browser.