1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2012 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.Collections.Generic;
|
---|
23 | using System.Linq;
|
---|
24 | using HeuristicLab.Common;
|
---|
25 | using HeuristicLab.Core;
|
---|
26 | using HeuristicLab.Data;
|
---|
27 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
28 | using HeuristicLab.Operators;
|
---|
29 | using HeuristicLab.Parameters;
|
---|
30 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
31 | using HeuristicLab.Optimization;
|
---|
32 |
|
---|
33 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
|
---|
34 | /// <summary>
|
---|
35 | /// Abstract base class for multi objective symbolic data analysis analyzers.
|
---|
36 | /// </summary>
|
---|
37 | [StorableClass]
|
---|
38 | public abstract class SymbolicDataAnalysisMultiObjectiveAnalyzer : SymbolicDataAnalysisAnalyzer, ISymbolicDataAnalysisMultiObjectiveAnalyzer {
|
---|
39 | private const string QualitiesParameterName = "Qualities";
|
---|
40 | private const string MaximizationParameterName = "Maximization";
|
---|
41 | #region parameter properties
|
---|
42 | public IScopeTreeLookupParameter<DoubleArray> QualitiesParameter {
|
---|
43 | get { return (IScopeTreeLookupParameter<DoubleArray>)Parameters[QualitiesParameterName]; }
|
---|
44 | }
|
---|
45 | public ILookupParameter<BoolArray> MaximizationParameter {
|
---|
46 | get { return (ILookupParameter<BoolArray>)Parameters[MaximizationParameterName]; }
|
---|
47 | }
|
---|
48 | #endregion
|
---|
49 | #region properties
|
---|
50 | public ItemArray<DoubleArray> Qualities {
|
---|
51 | get { return QualitiesParameter.ActualValue; }
|
---|
52 | }
|
---|
53 | public BoolArray Maximization {
|
---|
54 | get { return MaximizationParameter.ActualValue; }
|
---|
55 | }
|
---|
56 | #endregion
|
---|
57 | [StorableConstructor]
|
---|
58 | protected SymbolicDataAnalysisMultiObjectiveAnalyzer(bool deserializing) : base(deserializing) { }
|
---|
59 | protected SymbolicDataAnalysisMultiObjectiveAnalyzer(SymbolicDataAnalysisMultiObjectiveAnalyzer original, Cloner cloner)
|
---|
60 | : base(original, cloner) {
|
---|
61 | }
|
---|
62 | public SymbolicDataAnalysisMultiObjectiveAnalyzer()
|
---|
63 | : base() {
|
---|
64 | Parameters.Add(new ScopeTreeLookupParameter<DoubleArray>(QualitiesParameterName, "The qualities of the trees that should be analyzed."));
|
---|
65 | Parameters.Add(new LookupParameter<BoolArray>(MaximizationParameterName, "The directions of optimization for each dimension."));
|
---|
66 | }
|
---|
67 | }
|
---|
68 | }
|
---|