[3915] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17181] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[3915] | 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;
|
---|
[6256] | 23 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
[15406] | 24 | using HeuristicLab.MainForm;
|
---|
[5699] | 25 | using HeuristicLab.Problems.DataAnalysis.Symbolic.Views;
|
---|
[3915] | 26 |
|
---|
[5699] | 27 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Regression.Views {
|
---|
| 28 | public partial class InteractiveSymbolicRegressionSolutionSimplifierView : InteractiveSymbolicDataAnalysisSolutionSimplifierView {
|
---|
[5717] | 29 | public new SymbolicRegressionSolution Content {
|
---|
| 30 | get { return (SymbolicRegressionSolution)base.Content; }
|
---|
| 31 | set { base.Content = value; }
|
---|
| 32 | }
|
---|
| 33 |
|
---|
[5699] | 34 | public InteractiveSymbolicRegressionSolutionSimplifierView()
|
---|
[15406] | 35 | : base(new SymbolicRegressionSolutionImpactValuesCalculator()) {
|
---|
[5699] | 36 | InitializeComponent();
|
---|
| 37 | this.Caption = "Interactive Regression Solution Simplifier";
|
---|
[3915] | 38 | }
|
---|
| 39 |
|
---|
[17499] | 40 | protected override void SetEnabledStateOfControls() {
|
---|
| 41 | base.SetEnabledStateOfControls();
|
---|
| 42 |
|
---|
| 43 | var tree = Content?.Model?.SymbolicExpressionTree;
|
---|
| 44 | btnOptimizeConstants.Enabled = tree != null && SymbolicRegressionConstantOptimizationEvaluator.CanOptimizeConstants(tree);
|
---|
| 45 | }
|
---|
| 46 |
|
---|
[5717] | 47 | protected override void UpdateModel(ISymbolicExpressionTree tree) {
|
---|
[14027] | 48 | var model = new SymbolicRegressionModel(Content.ProblemData.TargetVariable, tree, Content.Model.Interpreter, Content.Model.LowerEstimationLimit, Content.Model.UpperEstimationLimit);
|
---|
[8972] | 49 | model.Scale(Content.ProblemData);
|
---|
[5818] | 50 | Content.Model = model;
|
---|
[3915] | 51 | }
|
---|
| 52 |
|
---|
[15406] | 53 | protected override ISymbolicExpressionTree OptimizeConstants(ISymbolicExpressionTree tree, IProgress progress) {
|
---|
| 54 | const int constOptIterations = 50;
|
---|
[17500] | 55 | const int maxRepetitions = 100;
|
---|
| 56 | const double minimumImprovement = 1e-10;
|
---|
[15406] | 57 | var regressionProblemData = Content.ProblemData;
|
---|
[8664] | 58 | var model = Content.Model;
|
---|
[17057] | 59 | progress.CanBeStopped = true;
|
---|
[17500] | 60 | double prevResult = 0.0, improvement = 0.0;
|
---|
[17057] | 61 | var result = 0.0;
|
---|
| 62 | int reps = 0;
|
---|
| 63 |
|
---|
| 64 | do {
|
---|
| 65 | prevResult = result;
|
---|
| 66 | result = SymbolicRegressionConstantOptimizationEvaluator.OptimizeConstants(model.Interpreter, tree, regressionProblemData, regressionProblemData.TrainingIndices,
|
---|
| 67 | applyLinearScaling: true, maxIterations: constOptIterations, updateVariableWeights: true, lowerEstimationLimit: model.LowerEstimationLimit, upperEstimationLimit: model.UpperEstimationLimit,
|
---|
| 68 | iterationCallback: (args, func, obj) => {
|
---|
[17500] | 69 | double newProgressValue = progress.ProgressValue + (1.0 / (constOptIterations + 2) / maxRepetitions); // (constOptIterations + 2) iterations are reported
|
---|
[17057] | 70 | progress.ProgressValue = Math.Min(newProgressValue, 1.0);
|
---|
| 71 | });
|
---|
| 72 | reps++;
|
---|
[17500] | 73 | improvement = result - prevResult;
|
---|
| 74 | } while (improvement > minimumImprovement && reps < maxRepetitions &&
|
---|
[17057] | 75 | progress.ProgressState != ProgressState.StopRequested &&
|
---|
| 76 | progress.ProgressState != ProgressState.CancelRequested);
|
---|
[15406] | 77 | return tree;
|
---|
[6256] | 78 | }
|
---|
[3915] | 79 | }
|
---|
| 80 | }
|
---|