Free cookie consent management tool by TermsFeed Policy Generator

source: branches/DataAnalysis Refactoring/HeuristicLab.Problems.DataAnalysis/3.4/DiscriminantFunctionClassificationModel.cs @ 5649

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

#1418 Implemented classes for classification based on a discriminant function and thresholds and implemented interfaces and base classes for clustering.

File size: 3.6 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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.Collections.Generic;
23using System.Linq;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Data;
27using HeuristicLab.Operators;
28using HeuristicLab.Parameters;
29using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
30using HeuristicLab.Optimization;
31using System;
32
33namespace HeuristicLab.Problems.DataAnalysis {
34  /// <summary>
35  /// Represents discriminant function classification data analysis models.
36  /// </summary>
37  [StorableClass]
38  [Item("DiscriminantFunctionClassificationModel", "Represents a classification model that uses a discriminant function and classification thresholds.")]
39  public class DiscriminantFunctionClassificationModel : NamedItem, IDiscriminantFunctionClassificationModel {
40    [Storable]
41    private IRegressionModel model;
42    [Storable]
43    private double[] classValues;
44
45    [StorableConstructor]
46    protected DiscriminantFunctionClassificationModel() : base() { }
47    protected DiscriminantFunctionClassificationModel(DiscriminantFunctionClassificationModel original, Cloner cloner)
48      : base(original, cloner) {
49      model = cloner.Clone(original.model);
50      classValues = (double[])original.classValues.Clone();
51    }
52    public DiscriminantFunctionClassificationModel(IRegressionModel model, IEnumerable<double> classValues)
53      : base() {
54      this.name = ItemName;
55      this.description = ItemDescription;
56      this.model = model;
57      this.classValues = classValues.ToArray();
58    }
59
60    public override IDeepCloneable Clone(Cloner cloner) {
61      return new DiscriminantFunctionClassificationModel(this, cloner);
62    }
63
64    #region IDiscriminantFunctionClassificationModel Members
65
66    private double[] thresholds;
67    public IEnumerable<double> Thresholds {
68      get { return (IEnumerable<double>)thresholds.Clone(); }
69      set {
70        thresholds = value.ToArray();
71        OnThresholdsChanged(EventArgs.Empty);
72      }
73    }
74
75    public event EventHandler ThresholdsChanged;
76    protected virtual void OnThresholdsChanged(EventArgs e) {
77      var listener = ThresholdsChanged;
78      if (listener != null) listener(this, e);
79    }
80
81    public IEnumerable<double> GetEstimatedValues(Dataset dataset, IEnumerable<int> rows) {
82      return model.GetEstimatedValues(dataset, rows);
83    }
84
85    public IEnumerable<double> GetEstimatedClassValues(Dataset dataset, IEnumerable<int> rows) {
86      foreach (var x in GetEstimatedValues(dataset, rows)) {
87        int classIndex = 0;
88        // find first threshold value which is smaller than x => class index = threshold index + 1
89        for (int i = 0; i < thresholds.Length; i++) {
90          if (x > thresholds[i]) classIndex++;
91          else break;
92        }
93        yield return classValues.ElementAt(classIndex);
94      }
95    }
96
97    #endregion
98  }
99}
Note: See TracBrowser for help on using the repository browser.