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;
|
---|
23 | using System.Collections.Generic;
|
---|
24 | using System.Linq;
|
---|
25 | using HeuristicLab.Common;
|
---|
26 | using HeuristicLab.Random;
|
---|
27 |
|
---|
28 | namespace HeuristicLab.Problems.Instances.DataAnalysis {
|
---|
29 | public class RationalPolynomialThreeDimensional : ArtificialRegressionDataDescriptor {
|
---|
30 |
|
---|
31 | public override string Name { get { return "Vladislavleva-5 F5(X1, X2, X3) = 30 * ((X1 - 1) * (X3 -1)) / (X2² * (X1 - 10))"; } }
|
---|
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: F5(X1, X2, X3) = 30 * ((X1 - 1) * (X3 -1)) / (X2² * (X1 - 10))" + Environment.NewLine
|
---|
37 | + "Training Data: 300 points X1, X3 = Rand(0.05, 2), X2 = Rand(1, 2)" + Environment.NewLine
|
---|
38 | + "Test Data: (14*12*14) points X1, X3 = (-0.05:0.15:2.05), X2 = (0.95:0.1:2.05)" + Environment.NewLine
|
---|
39 | + "Function Set: +, -, *, /, square, 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", "X3", "Y" }; } }
|
---|
44 | protected override string[] AllowedInputVariables { get { return new string[] { "X1", "X2", "X3" }; } }
|
---|
45 | protected override int TrainingPartitionStart { get { return 0; } }
|
---|
46 | protected override int TrainingPartitionEnd { get { return 300; } }
|
---|
47 | protected override int TestPartitionStart { get { return 300; } }
|
---|
48 | protected override int TestPartitionEnd { get { return 300 + (15 * 12 * 15); } }
|
---|
49 | public int Seed { get; private set; }
|
---|
50 |
|
---|
51 | public RationalPolynomialThreeDimensional() : this((int)DateTime.Now.Ticks) { }
|
---|
52 |
|
---|
53 | public RationalPolynomialThreeDimensional(int seed) : base() {
|
---|
54 | Seed = seed;
|
---|
55 | }
|
---|
56 | protected override List<List<double>> GenerateValues() {
|
---|
57 | List<List<double>> data = new List<List<double>>();
|
---|
58 |
|
---|
59 | int n = 300;
|
---|
60 | var rand = new MersenneTwister((uint)Seed);
|
---|
61 | data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), n, 0.05, 2).ToList());
|
---|
62 | data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), n, 1, 2).ToList());
|
---|
63 | data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), n, 0.05, 2).ToList());
|
---|
64 |
|
---|
65 | List<List<double>> testData = new List<List<double>>() {
|
---|
66 | SequenceGenerator.GenerateSteps(-0.05m, 2.05m, 0.15m).Select(v => (double)v).ToList(),
|
---|
67 | SequenceGenerator.GenerateSteps( 0.95m, 2.05m, 0.1m).Select(v => (double)v).ToList(),
|
---|
68 | SequenceGenerator.GenerateSteps(-0.05m, 2.05m, 0.15m).Select(v => (double)v).ToList()
|
---|
69 | };
|
---|
70 |
|
---|
71 | var combinations = ValueGenerator.GenerateAllCombinationsOfValuesInLists(testData).ToList<IEnumerable<double>>();
|
---|
72 |
|
---|
73 | for (int i = 0; i < AllowedInputVariables.Count(); i++) {
|
---|
74 | data[i].AddRange(combinations[i]);
|
---|
75 | }
|
---|
76 |
|
---|
77 | double x1, x2, x3;
|
---|
78 | List<double> results = new List<double>();
|
---|
79 | for (int i = 0; i < data[0].Count; i++) {
|
---|
80 | x1 = data[0][i];
|
---|
81 | x2 = data[1][i];
|
---|
82 | x3 = data[2][i];
|
---|
83 | results.Add(30 * ((x1 - 1) * (x3 - 1)) / (Math.Pow(x2, 2) * (x1 - 10)));
|
---|
84 | }
|
---|
85 | data.Add(results);
|
---|
86 |
|
---|
87 | return data;
|
---|
88 | }
|
---|
89 | }
|
---|
90 | }
|
---|