#region License Information /* HeuristicLab * Copyright (C) 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 HEAL.Attic; using HeuristicLab.Problems.DataAnalysis; namespace HeuristicLab.Algorithms.DataAnalysis { /// /// Represents a nearest neighbour solution for a classification problem which can be visualized in the GUI. /// [Item("NearestNeighbourClassificationSolution", "Represents a nearest neighbour solution for a classification problem which can be visualized in the GUI.")] [StorableType("C336B1A1-A746-4DA9-A926-EC1CA4EFDB02")] public sealed class NearestNeighbourClassificationSolution : ClassificationSolution, INearestNeighbourClassificationSolution { public new INearestNeighbourModel Model { get { return (INearestNeighbourModel)base.Model; } set { base.Model = value; } } [StorableConstructor] private NearestNeighbourClassificationSolution(StorableConstructorFlag _) : base(_) { } private NearestNeighbourClassificationSolution(NearestNeighbourClassificationSolution original, Cloner cloner) : base(original, cloner) { } public NearestNeighbourClassificationSolution(INearestNeighbourModel nnModel, IClassificationProblemData problemData) : base(nnModel, problemData) { } public override IDeepCloneable Clone(Cloner cloner) { return new NearestNeighbourClassificationSolution(this, cloner); } } }