1 | #region License Information
|
---|
2 | /* HeuristicLab
|
---|
3 | * Copyright (C) 2002-2008 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 HeuristicLab.Core;
|
---|
24 | using HeuristicLab.Data;
|
---|
25 | using HeuristicLab.GP.Interfaces;
|
---|
26 | using HeuristicLab.GP;
|
---|
27 | using HeuristicLab.Modeling;
|
---|
28 | using System;
|
---|
29 | using System.Xml;
|
---|
30 | using HeuristicLab.DataAnalysis;
|
---|
31 | using System.Linq;
|
---|
32 |
|
---|
33 | namespace HeuristicLab.GP.StructureIdentification {
|
---|
34 | public class Predictor : PredictorBase {
|
---|
35 | public Predictor() : base() { } // for persistence
|
---|
36 | public Predictor(ITreeEvaluator evaluator, IGeneticProgrammingModel tree, double lowerPredictionLimit, double upperPredictionLimit)
|
---|
37 | : base(lowerPredictionLimit, upperPredictionLimit) {
|
---|
38 | this.treeEvaluator = evaluator;
|
---|
39 | this.functionTree = tree;
|
---|
40 | }
|
---|
41 |
|
---|
42 | private ITreeEvaluator treeEvaluator;
|
---|
43 | public ITreeEvaluator TreeEvaluator {
|
---|
44 | get { return (ITreeEvaluator)this.treeEvaluator.Clone(); }
|
---|
45 | }
|
---|
46 |
|
---|
47 | private IGeneticProgrammingModel functionTree;
|
---|
48 | public IGeneticProgrammingModel FunctionTree {
|
---|
49 | get { return functionTree; }
|
---|
50 | set { this.functionTree = value; }
|
---|
51 | }
|
---|
52 |
|
---|
53 | public override IEnumerable<double> Predict(Dataset input, int start, int end) {
|
---|
54 | if (input == null) throw new ArgumentNullException();
|
---|
55 | if (start < 0 || end <= start) throw new ArgumentException("start must be larger than zero and strictly smaller than end");
|
---|
56 | if (end > input.Rows) throw new ArgumentOutOfRangeException("number of rows in input is smaller then end");
|
---|
57 | treeEvaluator.UpperEvaluationLimit = UpperPredictionLimit;
|
---|
58 | treeEvaluator.LowerEvaluationLimit = LowerPredictionLimit;
|
---|
59 |
|
---|
60 | return treeEvaluator.Evaluate(input, functionTree.FunctionTree, Enumerable.Range(start, end - start));
|
---|
61 | }
|
---|
62 |
|
---|
63 | public override IEnumerable<string> GetInputVariables() {
|
---|
64 | HashSet<string> inputVariables = new HashSet<string>();
|
---|
65 | foreach (IFunctionTree ft in FunctionTreeIterator.IteratePrefix(functionTree.FunctionTree)) {
|
---|
66 | VariableFunctionTree varFunTree = ft as VariableFunctionTree;
|
---|
67 | if (varFunTree != null) {
|
---|
68 | inputVariables.Add(varFunTree.VariableName);
|
---|
69 | }
|
---|
70 | }
|
---|
71 | return inputVariables;
|
---|
72 | }
|
---|
73 |
|
---|
74 | public override IView CreateView() {
|
---|
75 | return new PredictorView(this);
|
---|
76 | }
|
---|
77 |
|
---|
78 | public override object Clone(IDictionary<Guid, object> clonedObjects) {
|
---|
79 | Predictor clone = (Predictor)base.Clone(clonedObjects);
|
---|
80 | clone.treeEvaluator = (ITreeEvaluator)Auxiliary.Clone(treeEvaluator, clonedObjects);
|
---|
81 | clone.functionTree = (IGeneticProgrammingModel)Auxiliary.Clone(functionTree, clonedObjects);
|
---|
82 | return clone;
|
---|
83 | }
|
---|
84 |
|
---|
85 | public override System.Xml.XmlNode GetXmlNode(string name, System.Xml.XmlDocument document, IDictionary<Guid, IStorable> persistedObjects) {
|
---|
86 | XmlNode node = base.GetXmlNode(name, document, persistedObjects);
|
---|
87 | node.AppendChild(PersistenceManager.Persist("Evaluator", treeEvaluator, document, persistedObjects));
|
---|
88 | node.AppendChild(PersistenceManager.Persist("FunctionTree", functionTree, document, persistedObjects));
|
---|
89 | return node;
|
---|
90 | }
|
---|
91 |
|
---|
92 | public override void Populate(System.Xml.XmlNode node, IDictionary<Guid, IStorable> restoredObjects) {
|
---|
93 | base.Populate(node, restoredObjects);
|
---|
94 | treeEvaluator = (ITreeEvaluator)PersistenceManager.Restore(node.SelectSingleNode("Evaluator"), restoredObjects);
|
---|
95 | functionTree = (IGeneticProgrammingModel)PersistenceManager.Restore(node.SelectSingleNode("FunctionTree"), restoredObjects);
|
---|
96 | }
|
---|
97 | }
|
---|
98 | }
|
---|