Free cookie consent management tool by TermsFeed Policy Generator

source: branches/2817-BinPackingSpeedup/HeuristicLab.Problems.DataAnalysis.Symbolic.Classification.Views/3.4/InteractiveSymbolicClassificationSolutionSimplifierViewBase.cs @ 15630

Last change on this file since 15630 was 14826, checked in by gkronber, 8 years ago

#2650: merged the factors branch into trunk

File size: 3.6 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
27using HeuristicLab.Problems.DataAnalysis.Symbolic.Views;
28
29namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Classification.Views {
30  public abstract partial class InteractiveSymbolicClassificationSolutionSimplifierViewBase : InteractiveSymbolicDataAnalysisSolutionSimplifierView {
31    private readonly SymbolicClassificationSolutionImpactValuesCalculator calculator;
32
33    public new ISymbolicClassificationSolution Content {
34      get { return (ISymbolicClassificationSolution)base.Content; }
35      set { base.Content = value; }
36    }
37
38    public InteractiveSymbolicClassificationSolutionSimplifierViewBase()
39      : base() {
40      InitializeComponent();
41      this.Caption = "Interactive Classification Solution Simplifier";
42
43      calculator = new SymbolicClassificationSolutionImpactValuesCalculator();
44    }
45
46    /// <summary>
47    /// It is necessary to create new models of an unknown type with new trees in the simplifier.
48    /// For this purpose the cloner is used by registering the new tree as already cloned object and invoking the clone mechanism.
49    /// This results in a new model of the same type as the old one with an exchanged tree.
50    /// </summary>
51    /// <param name="tree">The new tree that should be included in the new object</param>
52    /// <returns></returns>
53    protected ISymbolicClassificationModel CreateModel(ISymbolicExpressionTree tree) {
54      var cloner = new Cloner();
55      cloner.RegisterClonedObject(Content.Model.SymbolicExpressionTree, tree);
56
57      var model = (ISymbolicClassificationModel)Content.Model.Clone(cloner);
58      model.RecalculateModelParameters(Content.ProblemData, Content.ProblemData.TrainingIndices);
59      return model;
60    }
61
62    protected override Dictionary<ISymbolicExpressionTreeNode, Tuple<double, double>> CalculateImpactAndReplacementValues(ISymbolicExpressionTree tree) {
63      var impactAndReplacementValues = new Dictionary<ISymbolicExpressionTreeNode, Tuple<double, double>>();
64      foreach (var node in tree.Root.GetSubtree(0).GetSubtree(0).IterateNodesPrefix()) {
65        double impactValue, replacementValue, newQualityForImpactsCalculation;
66        calculator.CalculateImpactAndReplacementValues(Content.Model, node, Content.ProblemData, Content.ProblemData.TrainingIndices, out impactValue, out replacementValue, out newQualityForImpactsCalculation);
67        impactAndReplacementValues.Add(node, new Tuple<double, double>(impactValue, replacementValue));
68      }
69      return impactAndReplacementValues;
70    }
71
72    protected override void btnOptimizeConstants_Click(object sender, EventArgs e) {
73
74    }
75  }
76}
Note: See TracBrowser for help on using the repository browser.