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.Linq;
|
---|
23 | using HeuristicLab.Common;
|
---|
24 | using HeuristicLab.Core;
|
---|
25 | using HeuristicLab.Data;
|
---|
26 | using HeuristicLab.Parameters;
|
---|
27 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
28 | using System.Collections.Generic;
|
---|
29 | using System;
|
---|
30 | using HeuristicLab.Random;
|
---|
31 |
|
---|
32 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
|
---|
33 | /// <summary>
|
---|
34 | /// Abstract base class for symbolic data analysis analyzers that validate a solution on a separate data partition using the evaluator.
|
---|
35 | /// </summary>
|
---|
36 | [StorableClass]
|
---|
37 | public abstract class SymbolicDataAnalysisMultiObjectiveValidationAnalyzer<T, U> : SymbolicDataAnalysisMultiObjectiveAnalyzer,
|
---|
38 | ISymbolicDataAnalysisValidationAnalyzer<T, U>
|
---|
39 | where T : class, ISymbolicDataAnalysisMultiObjectiveEvaluator<U>
|
---|
40 | where U : class, IDataAnalysisProblemData {
|
---|
41 | private const string RandomParameterName = "Random";
|
---|
42 | private const string ProblemDataParameterName = "ProblemData";
|
---|
43 | private const string EvaluatorParameterName = "Evaluator";
|
---|
44 | private const string SymbolicDataAnalysisTreeInterpreterParameterName = "SymbolicDataAnalysisTreeInterpreter";
|
---|
45 | private const string ValidationPartitionParameterName = "ValidationPartition";
|
---|
46 | private const string RelativeNumberOfEvaluatedSamplesParameterName = "RelativeNumberOfEvaluatedSamples";
|
---|
47 |
|
---|
48 | #region parameter properties
|
---|
49 | public ILookupParameter<IRandom> RandomParameter {
|
---|
50 | get { return (ILookupParameter<IRandom>)Parameters[RandomParameterName]; }
|
---|
51 | }
|
---|
52 | public ILookupParameter<U> ProblemDataParameter {
|
---|
53 | get { return (ILookupParameter<U>)Parameters[ProblemDataParameterName]; }
|
---|
54 | }
|
---|
55 | public ILookupParameter<T> EvaluatorParameter {
|
---|
56 | get { return (ILookupParameter<T>)Parameters[EvaluatorParameterName]; }
|
---|
57 | }
|
---|
58 | public ILookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter> SymbolicDataAnalysisTreeInterpreterParameter {
|
---|
59 | get { return (ILookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter>)Parameters[SymbolicDataAnalysisTreeInterpreterParameterName]; }
|
---|
60 | }
|
---|
61 | public IValueLookupParameter<IntRange> ValidationPartitionParameter {
|
---|
62 | get { return (IValueLookupParameter<IntRange>)Parameters[ValidationPartitionParameterName]; }
|
---|
63 | }
|
---|
64 | public IValueLookupParameter<PercentValue> RelativeNumberOfEvaluatedSamplesParameter {
|
---|
65 | get { return (IValueLookupParameter<PercentValue>)Parameters[RelativeNumberOfEvaluatedSamplesParameterName]; }
|
---|
66 | }
|
---|
67 | #endregion
|
---|
68 |
|
---|
69 | [StorableConstructor]
|
---|
70 | protected SymbolicDataAnalysisMultiObjectiveValidationAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
71 | protected SymbolicDataAnalysisMultiObjectiveValidationAnalyzer(SymbolicDataAnalysisMultiObjectiveValidationAnalyzer<T, U> original, Cloner cloner)
|
---|
72 | : base(original, cloner) {
|
---|
73 | }
|
---|
74 | public SymbolicDataAnalysisMultiObjectiveValidationAnalyzer()
|
---|
75 | : base() {
|
---|
76 | Parameters.Add(new LookupParameter<U>(ProblemDataParameterName, "The problem data of the symbolic data analysis problem."));
|
---|
77 | Parameters.Add(new LookupParameter<T>(EvaluatorParameterName, "The operator to use for fitness evaluation on the validation partition."));
|
---|
78 | Parameters.Add(new LookupParameter<ISymbolicDataAnalysisExpressionTreeInterpreter>(SymbolicDataAnalysisTreeInterpreterParameterName, "The interpreter for symbolic data analysis expression trees."));
|
---|
79 | Parameters.Add(new ValueLookupParameter<IntRange>(ValidationPartitionParameterName, "Thes validation partition."));
|
---|
80 | Parameters.Add(new ValueLookupParameter<PercentValue>(RelativeNumberOfEvaluatedSamplesParameterName, "The relative number of samples of the dataset partition, which should be randomly chosen for evaluation between the start and end index."));
|
---|
81 | }
|
---|
82 |
|
---|
83 | protected IEnumerable<int> GenerateRowsToEvaluate() {
|
---|
84 | int seed = RandomParameter.ActualValue.Next();
|
---|
85 | int samplesStart = ValidationPartitionParameter.ActualValue.Start;
|
---|
86 | int samplesEnd = ValidationPartitionParameter.ActualValue.End;
|
---|
87 | int testPartitionStart = ProblemDataParameter.ActualValue.TestPartition.Start;
|
---|
88 | int testPartitionEnd = ProblemDataParameter.ActualValue.TestPartition.End;
|
---|
89 |
|
---|
90 | if (samplesEnd < samplesStart) throw new ArgumentException("Start value is larger than end value.");
|
---|
91 | int count = (int)((samplesEnd - samplesStart) * RelativeNumberOfEvaluatedSamplesParameter.ActualValue.Value);
|
---|
92 | if (count == 0) count = 1;
|
---|
93 | return RandomEnumerable.SampleRandomNumbers(seed, samplesStart, samplesEnd, count)
|
---|
94 | .Where(i => i < testPartitionStart || testPartitionEnd <= i);
|
---|
95 | }
|
---|
96 | }
|
---|
97 | }
|
---|