Changeset 16053 for branches/2886_SymRegGrammarEnumeration/HeuristicLab.Algorithms.DataAnalysis.SymRegGrammarEnumeration/GrammarEnumeration/Grammar.cs
- Timestamp:
- 08/06/18 16:54:14 (6 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
branches/2886_SymRegGrammarEnumeration/HeuristicLab.Algorithms.DataAnalysis.SymRegGrammarEnumeration/GrammarEnumeration/Grammar.cs
r16026 r16053 1 using System; 1 #region License Information 2 /* HeuristicLab 3 * Copyright (C) 2002-2018 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; 2 23 using System.Collections.Generic; 3 24 using System.Diagnostics; 4 25 using System.Linq; 5 using HeuristicLab.Algorithms.DataAnalysis.SymRegGrammarEnumeration.GrammarEnumeration;6 26 using HeuristicLab.Common; 7 27 using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding; … … 234 254 } 235 255 236 // returns the maximum achievable sentence length below the maximum complexity 256 /// <summary> 257 /// returns the maximum achievable sentence length below the maximum complexity 258 /// TODO: figure out a way to calculate this accurately 259 /// </summary> 260 /// <param name="maxComplexity"></param> 261 /// <returns>Maximum sentence length according to the grammar and the maximum complexity</returns> 237 262 public int GetMaxSentenceLength(int maxComplexity) { 238 263 SymbolList s = new SymbolList(StartSymbol); … … 253 278 } 254 279 255 public double EvaluatePhrase(SymbolList s, IRegressionProblemData problemData, bool optimizeConstants, int iterations ) {280 public double EvaluatePhrase(SymbolList s, IRegressionProblemData problemData, bool optimizeConstants, int iterations, bool applyLinearScaling) { 256 281 SymbolicExpressionTree tree = ParseSymbolicExpressionTree(s); 257 282 258 return RSquaredEvaluator.Evaluate(problemData, tree, optimizeConstants, iterations );283 return RSquaredEvaluator.Evaluate(problemData, tree, optimizeConstants, iterations, applyLinearScaling); 259 284 } 260 285
Note: See TracChangeset
for help on using the changeset viewer.