[6567] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[14185] | 3 | * Copyright (C) 2002-2016 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[6567] | 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;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Linq;
|
---|
| 25 | using HeuristicLab.Common;
|
---|
| 26 | using HeuristicLab.Core;
|
---|
| 27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 28 | using HeuristicLab.Problems.DataAnalysis;
|
---|
| 29 |
|
---|
| 30 | namespace HeuristicLab.Algorithms.DataAnalysis {
|
---|
| 31 | /// <summary>
|
---|
| 32 | /// Represents a multinomial logit model for classification
|
---|
| 33 | /// </summary>
|
---|
| 34 | [StorableClass]
|
---|
[6575] | 35 | [Item("Multinomial Logit Model", "Represents a multinomial logit model for classification.")]
|
---|
[13941] | 36 | public sealed class MultinomialLogitModel : ClassificationModel {
|
---|
[6567] | 37 |
|
---|
| 38 | private alglib.logitmodel logitModel;
|
---|
| 39 | public alglib.logitmodel Model {
|
---|
| 40 | get { return logitModel; }
|
---|
| 41 | set {
|
---|
| 42 | if (value != logitModel) {
|
---|
| 43 | if (value == null) throw new ArgumentNullException();
|
---|
| 44 | logitModel = value;
|
---|
| 45 | OnChanged(EventArgs.Empty);
|
---|
| 46 | }
|
---|
| 47 | }
|
---|
| 48 | }
|
---|
| 49 |
|
---|
[13941] | 50 | public override IEnumerable<string> VariablesUsedForPrediction {
|
---|
[13921] | 51 | get { return allowedInputVariables; }
|
---|
| 52 | }
|
---|
| 53 |
|
---|
[6567] | 54 | [Storable]
|
---|
| 55 | private string[] allowedInputVariables;
|
---|
| 56 | [Storable]
|
---|
| 57 | private double[] classValues;
|
---|
| 58 | [StorableConstructor]
|
---|
[6576] | 59 | private MultinomialLogitModel(bool deserializing)
|
---|
[6567] | 60 | : base(deserializing) {
|
---|
| 61 | if (deserializing)
|
---|
| 62 | logitModel = new alglib.logitmodel();
|
---|
| 63 | }
|
---|
[6576] | 64 | private MultinomialLogitModel(MultinomialLogitModel original, Cloner cloner)
|
---|
[6567] | 65 | : base(original, cloner) {
|
---|
| 66 | logitModel = new alglib.logitmodel();
|
---|
| 67 | logitModel.innerobj.w = (double[])original.logitModel.innerobj.w.Clone();
|
---|
| 68 | allowedInputVariables = (string[])original.allowedInputVariables.Clone();
|
---|
[6633] | 69 | classValues = (double[])original.classValues.Clone();
|
---|
[6567] | 70 | }
|
---|
[6576] | 71 | public MultinomialLogitModel(alglib.logitmodel logitModel, string targetVariable, IEnumerable<string> allowedInputVariables, double[] classValues)
|
---|
[13941] | 72 | : base(targetVariable) {
|
---|
[6567] | 73 | this.name = ItemName;
|
---|
| 74 | this.description = ItemDescription;
|
---|
| 75 | this.logitModel = logitModel;
|
---|
| 76 | this.allowedInputVariables = allowedInputVariables.ToArray();
|
---|
| 77 | this.classValues = (double[])classValues.Clone();
|
---|
| 78 | }
|
---|
| 79 |
|
---|
| 80 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[6576] | 81 | return new MultinomialLogitModel(this, cloner);
|
---|
[6567] | 82 | }
|
---|
| 83 |
|
---|
[13941] | 84 | public override IEnumerable<double> GetEstimatedClassValues(IDataset dataset, IEnumerable<int> rows) {
|
---|
[14400] | 85 | double[,] inputData = AlglibUtil.PrepareInputMatrix(dataset, allowedInputVariables, rows);
|
---|
[6567] | 86 |
|
---|
| 87 | int n = inputData.GetLength(0);
|
---|
| 88 | int columns = inputData.GetLength(1);
|
---|
| 89 | double[] x = new double[columns];
|
---|
| 90 | double[] y = new double[classValues.Length];
|
---|
| 91 |
|
---|
| 92 | for (int row = 0; row < n; row++) {
|
---|
| 93 | for (int column = 0; column < columns; column++) {
|
---|
| 94 | x[column] = inputData[row, column];
|
---|
| 95 | }
|
---|
| 96 | alglib.mnlprocess(logitModel, x, ref y);
|
---|
| 97 | // find class for with the largest probability value
|
---|
| 98 | int maxProbClassIndex = 0;
|
---|
| 99 | double maxProb = y[0];
|
---|
| 100 | for (int i = 1; i < y.Length; i++) {
|
---|
| 101 | if (maxProb < y[i]) {
|
---|
| 102 | maxProb = y[i];
|
---|
| 103 | maxProbClassIndex = i;
|
---|
| 104 | }
|
---|
| 105 | }
|
---|
| 106 | yield return classValues[maxProbClassIndex];
|
---|
| 107 | }
|
---|
| 108 | }
|
---|
| 109 |
|
---|
[13941] | 110 | public override IClassificationSolution CreateClassificationSolution(IClassificationProblemData problemData) {
|
---|
| 111 | return new MultinomialLogitClassificationSolution(this, new ClassificationProblemData(problemData));
|
---|
[6604] | 112 | }
|
---|
[13921] | 113 |
|
---|
[6567] | 114 | #region events
|
---|
| 115 | public event EventHandler Changed;
|
---|
| 116 | private void OnChanged(EventArgs e) {
|
---|
| 117 | var handlers = Changed;
|
---|
| 118 | if (handlers != null)
|
---|
| 119 | handlers(this, e);
|
---|
| 120 | }
|
---|
| 121 | #endregion
|
---|
| 122 |
|
---|
| 123 | #region persistence
|
---|
| 124 | [Storable]
|
---|
| 125 | private double[] LogitModelW {
|
---|
| 126 | get {
|
---|
| 127 | return logitModel.innerobj.w;
|
---|
| 128 | }
|
---|
| 129 | set {
|
---|
| 130 | logitModel.innerobj.w = value;
|
---|
| 131 | }
|
---|
| 132 | }
|
---|
| 133 | #endregion
|
---|
[13921] | 134 |
|
---|
[6567] | 135 | }
|
---|
| 136 | }
|
---|