- Timestamp:
- 09/23/16 12:57:27 (8 years ago)
- Location:
- stable
- Files:
-
- 10 edited
Legend:
- Unmodified
- Added
- Removed
-
stable
- Property svn:mergeinfo changed
/trunk/sources merged: 14228-14229
- Property svn:mergeinfo changed
-
stable/HeuristicLab.Problems.Instances.DataAnalysis
- Property svn:mergeinfo changed
/trunk/sources/HeuristicLab.Problems.Instances.DataAnalysis merged: 14228-14229
- Property svn:mergeinfo changed
-
stable/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Keijzer/KeijzerFunctionEleven.cs
r14186 r14305 24 24 using System.Linq; 25 25 using HeuristicLab.Common; 26 using HeuristicLab.Random; 26 27 27 28 namespace HeuristicLab.Problems.Instances.DataAnalysis { … … 47 48 protected override int TestPartitionStart { get { return 20; } } 48 49 protected override int TestPartitionEnd { get { return 20 + (601 * 601); } } 50 public int Seed { get; private set; } 49 51 52 public KeijzerFunctionEleven() : this((int)System.DateTime.Now.Ticks) { 53 } 54 public KeijzerFunctionEleven(int seed) : base() { 55 Seed = seed; 56 } 50 57 protected override List<List<double>> GenerateValues() { 51 58 List<List<double>> data = new List<List<double>>(); … … 54 61 55 62 var combinations = ValueGenerator.GenerateAllCombinationsOfValuesInLists(testData).ToList(); 56 63 var rand = new MersenneTwister((uint)Seed); 57 64 for (int i = 0; i < AllowedInputVariables.Count(); i++) { 58 data.Add(ValueGenerator.GenerateUniformDistributedValues( 20, -3, 3).ToList());65 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), 20, -3, 3).ToList()); 59 66 data[i].AddRange(combinations[i]); 60 67 } -
stable/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Keijzer/KeijzerFunctionFifteen.cs
r14186 r14305 24 24 using System.Linq; 25 25 using HeuristicLab.Common; 26 using HeuristicLab.Random; 26 27 27 28 namespace HeuristicLab.Problems.Instances.DataAnalysis { … … 46 47 protected override int TestPartitionStart { get { return 20; } } 47 48 protected override int TestPartitionEnd { get { return 20 + (601 * 601); } } 49 public int Seed { get; private set; } 48 50 51 public KeijzerFunctionFifteen() : this((int)System.DateTime.Now.Ticks) { 52 } 53 public KeijzerFunctionFifteen(int seed) : base() { 54 Seed = seed; 55 } 49 56 protected override List<List<double>> GenerateValues() { 50 57 List<List<double>> data = new List<List<double>>(); … … 53 60 54 61 var combinations = ValueGenerator.GenerateAllCombinationsOfValuesInLists(testData).ToList(); 62 var rand = new MersenneTwister((uint)Seed); 55 63 56 64 for (int i = 0; i < AllowedInputVariables.Count(); i++) { 57 data.Add(ValueGenerator.GenerateUniformDistributedValues( 20, -3, 3).ToList());65 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), 20, -3, 3).ToList()); 58 66 data[i].AddRange(combinations[i]); 59 67 } -
stable/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Keijzer/KeijzerFunctionFive.cs
r14186 r14305 23 23 using System.Collections.Generic; 24 24 using System.Linq; 25 using HeuristicLab.Random; 25 26 26 27 namespace HeuristicLab.Problems.Instances.DataAnalysis { … … 45 46 protected override int TestPartitionStart { get { return 1000; } } 46 47 protected override int TestPartitionEnd { get { return 11000; } } 48 public int Seed { get; private set; } 47 49 50 public KeijzerFunctionFive() : this((int)System.DateTime.Now.Ticks) { 51 } 52 public KeijzerFunctionFive(int seed) : base() { 53 Seed = seed; 54 } 48 55 protected override List<List<double>> GenerateValues() { 49 56 List<List<double>> data = new List<List<double>>(); 50 data.Add(ValueGenerator.GenerateUniformDistributedValues(TestPartitionEnd, -1, 1).ToList()); 51 data.Add(ValueGenerator.GenerateUniformDistributedValues(TestPartitionEnd, 1, 2).ToList()); 52 data.Add(ValueGenerator.GenerateUniformDistributedValues(TestPartitionEnd, -1, 1).ToList()); 57 var rand = new MersenneTwister((uint)Seed); 58 59 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), TestPartitionEnd, -1, 1).ToList()); 60 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), TestPartitionEnd, 1, 2).ToList()); 61 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), TestPartitionEnd, -1, 1).ToList()); 53 62 54 63 double x, y, z; -
stable/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Keijzer/KeijzerFunctionFourteen.cs
r14186 r14305 24 24 using System.Linq; 25 25 using HeuristicLab.Common; 26 using HeuristicLab.Random; 26 27 27 28 namespace HeuristicLab.Problems.Instances.DataAnalysis { … … 46 47 protected override int TestPartitionStart { get { return 20; } } 47 48 protected override int TestPartitionEnd { get { return 20 + (601 * 601); } } 49 public int Seed { get; private set; } 50 51 public KeijzerFunctionFourteen() : this((int)System.DateTime.Now.Ticks) { 52 } 53 public KeijzerFunctionFourteen(int seed) : base() { 54 Seed = seed; 55 } 56 48 57 49 58 protected override List<List<double>> GenerateValues() { 50 59 List<List<double>> data = new List<List<double>>(); 51 List<double> oneVariableTestData = SequenceGenerator.GenerateSteps(-3, 3, 0.01m).Select(v => (double) 60 List<double> oneVariableTestData = SequenceGenerator.GenerateSteps(-3, 3, 0.01m).Select(v => (double)v).ToList(); 52 61 List<List<double>> testData = new List<List<double>>() { oneVariableTestData, oneVariableTestData }; 53 62 54 63 var combinations = ValueGenerator.GenerateAllCombinationsOfValuesInLists(testData).ToList(); 64 var rand = new MersenneTwister((uint)Seed); 55 65 56 66 for (int i = 0; i < AllowedInputVariables.Count(); i++) { 57 data.Add(ValueGenerator.GenerateUniformDistributedValues( 20, -3, 3).ToList());67 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), 20, -3, 3).ToList()); 58 68 data[i].AddRange(combinations[i]); 59 69 } -
stable/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Keijzer/KeijzerFunctionTen.cs
r14186 r14305 24 24 using System.Linq; 25 25 using HeuristicLab.Common; 26 using HeuristicLab.Random; 26 27 27 28 namespace HeuristicLab.Problems.Instances.DataAnalysis { … … 46 47 protected override int TestPartitionStart { get { return 100; } } 47 48 protected override int TestPartitionEnd { get { return 100 + (101 * 101); } } 49 public int Seed { get; private set; } 48 50 51 public KeijzerFunctionTen() : this((int)System.DateTime.Now.Ticks) { 52 } 53 public KeijzerFunctionTen(int seed) : base() { 54 Seed = seed; 55 } 49 56 protected override List<List<double>> GenerateValues() { 50 57 List<List<double>> data = new List<List<double>>(); … … 54 61 55 62 var combinations = ValueGenerator.GenerateAllCombinationsOfValuesInLists(testData).ToList<IEnumerable<double>>(); 63 var rand = new MersenneTwister((uint)Seed); 56 64 for (int i = 0; i < AllowedInputVariables.Count(); i++) { 57 data.Add(ValueGenerator.GenerateUniformDistributedValues( 100, 0, 1).ToList());65 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), 100, 0, 1).ToList()); 58 66 data[i].AddRange(combinations[i]); 59 67 } -
stable/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Keijzer/KeijzerFunctionThirteen.cs
r14186 r14305 24 24 using System.Linq; 25 25 using HeuristicLab.Common; 26 using HeuristicLab.Random; 26 27 27 28 namespace HeuristicLab.Problems.Instances.DataAnalysis { … … 46 47 protected override int TestPartitionStart { get { return 20; } } 47 48 protected override int TestPartitionEnd { get { return 20 + (601 * 601); } } 49 public int Seed { get; private set; } 48 50 51 public KeijzerFunctionThirteen() : this((int)System.DateTime.Now.Ticks) { 52 } 53 public KeijzerFunctionThirteen(int seed) : base() { 54 Seed = seed; 55 } 49 56 protected override List<List<double>> GenerateValues() { 50 57 List<List<double>> data = new List<List<double>>(); … … 53 60 54 61 var combinations = ValueGenerator.GenerateAllCombinationsOfValuesInLists(testData).ToList(); 62 var rand = new MersenneTwister((uint)Seed); 55 63 56 64 for (int i = 0; i < AllowedInputVariables.Count(); i++) { 57 data.Add(ValueGenerator.GenerateUniformDistributedValues( 20, -3, 3).ToList());65 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), 20, -3, 3).ToList()); 58 66 data[i].AddRange(combinations[i]); 59 67 } -
stable/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Keijzer/KeijzerFunctionTwelve.cs
r14186 r14305 24 24 using System.Linq; 25 25 using HeuristicLab.Common; 26 using HeuristicLab.Random; 26 27 27 28 namespace HeuristicLab.Problems.Instances.DataAnalysis { … … 46 47 protected override int TestPartitionStart { get { return 20; } } 47 48 protected override int TestPartitionEnd { get { return 20 + (601 * 601); } } 49 public int Seed { get; private set; } 48 50 51 public KeijzerFunctionTwelve() : this((int)System.DateTime.Now.Ticks) { 52 } 53 public KeijzerFunctionTwelve(int seed) : base() { 54 Seed = seed; 55 } 49 56 protected override List<List<double>> GenerateValues() { 50 57 List<List<double>> data = new List<List<double>>(); … … 53 60 54 61 var combinations = ValueGenerator.GenerateAllCombinationsOfValuesInLists(testData).ToList(); 62 var rand = new MersenneTwister((uint)Seed); 55 63 56 64 for (int i = 0; i < AllowedInputVariables.Count(); i++) { 57 data.Add(ValueGenerator.GenerateUniformDistributedValues( 20, -3, 3).ToList());65 data.Add(ValueGenerator.GenerateUniformDistributedValues(rand.Next(), 20, -3, 3).ToList()); 58 66 data[i].AddRange(combinations[i]); 59 67 } -
stable/HeuristicLab.Problems.Instances.DataAnalysis/3.3/Regression/Keijzer/KeijzerInstanceProvider.cs
r14186 r14305 22 22 using System; 23 23 using System.Collections.Generic; 24 using HeuristicLab.Random; 24 25 25 26 namespace HeuristicLab.Problems.Instances.DataAnalysis { … … 37 38 get { return "McDermott et al., 2012 \"Genetic Programming Needs Better Benchmarks\", in Proc. of GECCO 2012."; } 38 39 } 40 public int Seed { get; private set; } 41 42 public KeijzerInstanceProvider() : this((int)System.DateTime.Now.Ticks) { 43 } 44 public KeijzerInstanceProvider(int seed) : base() { 45 Seed = seed; 46 } 39 47 40 48 public override IEnumerable<IDataDescriptor> GetDataDescriptors() { 41 49 List<IDataDescriptor> descriptorList = new List<IDataDescriptor>(); 50 var rand = new MersenneTwister((uint)Seed); 42 51 descriptorList.Add(new KeijzerFunctionOne()); 43 52 descriptorList.Add(new KeijzerFunctionTwo()); 44 53 descriptorList.Add(new KeijzerFunctionThree()); 45 54 descriptorList.Add(new KeijzerFunctionFour()); 46 descriptorList.Add(new KeijzerFunctionFive( ));55 descriptorList.Add(new KeijzerFunctionFive(rand.Next())); 47 56 descriptorList.Add(new KeijzerFunctionSix()); 48 57 descriptorList.Add(new KeijzerFunctionSeven()); 49 58 descriptorList.Add(new KeijzerFunctionEight()); 50 59 descriptorList.Add(new KeijzerFunctionNine()); 51 descriptorList.Add(new KeijzerFunctionTen( ));52 descriptorList.Add(new KeijzerFunctionEleven( ));53 descriptorList.Add(new KeijzerFunctionTwelve( ));54 descriptorList.Add(new KeijzerFunctionThirteen( ));55 descriptorList.Add(new KeijzerFunctionFourteen( ));56 descriptorList.Add(new KeijzerFunctionFifteen( ));60 descriptorList.Add(new KeijzerFunctionTen(rand.Next())); 61 descriptorList.Add(new KeijzerFunctionEleven(rand.Next())); 62 descriptorList.Add(new KeijzerFunctionTwelve(rand.Next())); 63 descriptorList.Add(new KeijzerFunctionThirteen(rand.Next())); 64 descriptorList.Add(new KeijzerFunctionFourteen(rand.Next())); 65 descriptorList.Add(new KeijzerFunctionFifteen(rand.Next())); 57 66 return descriptorList; 58 67 }
Note: See TracChangeset
for help on using the changeset viewer.