Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HiveHiveEngine/HeuristicLab.Problems.DataAnalysis.Symbolic.Classification/3.4/SingleObjective/SymbolicClassificationSingleObjectiveBoundedMeanSquaredErrorEvaluator.cs @ 10552

Last change on this file since 10552 was 7259, checked in by swagner, 13 years ago

Updated year of copyrights to 2012 (#1716)

File size: 5.2 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 System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Core;
27using HeuristicLab.Data;
28using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30
31namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Classification.SingleObjective {
32  [Item("Bounded Mean squared error Evaluator", "Calculates the bounded mean squared error of a symbolic classification solution (estimations above or below the class values are only penaltilized linearly.")]
33  [StorableClass]
34  public class SymbolicClassificationSingleObjectiveBoundedMeanSquaredErrorEvaluator : SymbolicClassificationSingleObjectiveEvaluator {
35    [StorableConstructor]
36    protected SymbolicClassificationSingleObjectiveBoundedMeanSquaredErrorEvaluator(bool deserializing) : base(deserializing) { }
37    protected SymbolicClassificationSingleObjectiveBoundedMeanSquaredErrorEvaluator(SymbolicClassificationSingleObjectiveBoundedMeanSquaredErrorEvaluator original, Cloner cloner) : base(original, cloner) { }
38    public override IDeepCloneable Clone(Cloner cloner) {
39      return new SymbolicClassificationSingleObjectiveBoundedMeanSquaredErrorEvaluator(this, cloner);
40    }
41
42    public SymbolicClassificationSingleObjectiveBoundedMeanSquaredErrorEvaluator() : base() { }
43
44    public override bool Maximization { get { return false; } }
45
46    public override IOperation Apply() {
47      IEnumerable<int> rows = GenerateRowsToEvaluate();
48      var solution = SymbolicExpressionTreeParameter.ActualValue;
49      double quality = Calculate(SymbolicDataAnalysisTreeInterpreterParameter.ActualValue, solution, EstimationLimitsParameter.ActualValue.Lower, EstimationLimitsParameter.ActualValue.Upper, ProblemDataParameter.ActualValue, rows);
50      QualityParameter.ActualValue = new DoubleValue(quality);
51      return base.Apply();
52    }
53
54    public static double Calculate(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, ISymbolicExpressionTree solution, double lowerEstimationLimit, double upperEstimationLimit, IClassificationProblemData problemData, IEnumerable<int> rows) {
55      IEnumerable<double> estimatedValues = interpreter.GetSymbolicExpressionTreeValues(solution, problemData.Dataset, rows);
56      IEnumerable<double> originalValues = problemData.Dataset.GetDoubleValues(problemData.TargetVariable, rows);
57      IEnumerable<double> boundedEstimationValues = estimatedValues.LimitToRange(lowerEstimationLimit, upperEstimationLimit);
58
59      double minClassValue = problemData.ClassValues.OrderBy(x => x).First();
60      double maxClassValue = problemData.ClassValues.OrderBy(x => x).Last();
61
62      IEnumerator<double> originalEnumerator = originalValues.GetEnumerator();
63      IEnumerator<double> estimatedEnumerator = estimatedValues.GetEnumerator();
64      double errorSum = 0.0;
65      int n = 0;
66
67      // always move forward both enumerators (do not use short-circuit evaluation!)
68      while (originalEnumerator.MoveNext() & estimatedEnumerator.MoveNext()) {
69        double estimated = estimatedEnumerator.Current;
70        double original = originalEnumerator.Current;
71        double error = estimated - original;
72
73        if (estimated < minClassValue || estimated > maxClassValue)
74          errorSum += Math.Abs(error);
75        else
76          errorSum += Math.Pow(error, 2);
77        n++;
78      }
79
80      // check if both enumerators are at the end to make sure both enumerations have the same length
81      if (estimatedEnumerator.MoveNext() || originalEnumerator.MoveNext()) {
82        throw new ArgumentException("Number of elements in first and second enumeration doesn't match.");
83      } else {
84        return errorSum / n;
85      }
86    }
87
88    public override double Evaluate(IExecutionContext context, ISymbolicExpressionTree tree, IClassificationProblemData problemData, IEnumerable<int> rows) {
89      SymbolicDataAnalysisTreeInterpreterParameter.ExecutionContext = context;
90      EstimationLimitsParameter.ExecutionContext = context;
91
92      double mse = Calculate(SymbolicDataAnalysisTreeInterpreterParameter.ActualValue, tree, EstimationLimitsParameter.ActualValue.Lower, EstimationLimitsParameter.ActualValue.Upper, problemData, rows);
93
94      SymbolicDataAnalysisTreeInterpreterParameter.ExecutionContext = null;
95      EstimationLimitsParameter.ExecutionContext = null;
96
97      return mse;
98    }
99  }
100}
Note: See TracBrowser for help on using the repository browser.