Free cookie consent management tool by TermsFeed Policy Generator

source: branches/3044_variableScaling/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Korns/KornsFunctionThree.cs

Last change on this file 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.Random;
26
27namespace HeuristicLab.Problems.Instances.DataAnalysis {
28  public class KornsFunctionThree : ArtificialRegressionDataDescriptor {
29
30    public override string Name { get { return "Korns 3 y = -5.41 + (4.9 * (((X3 - X0) + (X1 / X4)) / (3 * X4)))"; } }
31    public override string Description {
32      get {
33        return "Paper: Accuracy in Symbolic Regression" + Environment.NewLine
34        + "Authors: Michael F. Korns" + Environment.NewLine
35        + "Function: y = 1.57 + (24.3 * X3)" + Environment.NewLine
36        + "Binary Operators: +, -, *, % (protected division)" + Environment.NewLine
37        + "Unary Operators: sqrt, square, cube, cos, sin, tan, tanh, ln(|x|) (protected log), exp" + Environment.NewLine
38        + "Constants: random finit 64-bit IEEE double" + Environment.NewLine
39        + "\"Our testing regimen uses only statistical best practices out-of-sample testing techniques. "
40        + "We test each of the test cases on matrices of 10000 rows by 1 to 5 columns with no noise. "
41        + "For each test a training matrix is filled with random numbers between -50 and +50. The test case "
42        + "target expressions are limited to one basis function whose maximum depth is three grammar nodes.\"";
43      }
44    }
45    protected override string TargetVariable { get { return "Y"; } }
46    protected override string[] VariableNames { get { return new string[] { "X0", "X1", "X2", "X3", "X4", "Y" }; } }
47    protected override string[] AllowedInputVariables { get { return new string[] { "X0", "X1", "X2", "X3", "X4" }; } }
48    protected override int TrainingPartitionStart { get { return 0; } }
49    protected override int TrainingPartitionEnd { get { return 10000; } }
50    protected override int TestPartitionStart { get { return 10000; } }
51    protected override int TestPartitionEnd { get { return 20000; } }
52    public int Seed { get; private set; }
53
54    public KornsFunctionThree() : this((int)System.DateTime.Now.Ticks) {
55    }
56    public KornsFunctionThree(int seed) : base() {
57      Seed = seed;
58    }
59    protected override List<List<double>> GenerateValues() {
60      List<List<double>> data = new List<List<double>>();
61      var rand = new MersenneTwister((uint)Seed);
62      for (int i = 0; i < AllowedInputVariables.Count(); i++) {
63        data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), TestPartitionEnd, -50, 50).ToList());
64      }
65
66      double x0, x1, x3, x4;
67      List<double> results = new List<double>();
68      for (int i = 0; i < data[0].Count; i++) {
69        x0 = data[0][i];
70        x1 = data[1][i];
71        x3 = data[3][i];
72        x4 = data[4][i];
73        results.Add(-5.41 + (4.9 * (((x3 - x0) + (x1 / x4)) / (3 * x4))));
74      }
75      data.Add(results);
76
77      return data;
78    }
79  }
80}
Note: See TracBrowser for help on using the repository browser.