Free cookie consent management tool by TermsFeed Policy Generator

source: branches/LearningClassifierSystems/HeuristicLab.Problems.VariableVectorClassification/3.3/VariableVectorClassificationProblem.cs @ 9226

Last change on this file since 9226 was 9226, checked in by sforsten, 11 years ago

#1980:

  • made classes in Problems.ConditionActionClassification abstract
  • added Problems.VariableVectorClassification and Problems.CombinedIntegerVectorClassification
  • LCS works now with arbitrary problems, which implement ConditionActionClassificationProblem
File size: 7.6 KB
Line 
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
22using System.Collections.Generic;
23using System.Linq;
24using HeuristicLab.Common;
25using HeuristicLab.Core;
26using HeuristicLab.Encodings.ConditionActionEncoding;
27using HeuristicLab.Encodings.VariableVector;
28using HeuristicLab.Optimization;
29using HeuristicLab.Parameters;
30using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
31using HeuristicLab.PluginInfrastructure;
32using HeuristicLab.Problems.ConditionActionClassification;
33using HeuristicLab.Problems.DataAnalysis;
34
35namespace HeuristicLab.Problems.CombinedIntegerVectorClassification {
36  [StorableClass]
37  public class VariableVectorClassificationProblem : ConditionActionClassificationProblem<UniformRandomVariableVectorCreator,
38                                                            VariableVectorActionComparer,
39                                                            VariableVectorClassificationProblemData> {
40    public override string ChildName {
41      get { return "VariableVector"; }
42    }
43
44    #region parameter properties
45    private IFixedValueParameter<ItemSet<VariableVectorAction>> PossibleActionsConcreteClassParameter {
46      get { return (IFixedValueParameter<ItemSet<VariableVectorAction>>)Parameters["PossibleActionsConcreteClass"]; }
47    }
48    public override IFixedValueParameter<VariableVectorActionComparer> ClassifierComparerParameter {
49      get { return (IFixedValueParameter<VariableVectorActionComparer>)Parameters["ClassifierComparer"]; }
50    }
51    #endregion
52
53    #region properties
54    public new VariableVectorClassificationProblemData ProblemData {
55      get { return ProblemDataParameter.Value; }
56      protected set {
57        ProblemDataParameter.Value = value;
58        if (value != null) {
59          SetProblemDataSpecificParameters();
60        }
61      }
62    }
63
64    public ItemSet<VariableVectorAction> PossibleActionsConcreteClass {
65      get { return PossibleActionsConcreteClassParameter.Value; }
66    }
67    public IClassifierComparer ClassifierComparer {
68      get { return ClassifierComparerParameter.Value; }
69    }
70    #endregion
71
72    [StorableConstructor]
73    protected VariableVectorClassificationProblem(bool deserializing) : base(deserializing) { }
74    protected VariableVectorClassificationProblem(VariableVectorClassificationProblem original, Cloner cloner)
75      : base(original, cloner) {
76    }
77    public override IDeepCloneable Clone(Cloner cloner) {
78      return new VariableVectorClassificationProblem(this, cloner);
79    }
80
81    public VariableVectorClassificationProblem() :
82      this(new VariableVectorClassificationProblemData(new Dataset(ConditionActionClassificationProblemData.defaultVariableNames, ConditionActionClassificationProblemData.defaultData),
83        ConditionActionClassificationProblemData.defaultVariableNames.Take(ConditionActionClassificationProblemData.defaultVariableNames.Length - 1), ConditionActionClassificationProblemData.defaultVariableNames.Last().ToEnumerable()),
84        new XCSEvaluator(), new UniformRandomVariableVectorCreator(), new VariableVectorCoveringCreator()) {
85    }
86
87    public VariableVectorClassificationProblem(VariableVectorClassificationProblemData problemData, XCSEvaluator evaluator, UniformRandomVariableVectorCreator solutionCreator, IVariableVectorCoveringCreator coveringSolutionCreator)
88      : base(problemData, evaluator, solutionCreator, coveringSolutionCreator) {
89      Parameters.Add(new FixedValueParameter<VariableVectorActionComparer>("ClassifierComparer", new VariableVectorActionComparer()));
90      Parameters.Add(new FixedValueParameter<ItemSet<IAction>>("PossibleActions", new ItemSet<IAction>(ClassifierComparer)));
91      Parameters.Add(new FixedValueParameter<ItemSet<VariableVectorAction>>("PossibleActionsConcreteClass", new ItemSet<VariableVectorAction>(ClassifierComparer)));
92
93      coveringSolutionCreator.SampleVariableVectorParameter.Value = problemData.SampleVariableVectorParameter.Value;
94
95      SetProblemDataSpecificParameters();
96
97      InitializeOperators();
98
99      problemData.Changed += new System.EventHandler(problemData_Changed);
100    }
101
102    private void problemData_Changed(object sender, System.EventArgs e) {
103      SetProblemDataSpecificParameters();
104    }
105
106    private void SetProblemDataSpecificParameters() {
107      SolutionCreator.SampleVariableVectorParameter.Value = ProblemData.SampleVariableVectorParameter.Value;
108      SolutionCreator.VariableVectorParameter.ActualName = ChildName;
109      SolutionCreator.SpreadPercentageParameter.Value = ProblemData.SpreadPercentageParameter.Value;
110
111      SetPossibleActions();
112    }
113
114    private void InitializeOperators() {
115      Operators.AddRange(ApplicationManager.Manager.GetInstances<IVariableVectorCrossover>());
116      Operators.AddRange(AddManipulators());
117
118      ParameterizeOperators();
119    }
120
121    private IEnumerable<IManipulator> AddManipulators() {
122      var manipulator = new UniformSomePositionManipulator();
123      manipulator.ChildParameter.ActualName = ChildName;
124      manipulator.FetchedInputParameter.ActualName = ClassifierFetcher.CurrentInputToMatchParameter.ActualName;
125      manipulator.PossibleActionsParameter.ActualName = PossibleActionsConcreteClassParameter.Name;
126      return new List<IManipulator>() { manipulator };
127    }
128
129    protected override void SetPossibleActions() {
130      var sampleAction = ProblemData.SampleVariableVector.Action;
131      var actionKeys = sampleAction.Order;
132      var actionsEnumeratorList = sampleAction.ToDictionary(x => x.Key, y => y.Value.GetAllPossibleActions().ToList());
133      int[] curPos = new int[actionsEnumeratorList.Count];
134      //initialize curPos
135      for (int i = 0; i < curPos.Length; i++) {
136        curPos[i] = 0;
137      }
138      bool done = false;
139      PossibleActions.Clear();
140      PossibleActionsConcreteClass.Clear();
141      VariableVectorAction curAction;
142      int cur;
143      while (!done) {
144        curAction = sampleAction.GetEmptyCopy();
145        cur = 0;
146        foreach (var key in actionKeys) {
147          curAction[key].SetTo(actionsEnumeratorList[key][curPos[cur]]);
148          cur++;
149        }
150        PossibleActions.Add(curAction);
151        PossibleActionsConcreteClass.Add(curAction);
152        done = MoveNext(actionsEnumeratorList, curPos, actionKeys);
153      }
154      ThetaMinimalNumberOfActions.Value = PossibleActions.Count;
155    }
156
157    private bool MoveNext(Dictionary<string, List<string>> actionsEnumeratorList, int[] curPos, IEnumerable<string> order) {
158      int cur = 0;
159      bool done = true;
160      foreach (var key in order) {
161        if (curPos[cur] + 1 < actionsEnumeratorList[key].Count) {
162          curPos[cur]++;
163          done = false;
164          break;
165        } else {
166          curPos[cur] = 0;
167        }
168        cur++;
169      }
170      return done;
171    }
172  }
173}
Note: See TracBrowser for help on using the repository browser.