1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2010 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.Linq;
|
---|
23 | using HeuristicLab.Analysis;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
27 | using HeuristicLab.Optimization;
|
---|
28 | using HeuristicLab.Parameters;
|
---|
29 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
30 | using HeuristicLab.Problems.DataAnalysis.Symbolic;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Problems.DataAnalysis.Regression.Symbolic.Analyzers {
|
---|
33 | [Item("BestSymbolicRegressionSolutionAnalyzer", "An operator for analyzing the best solution of symbolic regression problems given in symbolic expression tree encoding.")]
|
---|
34 | [StorableClass]
|
---|
35 | public sealed class BestSymbolicRegressionSolutionAnalyzer : RegressionSolutionAnalyzer, ISymbolicRegressionAnalyzer {
|
---|
36 | private const string SymbolicExpressionTreeParameterName = "SymbolicExpressionTree";
|
---|
37 | private const string SymbolicExpressionTreeInterpreterParameterName = "SymbolicExpressionTreeInterpreter";
|
---|
38 | private const string BestSolutionInputvariableCountResultName = "Variables used by best solution";
|
---|
39 | private const string VariableFrequenciesParameterName = "VariableFrequencies";
|
---|
40 | private const string VariableImpactsResultName = "Integrated variable frequencies";
|
---|
41 | private const string BestSolutionParameterName = "BestSolution";
|
---|
42 | private const string BestSolutionComplexity = "Best solution complexity";
|
---|
43 |
|
---|
44 | #region parameter properties
|
---|
45 | public ScopeTreeLookupParameter<SymbolicExpressionTree> SymbolicExpressionTreeParameter {
|
---|
46 | get { return (ScopeTreeLookupParameter<SymbolicExpressionTree>)Parameters[SymbolicExpressionTreeParameterName]; }
|
---|
47 | }
|
---|
48 | public IValueLookupParameter<ISymbolicExpressionTreeInterpreter> SymbolicExpressionTreeInterpreterParameter {
|
---|
49 | get { return (IValueLookupParameter<ISymbolicExpressionTreeInterpreter>)Parameters[SymbolicExpressionTreeInterpreterParameterName]; }
|
---|
50 | }
|
---|
51 | public ILookupParameter<SymbolicRegressionSolution> BestSolutionParameter {
|
---|
52 | get { return (ILookupParameter<SymbolicRegressionSolution>)Parameters[BestSolutionParameterName]; }
|
---|
53 | }
|
---|
54 | public ILookupParameter<DataTable> VariableFrequenciesParameter {
|
---|
55 | get { return (ILookupParameter<DataTable>)Parameters[VariableFrequenciesParameterName]; }
|
---|
56 | }
|
---|
57 | #endregion
|
---|
58 | #region properties
|
---|
59 | public ISymbolicExpressionTreeInterpreter SymbolicExpressionTreeInterpreter {
|
---|
60 | get { return SymbolicExpressionTreeInterpreterParameter.ActualValue; }
|
---|
61 | }
|
---|
62 | public ItemArray<SymbolicExpressionTree> SymbolicExpressionTree {
|
---|
63 | get { return SymbolicExpressionTreeParameter.ActualValue; }
|
---|
64 | }
|
---|
65 | public DataTable VariableFrequencies {
|
---|
66 | get { return VariableFrequenciesParameter.ActualValue; }
|
---|
67 | }
|
---|
68 | #endregion
|
---|
69 |
|
---|
70 | public BestSymbolicRegressionSolutionAnalyzer()
|
---|
71 | : base() {
|
---|
72 | Parameters.Add(new ScopeTreeLookupParameter<SymbolicExpressionTree>(SymbolicExpressionTreeParameterName, "The symbolic expression trees to analyze."));
|
---|
73 | Parameters.Add(new ValueLookupParameter<ISymbolicExpressionTreeInterpreter>(SymbolicExpressionTreeInterpreterParameterName, "The interpreter that should be used for the analysis of symbolic expression trees."));
|
---|
74 | Parameters.Add(new LookupParameter<DataTable>(VariableFrequenciesParameterName, "The variable frequencies table to use for the calculation of variable impacts"));
|
---|
75 | Parameters.Add(new LookupParameter<SymbolicRegressionSolution>(BestSolutionParameterName, "The best symbolic regression solution."));
|
---|
76 | }
|
---|
77 |
|
---|
78 | [StorableHook(HookType.AfterDeserialization)]
|
---|
79 | private void Initialize() {
|
---|
80 | if (!Parameters.ContainsKey(VariableFrequenciesParameterName)) {
|
---|
81 | Parameters.Add(new LookupParameter<DataTable>(VariableFrequenciesParameterName, "The variable frequencies table to use for the calculation of variable impacts"));
|
---|
82 | }
|
---|
83 | }
|
---|
84 |
|
---|
85 | protected override DataAnalysisSolution UpdateBestSolution() {
|
---|
86 | double upperEstimationLimit = UpperEstimationLimit != null ? UpperEstimationLimit.Value : double.PositiveInfinity;
|
---|
87 | double lowerEstimationLimit = LowerEstimationLimit != null ? LowerEstimationLimit.Value : double.NegativeInfinity;
|
---|
88 |
|
---|
89 | int i = Quality.Select((x, index) => new { index, x.Value }).OrderBy(x => x.Value).First().index;
|
---|
90 |
|
---|
91 | if (BestSolutionQualityParameter.ActualValue == null || BestSolutionQualityParameter.ActualValue.Value > Quality[i].Value) {
|
---|
92 | var model = new SymbolicRegressionModel((ISymbolicExpressionTreeInterpreter)SymbolicExpressionTreeInterpreter.Clone(),
|
---|
93 | SymbolicExpressionTree[i]);
|
---|
94 | var solution = new SymbolicRegressionSolution((DataAnalysisProblemData)ProblemData.Clone(), model, lowerEstimationLimit, upperEstimationLimit);
|
---|
95 | solution.Name = BestSolutionParameterName;
|
---|
96 | solution.Description = "Best solution on validation partition found over the whole run.";
|
---|
97 | BestSolutionParameter.ActualValue = solution;
|
---|
98 | BestSolutionQualityParameter.ActualValue = Quality[i];
|
---|
99 | BestSymbolicRegressionSolutionAnalyzer.UpdateSymbolicRegressionBestSolutionResults(solution, ProblemData, Results, VariableFrequencies);
|
---|
100 | }
|
---|
101 | return BestSolutionParameter.ActualValue;
|
---|
102 | }
|
---|
103 |
|
---|
104 | public static void UpdateBestSolutionResults(SymbolicRegressionSolution bestSolution, DataAnalysisProblemData problemData, ResultCollection results, IntValue currentGeneration, DataTable variableFrequencies) {
|
---|
105 | RegressionSolutionAnalyzer.UpdateBestSolutionResults(bestSolution, problemData, results, currentGeneration);
|
---|
106 | UpdateSymbolicRegressionBestSolutionResults(bestSolution, problemData, results, variableFrequencies);
|
---|
107 | }
|
---|
108 |
|
---|
109 | private static void UpdateSymbolicRegressionBestSolutionResults(SymbolicRegressionSolution bestSolution, DataAnalysisProblemData problemData, ResultCollection results, DataTable variableFrequencies) {
|
---|
110 | if (results.ContainsKey(BestSolutionInputvariableCountResultName)) {
|
---|
111 | results[BestSolutionInputvariableCountResultName].Value = new IntValue(bestSolution.Model.InputVariables.Count());
|
---|
112 | results[VariableImpactsResultName].Value = CalculateVariableImpacts(variableFrequencies);
|
---|
113 | var sizeTable = (DataTable)results[BestSolutionComplexity].Value;
|
---|
114 | sizeTable.Rows["Best solution size"].Values.Add(bestSolution.Model.SymbolicExpressionTree.Size);
|
---|
115 | sizeTable.Rows["Best solution height"].Values.Add(bestSolution.Model.SymbolicExpressionTree.Height);
|
---|
116 | sizeTable.Rows["Best solution variables"].Values.Add(bestSolution.Model.InputVariables.Count());
|
---|
117 | } else {
|
---|
118 | results.Add(new Result(BestSolutionInputvariableCountResultName, new IntValue(bestSolution.Model.InputVariables.Count())));
|
---|
119 | results.Add(new Result(VariableImpactsResultName, CalculateVariableImpacts(variableFrequencies)));
|
---|
120 | var sizeTable = new DataTable("Best solution complexity");
|
---|
121 | sizeTable.Rows.Add(new DataRow("Best solution size"));
|
---|
122 | sizeTable.Rows.Add(new DataRow("Best solution height"));
|
---|
123 | sizeTable.Rows.Add(new DataRow("Best solution variables"));
|
---|
124 | sizeTable.Rows["Best solution size"].Values.Add(bestSolution.Model.SymbolicExpressionTree.Size);
|
---|
125 | sizeTable.Rows["Best solution height"].Values.Add(bestSolution.Model.SymbolicExpressionTree.Height);
|
---|
126 | sizeTable.Rows["Best solution variables"].Values.Add(bestSolution.Model.InputVariables.Count());
|
---|
127 | results.Add(new Result(BestSolutionComplexity, sizeTable));
|
---|
128 | }
|
---|
129 | }
|
---|
130 |
|
---|
131 |
|
---|
132 | private static DoubleMatrix CalculateVariableImpacts(DataTable variableFrequencies) {
|
---|
133 | if (variableFrequencies != null) {
|
---|
134 | var impacts = new DoubleMatrix(variableFrequencies.Rows.Count, 1, new string[] { "Impact" }, variableFrequencies.Rows.Select(x => x.Name));
|
---|
135 | impacts.SortableView = true;
|
---|
136 | int rowIndex = 0;
|
---|
137 | foreach (var dataRow in variableFrequencies.Rows) {
|
---|
138 | string variableName = dataRow.Name;
|
---|
139 | impacts[rowIndex++, 0] = dataRow.Values.Average();
|
---|
140 | }
|
---|
141 | return impacts;
|
---|
142 | } else return new DoubleMatrix(1, 1);
|
---|
143 | }
|
---|
144 | }
|
---|
145 | }
|
---|