1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2011 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;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 |
|
---|
26 | namespace HeuristicLab.Problems.DataAnalysis.Benchmarks {
|
---|
27 | public class SpatialCoevolution : RegressionToyBenchmark {
|
---|
28 |
|
---|
29 | public SpatialCoevolution() {
|
---|
30 | Name = "Spatial co-evolution F(x,y) = 1/(1+power(x,-4)) + 1/(1+pow(y,-4))";
|
---|
31 | Description = "Paper: Evolutionary consequences of coevolving targets" + Environment.NewLine
|
---|
32 | + "Authors: Ludo Pagie and Paulien Hogeweg" + Environment.NewLine
|
---|
33 | + "Function: F(x,y) = 1/(1+power(x,-4)) + 1/(1+pow(y,-4))" + Environment.NewLine
|
---|
34 | + "Terminal set: x, y" + Environment.NewLine
|
---|
35 | + "The fitness of a solution is defined as the mean of the absolute differences between "
|
---|
36 | + "the target function and the solution over all problems on the basis of which it is evaluated. "
|
---|
37 | + "A solution is considered completely ’correct’ if, for all 676 problems in the ’complete’ "
|
---|
38 | + "problem set used in the static evaluation scheme, the absolute difference between "
|
---|
39 | + "solution and target function is less than 0:01 (this is a so-called hit)." + Environment.NewLine;
|
---|
40 | targetVariable = "F";
|
---|
41 | inputVariables = new List<string>() { "X", "Y" };
|
---|
42 | trainingPartition = new IntRange(0, 1000);
|
---|
43 | testPartition = new IntRange(1000, 1676);
|
---|
44 | }
|
---|
45 |
|
---|
46 | protected override List<double> GenerateTarget(List<List<double>> data) {
|
---|
47 | double x, y;
|
---|
48 | List<double> results = new List<double>();
|
---|
49 | for (int i = 0; i < data[0].Count; i++) {
|
---|
50 | x = data[0][i];
|
---|
51 | y = data[1][i];
|
---|
52 | results.Add(1 / (1 + Math.Pow(x, -4)) + 1 / (1 + Math.Pow(y, -4)));
|
---|
53 | }
|
---|
54 | return results;
|
---|
55 | }
|
---|
56 |
|
---|
57 | protected override List<List<double>> GenerateInput() {
|
---|
58 | List<List<double>> dataList = new List<List<double>>();
|
---|
59 |
|
---|
60 | DoubleRange range = new DoubleRange(-5, 5);
|
---|
61 |
|
---|
62 | List<double> oneVariableTestData = RegressionBenchmark.GenerateSteps(range, 0.4);
|
---|
63 | List<List<double>> testData = new List<List<double>>() { oneVariableTestData, oneVariableTestData };
|
---|
64 | testData = RegressionBenchmark.GenerateAllCombinationsOfValuesInLists(testData);
|
---|
65 |
|
---|
66 | for (int i = 0; i < inputVariables.Count; i++) {
|
---|
67 | dataList.Add(RegressionBenchmark.GenerateUniformDistributedValues(1000, range));
|
---|
68 | dataList[i].AddRange(testData[i]);
|
---|
69 | }
|
---|
70 |
|
---|
71 | return dataList;
|
---|
72 | }
|
---|
73 | }
|
---|
74 | }
|
---|