Free cookie consent management tool by TermsFeed Policy Generator

source: stable/HeuristicLab.Problems.DataAnalysis.Symbolic.Classification/3.4/SingleObjective/SymbolicClassificationSingleObjectiveProblem.cs @ 11044

Last change on this file since 11044 was 9456, checked in by swagner, 11 years ago

Updated copyright year and added some missing license headers (#1889)

File size: 7.4 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2013 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
21using System.Linq;
22using HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Parameters;
25using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
26
27namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Classification {
28  [Item("Symbolic Classification Problem (single objective)", "Represents a single objective symbolic classfication problem.")]
29  [StorableClass]
30  [Creatable("Problems")]
31  public class SymbolicClassificationSingleObjectiveProblem : SymbolicDataAnalysisSingleObjectiveProblem<IClassificationProblemData, ISymbolicClassificationSingleObjectiveEvaluator, ISymbolicDataAnalysisSolutionCreator>, IClassificationProblem {
32    private const double PunishmentFactor = 10;
33    private const int InitialMaximumTreeDepth = 8;
34    private const int InitialMaximumTreeLength = 25;
35    private const string EstimationLimitsParameterName = "EstimationLimits";
36    private const string EstimationLimitsParameterDescription = "The lower and upper limit for the estimated value that can be returned by the symbolic classification model.";
37    private const string ModelCreatorParameterName = "ModelCreator";
38
39    #region parameter properties
40    public IFixedValueParameter<DoubleLimit> EstimationLimitsParameter {
41      get { return (IFixedValueParameter<DoubleLimit>)Parameters[EstimationLimitsParameterName]; }
42    }
43    public IValueParameter<ISymbolicClassificationModelCreator> ModelCreatorParameter {
44      get { return (IValueParameter<ISymbolicClassificationModelCreator>)Parameters[ModelCreatorParameterName]; }
45    }
46    #endregion
47    #region properties
48    public DoubleLimit EstimationLimits {
49      get { return EstimationLimitsParameter.Value; }
50    }
51    public ISymbolicClassificationModelCreator ModelCreator {
52      get { return ModelCreatorParameter.Value; }
53    }
54    #endregion
55    [StorableConstructor]
56    protected SymbolicClassificationSingleObjectiveProblem(bool deserializing) : base(deserializing) { }
57    protected SymbolicClassificationSingleObjectiveProblem(SymbolicClassificationSingleObjectiveProblem original, Cloner cloner)
58      : base(original, cloner) {
59      RegisterEventHandlers();
60    }
61    public override IDeepCloneable Clone(Cloner cloner) { return new SymbolicClassificationSingleObjectiveProblem(this, cloner); }
62
63    public SymbolicClassificationSingleObjectiveProblem()
64      : base(new ClassificationProblemData(), new SymbolicClassificationSingleObjectiveMeanSquaredErrorEvaluator(), new SymbolicDataAnalysisExpressionTreeCreator()) {
65      Parameters.Add(new FixedValueParameter<DoubleLimit>(EstimationLimitsParameterName, EstimationLimitsParameterDescription));
66      Parameters.Add(new ValueParameter<ISymbolicClassificationModelCreator>(ModelCreatorParameterName, "", new AccuracyMaximizingThresholdsModelCreator()));
67
68      ApplyLinearScalingParameter.Value.Value = false;
69      EstimationLimitsParameter.Hidden = true;
70
71      MaximumSymbolicExpressionTreeDepth.Value = InitialMaximumTreeDepth;
72      MaximumSymbolicExpressionTreeLength.Value = InitialMaximumTreeLength;
73
74      RegisterEventHandlers();
75      ConfigureGrammarSymbols();
76      InitializeOperators();
77      UpdateEstimationLimits();
78    }
79
80    [StorableHook(HookType.AfterDeserialization)]
81    private void AfterDeserialization() {
82      // BackwardsCompatibility3.4
83      #region Backwards compatible code, remove with 3.5
84      if (!Parameters.ContainsKey(ModelCreatorParameterName))
85        Parameters.Add(new ValueParameter<ISymbolicClassificationModelCreator>(ModelCreatorParameterName, "", new AccuracyMaximizingThresholdsModelCreator()));
86
87      bool changed = false;
88      if (!Operators.OfType<SymbolicClassificationSingleObjectiveTrainingParetoBestSolutionAnalyzer>().Any()) {
89        Operators.Add(new SymbolicClassificationSingleObjectiveTrainingParetoBestSolutionAnalyzer());
90        changed = true;
91      }
92      if (!Operators.OfType<SymbolicClassificationSingleObjectiveValidationParetoBestSolutionAnalyzer>().Any()) {
93        Operators.Add(new SymbolicClassificationSingleObjectiveValidationParetoBestSolutionAnalyzer());
94        changed = true;
95      }
96      if (changed) ParameterizeOperators();
97      #endregion
98      RegisterEventHandlers();
99    }
100
101    private void RegisterEventHandlers() {
102      SymbolicExpressionTreeGrammarParameter.ValueChanged += (o, e) => ConfigureGrammarSymbols();
103      ModelCreatorParameter.NameChanged += (o, e) => ParameterizeOperators();
104    }
105
106    private void ConfigureGrammarSymbols() {
107      var grammar = SymbolicExpressionTreeGrammar as TypeCoherentExpressionGrammar;
108      if (grammar != null) grammar.ConfigureAsDefaultClassificationGrammar();
109    }
110
111    private void InitializeOperators() {
112      Operators.Add(new SymbolicClassificationSingleObjectiveTrainingBestSolutionAnalyzer());
113      Operators.Add(new SymbolicClassificationSingleObjectiveValidationBestSolutionAnalyzer());
114      Operators.Add(new SymbolicClassificationSingleObjectiveOverfittingAnalyzer());
115      Operators.Add(new SymbolicClassificationSingleObjectiveTrainingParetoBestSolutionAnalyzer());
116      Operators.Add(new SymbolicClassificationSingleObjectiveValidationParetoBestSolutionAnalyzer());
117      ParameterizeOperators();
118    }
119
120    private void UpdateEstimationLimits() {
121      if (ProblemData.TrainingIndices.Any()) {
122        var targetValues = ProblemData.Dataset.GetDoubleValues(ProblemData.TargetVariable, ProblemData.TrainingIndices).ToList();
123        var mean = targetValues.Average();
124        var range = targetValues.Max() - targetValues.Min();
125        EstimationLimits.Upper = mean + PunishmentFactor * range;
126        EstimationLimits.Lower = mean - PunishmentFactor * range;
127      } else {
128        EstimationLimits.Upper = double.MaxValue;
129        EstimationLimits.Lower = double.MinValue;
130      }
131    }
132
133    protected override void OnProblemDataChanged() {
134      base.OnProblemDataChanged();
135      UpdateEstimationLimits();
136    }
137
138    protected override void ParameterizeOperators() {
139      base.ParameterizeOperators();
140      if (Parameters.ContainsKey(EstimationLimitsParameterName)) {
141        var operators = Parameters.OfType<IValueParameter>().Select(p => p.Value).OfType<IOperator>().Union(Operators);
142        foreach (var op in operators.OfType<ISymbolicDataAnalysisBoundedOperator>())
143          op.EstimationLimitsParameter.ActualName = EstimationLimitsParameter.Name;
144        foreach (var op in operators.OfType<ISymbolicClassificationModelCreatorOperator>())
145          op.ModelCreatorParameter.ActualName = ModelCreatorParameter.Name;
146      }
147    }
148  }
149}
Note: See TracBrowser for help on using the repository browser.