Free cookie consent management tool by TermsFeed Policy Generator

source: branches/HeuristicLab.TimeSeries/HeuristicLab.Problems.DataAnalysis.Symbolic.Classification/3.4/SymbolicClassificationSolution.cs @ 7481

Last change on this file since 7481 was 7268, checked in by gkronber, 13 years ago

#1081: merged r7214:7266 from trunk into time series branch.

File size: 3.4 KB
RevLine 
[5624]1#region License Information
2/* HeuristicLab
[7268]3 * Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
[5624]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 HeuristicLab.Common;
23using HeuristicLab.Core;
24using HeuristicLab.Data;
[6411]25using HeuristicLab.Optimization;
[5624]26using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
27
28namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Classification {
29  /// <summary>
30  /// Represents a symbolic classification solution (model + data) and attributes of the solution like accuracy and complexity
31  /// </summary>
32  [StorableClass]
33  [Item(Name = "SymbolicClassificationSolution", Description = "Represents a symbolic classification solution (model + data) and attributes of the solution like accuracy and complexity.")]
[5717]34  public sealed class SymbolicClassificationSolution : ClassificationSolution, ISymbolicClassificationSolution {
[5736]35    private const string ModelLengthResultName = "ModelLength";
36    private const string ModelDepthResultName = "ModelDepth";
[5624]37
38    public new ISymbolicClassificationModel Model {
39      get { return (ISymbolicClassificationModel)base.Model; }
[5717]40      set { base.Model = value; }
[5624]41    }
42
43    ISymbolicDataAnalysisModel ISymbolicDataAnalysisSolution.Model {
44      get { return (ISymbolicDataAnalysisModel)base.Model; }
45    }
[5736]46    public int ModelLength {
47      get { return ((IntValue)this[ModelLengthResultName].Value).Value; }
48      private set { ((IntValue)this[ModelLengthResultName].Value).Value = value; }
49    }
[5624]50
[5736]51    public int ModelDepth {
52      get { return ((IntValue)this[ModelDepthResultName].Value).Value; }
53      private set { ((IntValue)this[ModelDepthResultName].Value).Value = value; }
54    }
55
[5624]56    [StorableConstructor]
[5717]57    private SymbolicClassificationSolution(bool deserializing) : base(deserializing) { }
58    private SymbolicClassificationSolution(SymbolicClassificationSolution original, Cloner cloner)
[5624]59      : base(original, cloner) {
60    }
61    public SymbolicClassificationSolution(ISymbolicClassificationModel model, IClassificationProblemData problemData)
62      : base(model, problemData) {
[5736]63      Add(new Result(ModelLengthResultName, "Length of the symbolic classification model.", new IntValue()));
64      Add(new Result(ModelDepthResultName, "Depth of the symbolic classification model.", new IntValue()));
[6589]65      RecalculateResults();
[5624]66    }
67
68    public override IDeepCloneable Clone(Cloner cloner) {
69      return new SymbolicClassificationSolution(this, cloner);
70    }
[5736]71
[6411]72    protected override void RecalculateResults() {
[5736]73      ModelLength = Model.SymbolicExpressionTree.Length;
74      ModelDepth = Model.SymbolicExpressionTree.Depth;
[6589]75      CalculateResults();
[5736]76    }
[5624]77  }
78}
Note: See TracBrowser for help on using the repository browser.