Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3116_GAM_Interactions/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Vladislavleva/KotanchekFunction.cs @ 18242

Last change on this file since 18242 was 17180, checked in by swagner, 5 years ago

#2875: Removed years in copyrights

File size: 3.7 KB
Line 
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
22using System;
23using System.Collections.Generic;
24using System.Linq;
25using HeuristicLab.Common;
26using HeuristicLab.Random;
27
28namespace HeuristicLab.Problems.Instances.DataAnalysis {
29  public class KotanchekFunction : ArtificialRegressionDataDescriptor {
30
31    public override string Name { get { return "Vladislavleva-1 F1(X1,X2) = exp(- (X1 - 1)²) / (1.2 + (X2 - 2.5)²)"; } }
32    public override string Description {
33      get {
34        return "Paper: Order of Nonlinearity as a Complexity Measure for Models Generated by Symbolic Regression via Pareto Genetic Programming " + Environment.NewLine
35        + "Authors: Ekaterina J. Vladislavleva, Member, IEEE, Guido F. Smits, Member, IEEE, and Dick den Hertog" + Environment.NewLine
36        + "Function: F1(X1, X2) = exp(- (X1 - 1)²) / (1.2 + (X2 - 2.5)²)" + Environment.NewLine
37        + "Training Data: 100 points X1, X2 = Rand(0.3, 4)" + Environment.NewLine
38        + "Test Data: 45*45 points (X1, X2) = (-0.2:0.1:4.2)" + Environment.NewLine
39        + "Function Set: +, -, *, /, square, e^x, e^-x, x^eps, x + eps, x * eps";
40      }
41    }
42    protected override string TargetVariable { get { return "Y"; } }
43    protected override string[] VariableNames { get { return new string[] { "X1", "X2", "Y" }; } }
44    protected override string[] AllowedInputVariables { get { return new string[] { "X1", "X2" }; } }
45    protected override int TrainingPartitionStart { get { return 0; } }
46    protected override int TrainingPartitionEnd { get { return 100; } }
47    protected override int TestPartitionStart { get { return 100; } }
48    protected override int TestPartitionEnd { get { return 100 + (45 * 45); } }
49
50    public int Seed { get; private set; }
51
52    public KotanchekFunction() : this((int)DateTime.Now.Ticks) { }
53
54    public KotanchekFunction(int seed) : base() {
55      Seed = seed;
56    }
57    protected override List<List<double>> GenerateValues() {
58      List<List<double>> data = new List<List<double>>();
59
60      List<double> oneVariableTestData = SequenceGenerator.GenerateSteps(-0.2m, 4.2m, 0.1m).Select(v => (double)v).ToList();
61      List<List<double>> testData = new List<List<double>>() { oneVariableTestData, oneVariableTestData };
62      var combinations = ValueGenerator.GenerateAllCombinationsOfValuesInLists(testData).ToList<IEnumerable<double>>();
63      var rand = new MersenneTwister((uint)Seed);
64
65      for (int i = 0; i < AllowedInputVariables.Count(); i++) {
66        data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), 100, 0.3, 4).ToList());
67        data[i].AddRange(combinations[i]);
68      }
69
70      double x1, x2;
71      List<double> results = new List<double>();
72      for (int i = 0; i < data[0].Count; i++) {
73        x1 = data[0][i];
74        x2 = data[1][i];
75        results.Add(Math.Exp(-Math.Pow(x1 - 1, 2)) / (1.2 + Math.Pow(x2 - 2.5, 2)));
76      }
77      data.Add(results);
78
79      return data;
80    }
81  }
82}
Note: See TracBrowser for help on using the repository browser.