#region License Information
/* HeuristicLab
* Copyright (C) 2002-2015 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using HeuristicLab.Common;
using HeuristicLab.Core;
using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
using HeuristicLab.Problems.DataAnalysis;
namespace HeuristicLab.Algorithms.DataAnalysis {
///
/// Represents a multinomial logit solution for a classification problem which can be visualized in the GUI.
///
[Item("Multinomial Logit Classification Solution", "Represents a multinomial logit solution for a classification problem which can be visualized in the GUI.")]
[StorableType("6ED9C94B-F151-4459-BA7F-D6276E2F5E3A")]
public sealed class MultinomialLogitClassificationSolution : ClassificationSolution {
public new MultinomialLogitModel Model {
get { return (MultinomialLogitModel)base.Model; }
set { base.Model = value; }
}
[StorableConstructor]
private MultinomialLogitClassificationSolution(bool deserializing) : base(deserializing) { }
private MultinomialLogitClassificationSolution(MultinomialLogitClassificationSolution original, Cloner cloner)
: base(original, cloner) {
}
public MultinomialLogitClassificationSolution(IClassificationProblemData problemData, MultinomialLogitModel logitModel)
: base(logitModel, problemData) {
}
public override IDeepCloneable Clone(Cloner cloner) {
return new MultinomialLogitClassificationSolution(this, cloner);
}
}
}