#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 nearest neighbour solution for a regression problem which can be visualized in the GUI. /// [Item("NearestNeighbourRegressionSolution", "Represents a nearest neighbour solution for a regression problem which can be visualized in the GUI.")] [StorableType("97094999-18A6-4D3C-AD57-8B1169D6C676")] public sealed class NearestNeighbourRegressionSolution : RegressionSolution, INearestNeighbourRegressionSolution { public new INearestNeighbourModel Model { get { return (INearestNeighbourModel)base.Model; } set { base.Model = value; } } [StorableConstructor] private NearestNeighbourRegressionSolution(bool deserializing) : base(deserializing) { } private NearestNeighbourRegressionSolution(NearestNeighbourRegressionSolution original, Cloner cloner) : base(original, cloner) { } public NearestNeighbourRegressionSolution(IRegressionProblemData problemData, INearestNeighbourModel nnModel) : base(nnModel, problemData) { } public override IDeepCloneable Clone(Cloner cloner) { return new NearestNeighbourRegressionSolution(this, cloner); } } }