[17823] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
| 3 | * Copyright (C) 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 |
|
---|
| 22 | using System.Linq;
|
---|
| 23 | using HeuristicLab.Optimization;
|
---|
| 24 | using HeuristicLab.Problems.DataAnalysis;
|
---|
| 25 | using HeuristicLab.Problems.Instances.DataAnalysis;
|
---|
| 26 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
| 27 | using HeuristicLab.Problems.DataAnalysis.Symbolic.Regression;
|
---|
| 28 |
|
---|
| 29 | namespace HeuristicLab.Algorithms.DataAnalysis.Tests {
|
---|
| 30 | [TestClass]
|
---|
| 31 | public class CrossValidationTest {
|
---|
| 32 | [TestMethod]
|
---|
| 33 | [TestCategory("Algorithms.DataAnalysis")]
|
---|
| 34 | [TestProperty("Time", "medium")]
|
---|
| 35 | public void RunCrossValidationTest() {
|
---|
| 36 | var instanceProvider = new VariousInstanceProvider();
|
---|
| 37 |
|
---|
| 38 | var poly10 = instanceProvider.LoadData(instanceProvider.GetDataDescriptors().Single(x => x.Name.StartsWith("Poly")));
|
---|
| 39 | var symRegProb = new SymbolicRegressionSingleObjectiveProblem();
|
---|
| 40 | symRegProb.Load(poly10);
|
---|
| 41 | symRegProb.EstimationLimits.Lower = -1;
|
---|
| 42 | symRegProb.EstimationLimits.Upper = 1;
|
---|
| 43 |
|
---|
| 44 | var ga = new GeneticAlgorithm.GeneticAlgorithm();
|
---|
| 45 | ga.Problem = symRegProb;
|
---|
| 46 | // minimal configuration
|
---|
| 47 | // we only need to check how estimation limits are set in the CV folds.
|
---|
| 48 | ga.PopulationSize.Value = 10;
|
---|
| 49 | ga.MaximumGenerations.Value = 1;
|
---|
| 50 |
|
---|
| 51 |
|
---|
| 52 | var cv = new CrossValidation();
|
---|
| 53 | cv.Algorithm = ga;
|
---|
| 54 | cv.Start();
|
---|
| 55 |
|
---|
| 56 | Assert.AreEqual(Core.ExecutionState.Stopped, cv.ExecutionState);
|
---|
| 57 | IResult cvFoldsResult;
|
---|
| 58 | Assert.IsTrue(cv.Results.TryGetValue("CrossValidation Folds", out cvFoldsResult));
|
---|
[17824] | 59 | var runs = (RunCollection)cvFoldsResult.Value;
|
---|
[17823] | 60 | var foldEstimationLimits = (DoubleLimit)runs.First().Parameters["EstimationLimits"];
|
---|
| 61 |
|
---|
| 62 | Assert.AreEqual(symRegProb.EstimationLimits.Lower, foldEstimationLimits.Lower); // -1
|
---|
| 63 | Assert.AreEqual(symRegProb.EstimationLimits.Upper, foldEstimationLimits.Upper); // 1
|
---|
| 64 | }
|
---|
| 65 | }
|
---|
| 66 | }
|
---|