1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2016 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 System;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
28 | using HeuristicLab.Persistence;
|
---|
29 |
|
---|
30 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Regression {
|
---|
31 | [Item("Pearson R² & Tree Complexity Evaluator", "Calculates the Pearson R² and the tree complexity of a symbolic regression solution.")]
|
---|
32 | [StorableType("48c8b504-bae7-479a-bff9-f05d5f2d9664")]
|
---|
33 | public class PearsonRSquaredTreeComplexityEvaluator : SymbolicRegressionMultiObjectiveEvaluator {
|
---|
34 | [StorableConstructor]
|
---|
35 | protected PearsonRSquaredTreeComplexityEvaluator(StorableConstructorFlag deserializing) : base(deserializing) { }
|
---|
36 | protected PearsonRSquaredTreeComplexityEvaluator(PearsonRSquaredTreeComplexityEvaluator original, Cloner cloner)
|
---|
37 | : base(original, cloner) {
|
---|
38 | }
|
---|
39 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
40 | return new PearsonRSquaredTreeComplexityEvaluator(this, cloner);
|
---|
41 | }
|
---|
42 |
|
---|
43 | public PearsonRSquaredTreeComplexityEvaluator() : base() { }
|
---|
44 |
|
---|
45 | public override IEnumerable<bool> Maximization { get { return new bool[2] { true, false }; } } // maximize R² and minimize model complexity
|
---|
46 |
|
---|
47 | public override IOperation InstrumentedApply() {
|
---|
48 | IEnumerable<int> rows = GenerateRowsToEvaluate();
|
---|
49 | var solution = SymbolicExpressionTreeParameter.ActualValue;
|
---|
50 | var problemData = ProblemDataParameter.ActualValue;
|
---|
51 | var interpreter = SymbolicDataAnalysisTreeInterpreterParameter.ActualValue;
|
---|
52 | var estimationLimits = EstimationLimitsParameter.ActualValue;
|
---|
53 | var applyLinearScaling = ApplyLinearScalingParameter.ActualValue.Value;
|
---|
54 |
|
---|
55 | if (UseConstantOptimization) {
|
---|
56 | SymbolicRegressionConstantOptimizationEvaluator.OptimizeConstants(interpreter, solution, problemData, rows, applyLinearScaling, ConstantOptimizationIterations, updateVariableWeights: ConstantOptimizationUpdateVariableWeights, lowerEstimationLimit: estimationLimits.Lower, upperEstimationLimit: estimationLimits.Upper);
|
---|
57 | }
|
---|
58 | double[] qualities = Calculate(interpreter, solution, estimationLimits.Lower, estimationLimits.Upper, problemData, rows, applyLinearScaling, DecimalPlaces);
|
---|
59 | QualitiesParameter.ActualValue = new DoubleArray(qualities);
|
---|
60 | return base.InstrumentedApply();
|
---|
61 | }
|
---|
62 |
|
---|
63 | public static double[] Calculate(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, ISymbolicExpressionTree solution, double lowerEstimationLimit, double upperEstimationLimit, IRegressionProblemData problemData, IEnumerable<int> rows, bool applyLinearScaling, int decimalPlaces) {
|
---|
64 | double r2 = SymbolicRegressionSingleObjectivePearsonRSquaredEvaluator.Calculate(interpreter, solution, lowerEstimationLimit, upperEstimationLimit, problemData, rows, applyLinearScaling);
|
---|
65 | if (decimalPlaces >= 0)
|
---|
66 | r2 = Math.Round(r2, decimalPlaces);
|
---|
67 | return new double[2] { r2, SymbolicDataAnalysisModelComplexityCalculator.CalculateComplexity(solution) };
|
---|
68 | }
|
---|
69 |
|
---|
70 | public override double[] Evaluate(IExecutionContext context, ISymbolicExpressionTree tree, IRegressionProblemData problemData, IEnumerable<int> rows) {
|
---|
71 | SymbolicDataAnalysisTreeInterpreterParameter.ExecutionContext = context;
|
---|
72 | EstimationLimitsParameter.ExecutionContext = context;
|
---|
73 | ApplyLinearScalingParameter.ExecutionContext = context;
|
---|
74 | // DecimalPlaces parameter is a FixedValueParameter and doesn't need the context.
|
---|
75 |
|
---|
76 | double[] quality = Calculate(SymbolicDataAnalysisTreeInterpreterParameter.ActualValue, tree, EstimationLimitsParameter.ActualValue.Lower, EstimationLimitsParameter.ActualValue.Upper, problemData, rows, ApplyLinearScalingParameter.ActualValue.Value, DecimalPlaces);
|
---|
77 |
|
---|
78 | SymbolicDataAnalysisTreeInterpreterParameter.ExecutionContext = null;
|
---|
79 | EstimationLimitsParameter.ExecutionContext = null;
|
---|
80 | ApplyLinearScalingParameter.ExecutionContext = null;
|
---|
81 |
|
---|
82 | return quality;
|
---|
83 | }
|
---|
84 | }
|
---|
85 | }
|
---|