#region License Information
/* HeuristicLab
* Copyright (C) 2002-2012 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
*
* This file is part of HeuristicLab.
*
* HeuristicLab is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* HeuristicLab is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with HeuristicLab. If not, see .
*/
#endregion
using HeuristicLab.Core;
using HeuristicLab.Data;
namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
public interface ISymbolicDataAnalysisProblem : IDataAnalysisProblem {
IValueParameter SymbolicExpressionTreeGrammarParameter { get; }
IValueParameter SymbolicExpressionTreeInterpreterParameter { get; }
IFixedValueParameter MaximumSymbolicExpressionTreeDepthParameter { get; }
IFixedValueParameter MaximumSymbolicExpressionTreeLengthParameter { get; }
IFixedValueParameter MaximumFunctionDefinitionsParameter { get; }
IFixedValueParameter MaximumFunctionArgumentsParameter { get; }
IFixedValueParameter RelativeNumberOfEvaluatedSamplesParameter { get; }
IFixedValueParameter FitnessCalculationPartitionParameter { get; }
IFixedValueParameter ValidationPartitionParameter { get; }
ISymbolicDataAnalysisGrammar SymbolicExpressionTreeGrammar { get; set; }
ISymbolicDataAnalysisExpressionTreeInterpreter SymbolicExpressionTreeInterpreter { get; set; }
IntValue MaximumSymbolicExpressionTreeDepth { get; }
IntValue MaximumSymbolicExpressionTreeLength { get; }
IntValue MaximumFunctionDefinitions { get; }
IntValue MaximumFunctionArguments { get; }
PercentValue RelativeNumberOfEvaluatedSamples { get; }
IntRange FitnessCalculationPartition { get; }
IntRange ValidationPartition { get; }
}
}