source: trunk/sources/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Nguyen/NguyenInstanceProvider.cs @ 14821

#region License Information
/* HeuristicLab
 * Copyright (C) 2002-2016 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 <http://www.gnu.org/licenses/>.
 */
#endregion

using System;
using System.Collections.Generic;
using HeuristicLab.Random;

namespace HeuristicLab.Problems.Instances.DataAnalysis {
  public class NguyenInstanceProvider : ArtificialRegressionInstanceProvider {
    public override string Name {
      get { return "Nguyen Benchmark Problems"; }
    }
    public override string Description {
      get { return ""; }
    }
    public override Uri WebLink {
      get { return new Uri("http://www.gpbenchmarks.org/wiki/index.php?title=Problem_Classification#Nguyen_et_al"); }
    }
    public override string ReferencePublication {
      get { return "McDermott et al., 2012 \"Genetic Programming Needs Better Benchmarks\", in Proc. of GECCO 2012."; }
    }
    public int Seed { get; private set; }

    public NguyenInstanceProvider() : this((int)System.DateTime.Now.Ticks) { }
    public NguyenInstanceProvider(int seed) : base() {
      Seed = seed;
    }

    public override IEnumerable<IDataDescriptor> GetDataDescriptors() {
      List<IDataDescriptor> descriptorList = new List<IDataDescriptor>();
      var rand = new MersenneTwister((uint)Seed);
      descriptorList.Add(new NguyenFunctionOne(rand.Next()));
      descriptorList.Add(new NguyenFunctionTwo(rand.Next()));
      descriptorList.Add(new NguyenFunctionThree(rand.Next()));
      descriptorList.Add(new NguyenFunctionFour(rand.Next()));
      descriptorList.Add(new NguyenFunctionFive(rand.Next()));
      descriptorList.Add(new NguyenFunctionSix(rand.Next()));
      descriptorList.Add(new NguyenFunctionSeven(rand.Next()));
      descriptorList.Add(new NguyenFunctionEight(rand.Next()));
      descriptorList.Add(new NguyenFunctionNine(rand.Next()));
      descriptorList.Add(new NguyenFunctionTen(rand.Next()));
      descriptorList.Add(new NguyenFunctionEleven(rand.Next()));
      descriptorList.Add(new NguyenFunctionTwelve(rand.Next()));
      return descriptorList;
    }
  }
}