[5574] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[17180] | 3 | * Copyright (C) Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[5574] | 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;
|
---|
| 23 | using System.Collections.Generic;
|
---|
| 24 | using System.Globalization;
|
---|
| 25 | using System.Linq;
|
---|
| 26 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
| 27 | using HeuristicLab.Random;
|
---|
| 28 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
[9764] | 29 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Tests {
|
---|
[5574] | 30 |
|
---|
| 31 |
|
---|
[9828] | 32 | [TestClass]
|
---|
[5574] | 33 | public class SymbolicDataAnalysisExpressionTreeInterpreterTest {
|
---|
| 34 | private const int N = 1000;
|
---|
[14354] | 35 | private const int Rows = 1000;
|
---|
[5574] | 36 | private const int Columns = 50;
|
---|
| 37 |
|
---|
[9828] | 38 | private static Dataset ds = new Dataset(new string[] { "Y", "A", "B" }, new double[,] {
|
---|
| 39 | { 1.0, 1.0, 1.0 },
|
---|
| 40 | { 2.0, 2.0, 2.0 },
|
---|
| 41 | { 3.0, 1.0, 2.0 },
|
---|
| 42 | { 4.0, 1.0, 1.0 },
|
---|
| 43 | { 5.0, 2.0, 2.0 },
|
---|
| 44 | { 6.0, 1.0, 2.0 },
|
---|
| 45 | { 7.0, 1.0, 1.0 },
|
---|
| 46 | { 8.0, 2.0, 2.0 },
|
---|
| 47 | { 9.0, 1.0, 2.0 },
|
---|
| 48 | { 10.0, 1.0, 1.0 },
|
---|
| 49 | { 11.0, 2.0, 2.0 },
|
---|
| 50 | { 12.0, 1.0, 2.0 }
|
---|
| 51 | });
|
---|
[5574] | 52 |
|
---|
| 53 | [TestMethod]
|
---|
[9828] | 54 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
[9785] | 55 | [TestProperty("Time", "long")]
|
---|
[9828] | 56 | public void StandardInterpreterTestTypeCoherentGrammarPerformance() {
|
---|
| 57 | TestTypeCoherentGrammarPerformance(new SymbolicDataAnalysisExpressionTreeInterpreter(), 12.5e6);
|
---|
[7926] | 58 | }
|
---|
| 59 | [TestMethod]
|
---|
[9828] | 60 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
[9785] | 61 | [TestProperty("Time", "long")]
|
---|
[9828] | 62 | public void StandardInterpreterTestFullGrammarPerformance() {
|
---|
| 63 | TestFullGrammarPerformance(new SymbolicDataAnalysisExpressionTreeInterpreter(), 12.5e6);
|
---|
[6732] | 64 | }
|
---|
| 65 | [TestMethod]
|
---|
[9828] | 66 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
[9785] | 67 | [TestProperty("Time", "long")]
|
---|
[9828] | 68 | public void StandardInterpreterTestArithmeticGrammarPerformance() {
|
---|
| 69 | TestArithmeticGrammarPerformance(new SymbolicDataAnalysisExpressionTreeInterpreter(), 12.5e6);
|
---|
[6732] | 70 | }
|
---|
| 71 |
|
---|
[13256] | 72 | [TestMethod]
|
---|
| 73 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 74 | [TestProperty("Time", "long")]
|
---|
[14354] | 75 | public void CompiledInterpreterTestTypeCoherentGrammarPerformance() {
|
---|
| 76 | TestTypeCoherentGrammarPerformance(new SymbolicDataAnalysisExpressionCompiledTreeInterpreter(), 12.5e6);
|
---|
| 77 | }
|
---|
| 78 | [TestMethod]
|
---|
| 79 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 80 | [TestProperty("Time", "long")]
|
---|
| 81 | public void CompiledInterpreterTestFullGrammarPerformance() {
|
---|
| 82 | TestFullGrammarPerformance(new SymbolicDataAnalysisExpressionCompiledTreeInterpreter(), 12.5e6);
|
---|
| 83 | }
|
---|
| 84 | [TestMethod]
|
---|
| 85 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 86 | [TestProperty("Time", "long")]
|
---|
| 87 | public void CompiledInterpreterTestArithmeticGrammarPerformance() {
|
---|
| 88 | TestArithmeticGrammarPerformance(new SymbolicDataAnalysisExpressionCompiledTreeInterpreter(), 12.5e6);
|
---|
| 89 | }
|
---|
| 90 |
|
---|
| 91 | [TestMethod]
|
---|
| 92 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 93 | [TestProperty("Time", "long")]
|
---|
[9828] | 94 | public void ILEmittingInterpreterTestTypeCoherentGrammarPerformance() {
|
---|
| 95 | TestTypeCoherentGrammarPerformance(new SymbolicDataAnalysisExpressionTreeILEmittingInterpreter(), 7.5e6);
|
---|
[7926] | 96 | }
|
---|
| 97 | [TestMethod]
|
---|
[9828] | 98 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
[9785] | 99 | [TestProperty("Time", "long")]
|
---|
[9828] | 100 | public void ILEmittingInterpreterTestArithmeticGrammarPerformance() {
|
---|
| 101 | TestArithmeticGrammarPerformance(new SymbolicDataAnalysisExpressionTreeILEmittingInterpreter(), 7.5e6);
|
---|
| 102 | }
|
---|
[9785] | 103 |
|
---|
[9828] | 104 | [TestMethod]
|
---|
| 105 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
[9785] | 106 | [TestProperty("Time", "long")]
|
---|
[9828] | 107 | public void LinearInterpreterTestTypeCoherentGrammarPerformance() {
|
---|
| 108 | TestTypeCoherentGrammarPerformance(new SymbolicDataAnalysisExpressionTreeLinearInterpreter(), 12.5e6);
|
---|
| 109 | }
|
---|
[6732] | 110 | [TestMethod]
|
---|
[9828] | 111 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 112 | [TestProperty("Time", "long")]
|
---|
| 113 | public void LinearInterpreterTestFullGrammarPerformance() {
|
---|
| 114 | TestFullGrammarPerformance(new SymbolicDataAnalysisExpressionTreeLinearInterpreter(), 12.5e6);
|
---|
[6732] | 115 | }
|
---|
[9828] | 116 | [TestMethod]
|
---|
| 117 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 118 | [TestProperty("Time", "long")]
|
---|
| 119 | public void LinearInterpreterTestArithmeticGrammarPerformance() {
|
---|
| 120 | TestArithmeticGrammarPerformance(new SymbolicDataAnalysisExpressionTreeLinearInterpreter(), 12.5e6);
|
---|
| 121 | }
|
---|
[6732] | 122 |
|
---|
[16298] | 123 | [TestMethod]
|
---|
| 124 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 125 | [TestProperty("Time", "long")]
|
---|
[17844] | 126 | public void NativeInterpreterTestTypeCoherentGrammarPerformance() {
|
---|
| 127 | TestTypeCoherentGrammarPerformance(new NativeInterpreter(), 12.5e6);
|
---|
| 128 | }
|
---|
| 129 | [TestMethod]
|
---|
| 130 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 131 | [TestProperty("Time", "long")]
|
---|
| 132 | public void NativeInterpreterTestFullGrammarPerformance() {
|
---|
| 133 | TestFullGrammarPerformance(new NativeInterpreter(), 12.5e6);
|
---|
| 134 | }
|
---|
| 135 | [TestMethod]
|
---|
| 136 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 137 | [TestProperty("Time", "long")]
|
---|
| 138 | public void NativeInterpreterTestArithmeticGrammarPerformance() {
|
---|
| 139 | TestArithmeticGrammarPerformance(new NativeInterpreter(), 12.5e6);
|
---|
| 140 | }
|
---|
| 141 |
|
---|
| 142 | [TestMethod]
|
---|
| 143 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 144 | [TestProperty("Time", "long")]
|
---|
| 145 | public void NativeInterpreterTestCeres() {
|
---|
| 146 | var parser = new InfixExpressionParser();
|
---|
| 147 | var random = new FastRandom(1234);
|
---|
| 148 | const int nRows = 20;
|
---|
| 149 |
|
---|
| 150 | var x1 = Enumerable.Range(0, nRows).Select(_ => UniformDistributedRandom.NextDouble(random, -1, 1)).ToArray();
|
---|
| 151 | var x2 = Enumerable.Range(0, nRows).Select(_ => UniformDistributedRandom.NextDouble(random, -1, 1)).ToArray();
|
---|
| 152 | var x3 = Enumerable.Range(0, nRows).Select(_ => UniformDistributedRandom.NextDouble(random, -1, 1)).ToArray();
|
---|
| 153 |
|
---|
| 154 | var optimalAlpha = new double[] { -2, -3, -5 };
|
---|
| 155 | var y = Enumerable.Range(0, nRows).Select(i =>
|
---|
| 156 | Math.Exp(x1[i] * optimalAlpha[0]) +
|
---|
| 157 | Math.Exp(x2[i] * optimalAlpha[1]) +
|
---|
| 158 | Math.Exp(x3[i] * optimalAlpha[2])).ToArray();
|
---|
| 159 |
|
---|
| 160 | var initialAlpha = Enumerable.Range(0, 3).Select(_ => UniformDistributedRandom.NextDouble(random, -1, 1)).ToArray();
|
---|
| 161 | var ds = new Dataset(new[] { "x1", "x2", "x3", "y" }, new[] { x1, x2, x3, y });
|
---|
| 162 |
|
---|
| 163 | var expr = "EXP(x1) + EXP(x2) + EXP(x3)";
|
---|
| 164 | var tree = parser.Parse(expr);
|
---|
| 165 | var rows = Enumerable.Range(0, nRows).ToArray();
|
---|
| 166 | var options = new SolverOptions {
|
---|
| 167 | Minimizer = (int)MinimizerType.TRUST_REGION,
|
---|
| 168 | Iterations = 20,
|
---|
| 169 | TrustRegionStrategy = (int)TrustRegionStrategyType.LEVENBERG_MARQUARDT,
|
---|
| 170 | LinearSolver = (int)LinearSolverType.DENSE_QR
|
---|
| 171 | };
|
---|
| 172 |
|
---|
| 173 | var nodesToOptimize = new HashSet<ISymbolicExpressionTreeNode>(tree.IterateNodesPrefix().Where(x => x is VariableTreeNode));
|
---|
| 174 | int idx = 0;
|
---|
| 175 | foreach(var node in nodesToOptimize) {
|
---|
| 176 | (node as VariableTreeNode).Weight = initialAlpha[idx++];
|
---|
| 177 | Console.WriteLine((node as VariableTreeNode).Weight);
|
---|
| 178 |
|
---|
| 179 | }
|
---|
| 180 |
|
---|
| 181 | var summary = new OptimizationSummary();
|
---|
| 182 | var parameters = ParameterOptimizer.OptimizeTree(tree, ds, rows, "y", nodesToOptimize, options, ref summary);
|
---|
| 183 |
|
---|
| 184 | Console.Write("Optimized parameters: ");
|
---|
| 185 | foreach (var t in parameters) {
|
---|
| 186 | Console.Write(t.Value + " ");
|
---|
| 187 | }
|
---|
| 188 | Console.WriteLine();
|
---|
| 189 |
|
---|
| 190 | Console.WriteLine("Optimization summary:");
|
---|
| 191 | Console.WriteLine("Initial cost: " + summary.InitialCost);
|
---|
| 192 | Console.WriteLine("Final cost: " + summary.FinalCost);
|
---|
| 193 | Console.WriteLine("Successful steps: " + summary.SuccessfulSteps);
|
---|
| 194 | Console.WriteLine("Unsuccessful steps: " + summary.UnsuccessfulSteps);
|
---|
| 195 | Console.WriteLine("Residual evaluations: " + summary.ResidualEvaluations);
|
---|
| 196 | Console.WriteLine("Jacobian evaluations: " + summary.JacobianEvaluations);
|
---|
| 197 | }
|
---|
| 198 |
|
---|
| 199 | [TestMethod]
|
---|
| 200 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 201 | [TestProperty("Time", "long")]
|
---|
| 202 | public void NativeInterpreterTestCeresVariableProjection() {
|
---|
| 203 | var parser = new InfixExpressionParser();
|
---|
| 204 | var random = new FastRandom(1234);
|
---|
| 205 | const int nRows = 20;
|
---|
| 206 |
|
---|
| 207 | var x1 = Enumerable.Range(0, nRows).Select(_ => UniformDistributedRandom.NextDouble(random, -1, 1)).ToArray();
|
---|
| 208 | var x2 = Enumerable.Range(0, nRows).Select(_ => UniformDistributedRandom.NextDouble(random, -1, 1)).ToArray();
|
---|
| 209 | var x3 = Enumerable.Range(0, nRows).Select(_ => UniformDistributedRandom.NextDouble(random, -1, 1)).ToArray();
|
---|
| 210 |
|
---|
| 211 | var optimalAlpha = new double[] { -2, -3, -5 };
|
---|
| 212 | var y = Enumerable.Range(0, nRows).Select(i =>
|
---|
| 213 | Math.Exp(x1[i] * optimalAlpha[0]) +
|
---|
| 214 | Math.Exp(x2[i] * optimalAlpha[1]) +
|
---|
| 215 | Math.Exp(x3[i] * optimalAlpha[2])).ToArray();
|
---|
| 216 |
|
---|
| 217 | var initialAlpha = Enumerable.Range(0, 3).Select(_ => UniformDistributedRandom.NextDouble(random, -1, 1)).ToArray();
|
---|
| 218 | var ds = new Dataset(new[] { "x1", "x2", "x3", "y" }, new[] { x1, x2, x3, y });
|
---|
| 219 |
|
---|
| 220 | var expr = new[] { "EXP(x1)", "EXP(x2)", "EXP(x3)" };
|
---|
| 221 | var trees = expr.Select(x => parser.Parse(x)).ToArray();
|
---|
| 222 | var rows = Enumerable.Range(0, nRows).ToArray();
|
---|
| 223 | var options = new SolverOptions {
|
---|
| 224 | Minimizer = (int)MinimizerType.TRUST_REGION,
|
---|
| 225 | Iterations = 100,
|
---|
| 226 | TrustRegionStrategy = (int)TrustRegionStrategyType.LEVENBERG_MARQUARDT,
|
---|
| 227 | LinearSolver = (int)LinearSolverType.DENSE_QR
|
---|
| 228 | };
|
---|
| 229 |
|
---|
| 230 | var summary = new OptimizationSummary();
|
---|
| 231 |
|
---|
| 232 | var nodesToOptimize = new HashSet<ISymbolicExpressionTreeNode>(trees.SelectMany(t => t.IterateNodesPrefix().Where(x => x is VariableTreeNode)));
|
---|
| 233 | int idx = 0;
|
---|
| 234 | Console.Write("Initial parameters: ");
|
---|
| 235 | foreach (var node in nodesToOptimize) {
|
---|
| 236 | (node as VariableTreeNode).Weight = initialAlpha[idx++];
|
---|
| 237 | Console.Write((node as VariableTreeNode).Weight + " ");
|
---|
| 238 | }
|
---|
| 239 | Console.WriteLine();
|
---|
| 240 |
|
---|
| 241 | var coeff = new double[trees.Length + 1];
|
---|
| 242 | var parameters = ParameterOptimizer.OptimizeTree(trees, ds, rows, "y", nodesToOptimize, options, coeff, ref summary);
|
---|
| 243 | Console.Write("Optimized parameters: ");
|
---|
| 244 | foreach (var t in parameters) {
|
---|
| 245 | Console.Write(t.Value + " ");
|
---|
| 246 | }
|
---|
| 247 | Console.WriteLine();
|
---|
| 248 |
|
---|
| 249 | Console.Write("Coefficients: ");
|
---|
| 250 | foreach (var v in coeff) Console.Write(v + " ");
|
---|
| 251 | Console.WriteLine();
|
---|
| 252 |
|
---|
| 253 | Console.WriteLine("Optimization summary:");
|
---|
| 254 | Console.WriteLine("Initial cost: " + summary.InitialCost);
|
---|
| 255 | Console.WriteLine("Final cost: " + summary.FinalCost);
|
---|
| 256 | Console.WriteLine("Successful steps: " + summary.SuccessfulSteps);
|
---|
| 257 | Console.WriteLine("Unsuccessful steps: " + summary.UnsuccessfulSteps);
|
---|
| 258 | Console.WriteLine("Residual evaluations: " + summary.ResidualEvaluations);
|
---|
| 259 | Console.WriteLine("Jacobian evaluations: " + summary.JacobianEvaluations);
|
---|
| 260 | }
|
---|
| 261 |
|
---|
| 262 | [TestMethod]
|
---|
| 263 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 264 | [TestProperty("Time", "long")]
|
---|
[16298] | 265 | public void BatchInterpreterTestTypeCoherentGrammarPerformance() {
|
---|
| 266 | TestTypeCoherentGrammarPerformance(new SymbolicDataAnalysisExpressionTreeBatchInterpreter(), 12.5e6);
|
---|
| 267 | }
|
---|
| 268 | [TestMethod]
|
---|
| 269 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 270 | [TestProperty("Time", "long")]
|
---|
| 271 | public void BatchInterpreterTestArithmeticGrammarPerformance() {
|
---|
| 272 | TestArithmeticGrammarPerformance(new SymbolicDataAnalysisExpressionTreeBatchInterpreter(), 12.5e6);
|
---|
| 273 | }
|
---|
| 274 |
|
---|
[9828] | 275 | private void TestTypeCoherentGrammarPerformance(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, double nodesPerSecThreshold) {
|
---|
[7926] | 276 | var twister = new MersenneTwister(31415);
|
---|
| 277 | var dataset = Util.CreateRandomDataset(twister, Rows, Columns);
|
---|
[13256] | 278 |
|
---|
[7926] | 279 | var grammar = new TypeCoherentExpressionGrammar();
|
---|
| 280 | grammar.ConfigureAsDefaultRegressionGrammar();
|
---|
[13256] | 281 |
|
---|
[7926] | 282 | var randomTrees = Util.CreateRandomTrees(twister, dataset, grammar, N, 1, 100, 0, 0);
|
---|
| 283 | foreach (ISymbolicExpressionTree tree in randomTrees) {
|
---|
| 284 | Util.InitTree(tree, twister, new List<string>(dataset.VariableNames));
|
---|
| 285 | }
|
---|
| 286 | double nodesPerSec = Util.CalculateEvaluatedNodesPerSec(randomTrees, interpreter, dataset, 3);
|
---|
[9322] | 287 | //mkommend: commented due to performance issues on the builder
|
---|
| 288 | // Assert.IsTrue(nodesPerSec > nodesPerSecThreshold); // evaluated nodes per seconds must be larger than 15mNodes/sec
|
---|
[7926] | 289 | }
|
---|
| 290 |
|
---|
[9828] | 291 | private void TestFullGrammarPerformance(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, double nodesPerSecThreshold) {
|
---|
[5574] | 292 | var twister = new MersenneTwister(31415);
|
---|
| 293 | var dataset = Util.CreateRandomDataset(twister, Rows, Columns);
|
---|
[13256] | 294 |
|
---|
[5686] | 295 | var grammar = new FullFunctionalExpressionGrammar();
|
---|
[5574] | 296 | var randomTrees = Util.CreateRandomTrees(twister, dataset, grammar, N, 1, 100, 0, 0);
|
---|
| 297 | foreach (ISymbolicExpressionTree tree in randomTrees) {
|
---|
| 298 | Util.InitTree(tree, twister, new List<string>(dataset.VariableNames));
|
---|
| 299 | }
|
---|
| 300 | double nodesPerSec = Util.CalculateEvaluatedNodesPerSec(randomTrees, interpreter, dataset, 3);
|
---|
[9322] | 301 | //mkommend: commented due to performance issues on the builder
|
---|
| 302 | //Assert.IsTrue(nodesPerSec > nodesPerSecThreshold); // evaluated nodes per seconds must be larger than 15mNodes/sec
|
---|
[5574] | 303 | }
|
---|
| 304 |
|
---|
[9828] | 305 | private void TestArithmeticGrammarPerformance(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, double nodesPerSecThreshold) {
|
---|
[5574] | 306 | var twister = new MersenneTwister(31415);
|
---|
| 307 | var dataset = Util.CreateRandomDataset(twister, Rows, Columns);
|
---|
[13256] | 308 |
|
---|
[5686] | 309 | var grammar = new ArithmeticExpressionGrammar();
|
---|
[5574] | 310 | var randomTrees = Util.CreateRandomTrees(twister, dataset, grammar, N, 1, 100, 0, 0);
|
---|
| 311 | foreach (SymbolicExpressionTree tree in randomTrees) {
|
---|
| 312 | Util.InitTree(tree, twister, new List<string>(dataset.VariableNames));
|
---|
| 313 | }
|
---|
[6732] | 314 |
|
---|
[5574] | 315 | double nodesPerSec = Util.CalculateEvaluatedNodesPerSec(randomTrees, interpreter, dataset, 3);
|
---|
[9322] | 316 | //mkommend: commented due to performance issues on the builder
|
---|
| 317 | //Assert.IsTrue(nodesPerSec > nodesPerSecThreshold); // evaluated nodes per seconds must be larger than 15mNodes/sec
|
---|
[5574] | 318 | }
|
---|
| 319 |
|
---|
| 320 |
|
---|
| 321 | /// <summary>
|
---|
| 322 | ///A test for Evaluate
|
---|
| 323 | ///</summary>
|
---|
| 324 | [TestMethod]
|
---|
[9828] | 325 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
[9785] | 326 | [TestProperty("Time", "short")]
|
---|
[9828] | 327 | public void StandardInterpreterTestEvaluation() {
|
---|
[6732] | 328 | var interpreter = new SymbolicDataAnalysisExpressionTreeInterpreter();
|
---|
| 329 | EvaluateTerminals(interpreter, ds);
|
---|
| 330 | EvaluateOperations(interpreter, ds);
|
---|
[13315] | 331 | EvaluateLaggedOperations(interpreter, ds);
|
---|
| 332 | EvaluateSpecialFunctions(interpreter, ds);
|
---|
[6732] | 333 | EvaluateAdf(interpreter, ds);
|
---|
| 334 | }
|
---|
| 335 |
|
---|
[14810] | 336 | /// <summary>
|
---|
| 337 | ///A test for Evaluate
|
---|
| 338 | ///</summary>
|
---|
[6732] | 339 | [TestMethod]
|
---|
[9828] | 340 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
[9785] | 341 | [TestProperty("Time", "short")]
|
---|
[14810] | 342 | public void ILEmittingInterpreterTestEvaluation() {
|
---|
| 343 | var interpreter = new SymbolicDataAnalysisExpressionTreeILEmittingInterpreter();
|
---|
| 344 | EvaluateTerminals(interpreter, ds);
|
---|
| 345 | EvaluateOperations(interpreter, ds);
|
---|
| 346 | EvaluateLaggedOperations(interpreter, ds);
|
---|
| 347 | EvaluateSpecialFunctions(interpreter, ds);
|
---|
| 348 | }
|
---|
| 349 |
|
---|
| 350 | [TestMethod]
|
---|
| 351 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 352 | [TestProperty("Time", "short")]
|
---|
[14354] | 353 | public void CompiledInterpreterTestEvaluation() {
|
---|
| 354 | var interpreter = new SymbolicDataAnalysisExpressionCompiledTreeInterpreter();
|
---|
| 355 | EvaluateTerminals(interpreter, ds);
|
---|
| 356 | EvaluateOperations(interpreter, ds);
|
---|
| 357 | EvaluateSpecialFunctions(interpreter, ds);
|
---|
| 358 | }
|
---|
| 359 |
|
---|
| 360 | [TestMethod]
|
---|
| 361 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 362 | [TestProperty("Time", "short")]
|
---|
[9828] | 363 | public void LinearInterpreterTestEvaluation() {
|
---|
| 364 | var interpreter = new SymbolicDataAnalysisExpressionTreeLinearInterpreter();
|
---|
| 365 | //ADFs are not supported by the linear interpreter
|
---|
| 366 | EvaluateTerminals(interpreter, ds);
|
---|
| 367 | EvaluateOperations(interpreter, ds);
|
---|
[13315] | 368 | EvaluateLaggedOperations(interpreter, ds);
|
---|
| 369 | EvaluateSpecialFunctions(interpreter, ds);
|
---|
[9828] | 370 | }
|
---|
| 371 |
|
---|
[13256] | 372 | [TestMethod]
|
---|
| 373 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 374 | [TestProperty("Time", "long")]
|
---|
[13315] | 375 | public void TestInterpretersEstimatedValuesConsistency() {
|
---|
[13256] | 376 | var twister = new MersenneTwister();
|
---|
| 377 | int seed = twister.Next(0, int.MaxValue);
|
---|
| 378 | twister.Seed((uint)seed);
|
---|
| 379 | const int numRows = 100;
|
---|
| 380 | var dataset = Util.CreateRandomDataset(twister, numRows, Columns);
|
---|
| 381 |
|
---|
| 382 | var grammar = new TypeCoherentExpressionGrammar();
|
---|
| 383 |
|
---|
| 384 | var interpreters = new ISymbolicDataAnalysisExpressionTreeInterpreter[] {
|
---|
| 385 | new SymbolicDataAnalysisExpressionTreeLinearInterpreter(),
|
---|
| 386 | new SymbolicDataAnalysisExpressionTreeInterpreter(),
|
---|
| 387 | };
|
---|
| 388 |
|
---|
| 389 | var rows = Enumerable.Range(0, numRows).ToList();
|
---|
[13313] | 390 | var randomTrees = Util.CreateRandomTrees(twister, dataset, grammar, N, 1, 10, 0, 0);
|
---|
| 391 | foreach (ISymbolicExpressionTree tree in randomTrees) {
|
---|
| 392 | Util.InitTree(tree, twister, new List<string>(dataset.VariableNames));
|
---|
| 393 | }
|
---|
| 394 |
|
---|
[13256] | 395 | for (int i = 0; i < randomTrees.Length; ++i) {
|
---|
| 396 | var tree = randomTrees[i];
|
---|
| 397 | var valuesMatrix = interpreters.Select(x => x.GetSymbolicExpressionTreeValues(tree, dataset, rows)).ToList();
|
---|
| 398 | for (int m = 0; m < interpreters.Length - 1; ++m) {
|
---|
| 399 | var sum = valuesMatrix[m].Sum();
|
---|
| 400 | for (int n = m + 1; n < interpreters.Length; ++n) {
|
---|
| 401 | var s = valuesMatrix[n].Sum();
|
---|
| 402 | if (double.IsNaN(sum) && double.IsNaN(s)) continue;
|
---|
| 403 |
|
---|
[13313] | 404 | string errorMessage = string.Format("Interpreters {0} and {1} do not agree on tree {2} (seed = {3}).", interpreters[m].Name, interpreters[n].Name, i, seed);
|
---|
| 405 | Assert.AreEqual(sum, s, 1e-12, errorMessage);
|
---|
[13256] | 406 | }
|
---|
| 407 | }
|
---|
| 408 | }
|
---|
| 409 | }
|
---|
| 410 |
|
---|
[13313] | 411 | [TestMethod]
|
---|
| 412 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
| 413 | [TestProperty("Time", "long")]
|
---|
[13315] | 414 | public void TestCompiledInterpreterEstimatedValuesConsistency() {
|
---|
| 415 | const double delta = 1e-12;
|
---|
[13313] | 416 |
|
---|
| 417 | var twister = new MersenneTwister();
|
---|
| 418 | int seed = twister.Next(0, int.MaxValue);
|
---|
| 419 | twister.Seed((uint)seed);
|
---|
| 420 |
|
---|
| 421 | Console.WriteLine(seed);
|
---|
| 422 |
|
---|
| 423 | const int numRows = 100;
|
---|
| 424 | var dataset = Util.CreateRandomDataset(twister, numRows, Columns);
|
---|
| 425 |
|
---|
| 426 | var grammar = new TypeCoherentExpressionGrammar();
|
---|
[13315] | 427 | grammar.ConfigureAsDefaultRegressionGrammar();
|
---|
[13318] | 428 | grammar.Symbols.First(x => x.Name == "Power Functions").Enabled = true;
|
---|
| 429 |
|
---|
[13313] | 430 | var randomTrees = Util.CreateRandomTrees(twister, dataset, grammar, N, 1, 10, 0, 0);
|
---|
| 431 | foreach (ISymbolicExpressionTree tree in randomTrees) {
|
---|
| 432 | Util.InitTree(tree, twister, new List<string>(dataset.VariableNames));
|
---|
| 433 | }
|
---|
| 434 |
|
---|
| 435 | var interpreters = new ISymbolicDataAnalysisExpressionTreeInterpreter[] {
|
---|
[14354] | 436 | new SymbolicDataAnalysisExpressionCompiledTreeInterpreter(),
|
---|
[13313] | 437 | new SymbolicDataAnalysisExpressionTreeInterpreter(),
|
---|
[13315] | 438 | new SymbolicDataAnalysisExpressionTreeLinearInterpreter(),
|
---|
[13313] | 439 | };
|
---|
| 440 | var rows = Enumerable.Range(0, numRows).ToList();
|
---|
| 441 | var formatter = new SymbolicExpressionTreeHierarchicalFormatter();
|
---|
| 442 |
|
---|
| 443 | for (int i = 0; i < randomTrees.Length; ++i) {
|
---|
| 444 | var tree = randomTrees[i];
|
---|
[13315] | 445 | var valuesMatrix = interpreters.Select(x => x.GetSymbolicExpressionTreeValues(tree, dataset, rows).ToList()).ToList();
|
---|
[13313] | 446 | for (int m = 0; m < interpreters.Length - 1; ++m) {
|
---|
| 447 | for (int n = m + 1; n < interpreters.Length; ++n) {
|
---|
| 448 | for (int row = 0; row < numRows; ++row) {
|
---|
| 449 | var v1 = valuesMatrix[m][row];
|
---|
| 450 | var v2 = valuesMatrix[n][row];
|
---|
| 451 | if (double.IsNaN(v1) && double.IsNaN(v2)) continue;
|
---|
| 452 | if (Math.Abs(v1 - v2) > delta) {
|
---|
| 453 | Console.WriteLine(formatter.Format(tree));
|
---|
| 454 | foreach (var node in tree.Root.GetSubtree(0).GetSubtree(0).IterateNodesPrefix().ToList()) {
|
---|
| 455 | var rootNode = (SymbolicExpressionTreeTopLevelNode)grammar.ProgramRootSymbol.CreateTreeNode();
|
---|
| 456 | if (rootNode.HasLocalParameters) rootNode.ResetLocalParameters(twister);
|
---|
| 457 | rootNode.SetGrammar(grammar.CreateExpressionTreeGrammar());
|
---|
| 458 |
|
---|
| 459 | var startNode = (SymbolicExpressionTreeTopLevelNode)grammar.StartSymbol.CreateTreeNode();
|
---|
| 460 | if (startNode.HasLocalParameters) startNode.ResetLocalParameters(twister);
|
---|
| 461 | startNode.SetGrammar(grammar.CreateExpressionTreeGrammar());
|
---|
| 462 |
|
---|
| 463 | rootNode.AddSubtree(startNode);
|
---|
| 464 | var t = new SymbolicExpressionTree(rootNode);
|
---|
| 465 | var start = t.Root.GetSubtree(0);
|
---|
| 466 | var p = node.Parent;
|
---|
| 467 | start.AddSubtree(node);
|
---|
| 468 | Console.WriteLine(node);
|
---|
| 469 |
|
---|
| 470 | var y1 = interpreters[m].GetSymbolicExpressionTreeValues(t, dataset, new[] { row }).First();
|
---|
| 471 | var y2 = interpreters[n].GetSymbolicExpressionTreeValues(t, dataset, new[] { row }).First();
|
---|
| 472 |
|
---|
| 473 | if (double.IsNaN(y1) && double.IsNaN(y2)) continue;
|
---|
| 474 | string prefix = Math.Abs(y1 - y2) > delta ? "++" : "==";
|
---|
[13314] | 475 | Console.WriteLine("\t{0} Row {1}: {2} {3}, Deviation = {4}", prefix, row, y1, y2, Math.Abs(y1 - y2));
|
---|
[13313] | 476 | node.Parent = p;
|
---|
| 477 | }
|
---|
| 478 | }
|
---|
| 479 | string errorMessage = string.Format("Interpreters {0} and {1} do not agree on tree {2} and row {3} (seed = {4}).", interpreters[m].Name, interpreters[n].Name, i, row, seed);
|
---|
| 480 | Assert.AreEqual(v1, v2, delta, errorMessage);
|
---|
| 481 | }
|
---|
| 482 | }
|
---|
| 483 | }
|
---|
| 484 | }
|
---|
| 485 | }
|
---|
| 486 |
|
---|
[13315] | 487 | private void EvaluateTerminals(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, IDataset ds) {
|
---|
[5574] | 488 | // constants
|
---|
| 489 | Evaluate(interpreter, ds, "(+ 1.5 3.5)", 0, 5.0);
|
---|
| 490 |
|
---|
| 491 | // variables
|
---|
| 492 | Evaluate(interpreter, ds, "(variable 2.0 a)", 0, 2.0);
|
---|
| 493 | Evaluate(interpreter, ds, "(variable 2.0 a)", 1, 4.0);
|
---|
[6732] | 494 | }
|
---|
[5574] | 495 |
|
---|
[13315] | 496 | private void EvaluateAdf(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, IDataset ds) {
|
---|
[5574] | 497 |
|
---|
[6732] | 498 | // ADF
|
---|
| 499 | Evaluate(interpreter, ds, @"(PROG
|
---|
| 500 | (MAIN
|
---|
| 501 | (CALL ADF0))
|
---|
| 502 | (defun ADF0 1.0))", 1, 1.0);
|
---|
| 503 | Evaluate(interpreter, ds, @"(PROG
|
---|
| 504 | (MAIN
|
---|
| 505 | (* (CALL ADF0) (CALL ADF0)))
|
---|
| 506 | (defun ADF0 2.0))", 1, 4.0);
|
---|
| 507 | Evaluate(interpreter, ds, @"(PROG
|
---|
| 508 | (MAIN
|
---|
| 509 | (CALL ADF0 2.0 3.0))
|
---|
| 510 | (defun ADF0
|
---|
| 511 | (+ (ARG 0) (ARG 1))))", 1, 5.0);
|
---|
| 512 | Evaluate(interpreter, ds, @"(PROG
|
---|
| 513 | (MAIN (CALL ADF1 2.0 3.0))
|
---|
| 514 | (defun ADF0
|
---|
| 515 | (- (ARG 1) (ARG 0)))
|
---|
| 516 | (defun ADF1
|
---|
| 517 | (+ (CALL ADF0 (ARG 1) (ARG 0))
|
---|
| 518 | (CALL ADF0 (ARG 0) (ARG 1)))))", 1, 0.0);
|
---|
| 519 | Evaluate(interpreter, ds, @"(PROG
|
---|
| 520 | (MAIN (CALL ADF1 (variable 2.0 a) 3.0))
|
---|
| 521 | (defun ADF0
|
---|
| 522 | (- (ARG 1) (ARG 0)))
|
---|
| 523 | (defun ADF1
|
---|
| 524 | (CALL ADF0 (ARG 1) (ARG 0))))", 1, 1.0);
|
---|
| 525 | Evaluate(interpreter, ds,
|
---|
| 526 | @"(PROG
|
---|
| 527 | (MAIN (CALL ADF1 (variable 2.0 a) 3.0))
|
---|
| 528 | (defun ADF0
|
---|
| 529 | (- (ARG 1) (ARG 0)))
|
---|
| 530 | (defun ADF1
|
---|
| 531 | (+ (CALL ADF0 (ARG 1) (ARG 0))
|
---|
| 532 | (CALL ADF0 (ARG 0) (ARG 1)))))", 1, 0.0);
|
---|
| 533 | }
|
---|
| 534 |
|
---|
[13315] | 535 | private void EvaluateSpecialFunctions(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, IDataset ds) {
|
---|
| 536 | // special functions
|
---|
| 537 | Action<double> checkAiry = (x) => {
|
---|
| 538 | double ai, aip, bi, bip;
|
---|
| 539 | alglib.airy(x, out ai, out aip, out bi, out bip);
|
---|
| 540 | Evaluate(interpreter, ds, "(airya " + x + ")", 0, ai);
|
---|
| 541 | Evaluate(interpreter, ds, "(airyb " + x + ")", 0, bi);
|
---|
| 542 | };
|
---|
| 543 |
|
---|
| 544 | Action<double> checkBessel = (x) => {
|
---|
| 545 | Evaluate(interpreter, ds, "(bessel " + x + ")", 0, alglib.besseli0(x));
|
---|
| 546 | };
|
---|
| 547 |
|
---|
| 548 | Action<double> checkSinCosIntegrals = (x) => {
|
---|
| 549 | double si, ci;
|
---|
| 550 | alglib.sinecosineintegrals(x, out si, out ci);
|
---|
| 551 | Evaluate(interpreter, ds, "(cosint " + x + ")", 0, ci);
|
---|
| 552 | Evaluate(interpreter, ds, "(sinint " + x + ")", 0, si);
|
---|
| 553 | };
|
---|
| 554 | Action<double> checkHypSinCosIntegrals = (x) => {
|
---|
| 555 | double shi, chi;
|
---|
| 556 | alglib.hyperbolicsinecosineintegrals(x, out shi, out chi);
|
---|
| 557 | Evaluate(interpreter, ds, "(hypcosint " + x + ")", 0, chi);
|
---|
| 558 | Evaluate(interpreter, ds, "(hypsinint " + x + ")", 0, shi);
|
---|
| 559 | };
|
---|
| 560 | Action<double> checkFresnelSinCosIntegrals = (x) => {
|
---|
| 561 | double c = 0, s = 0;
|
---|
| 562 | alglib.fresnelintegral(x, ref c, ref s);
|
---|
| 563 | Evaluate(interpreter, ds, "(fresnelcosint " + x + ")", 0, c);
|
---|
| 564 | Evaluate(interpreter, ds, "(fresnelsinint " + x + ")", 0, s);
|
---|
| 565 | };
|
---|
| 566 | Action<double> checkNormErf = (x) => {
|
---|
| 567 | Evaluate(interpreter, ds, "(norm " + x + ")", 0, alglib.normaldistribution(x));
|
---|
| 568 | Evaluate(interpreter, ds, "(erf " + x + ")", 0, alglib.errorfunction(x));
|
---|
| 569 | };
|
---|
| 570 |
|
---|
| 571 | Action<double> checkGamma = (x) => {
|
---|
| 572 | Evaluate(interpreter, ds, "(gamma " + x + ")", 0, alglib.gammafunction(x));
|
---|
| 573 | };
|
---|
| 574 | Action<double> checkPsi = (x) => {
|
---|
| 575 | try {
|
---|
| 576 | Evaluate(interpreter, ds, "(psi " + x + ")", 0, alglib.psi(x));
|
---|
[14810] | 577 | } catch (alglib.alglibexception) { // ignore cases where alglib throws an exception
|
---|
[13315] | 578 | }
|
---|
| 579 | };
|
---|
| 580 | Action<double> checkDawson = (x) => {
|
---|
| 581 | Evaluate(interpreter, ds, "(dawson " + x + ")", 0, alglib.dawsonintegral(x));
|
---|
| 582 | };
|
---|
| 583 | Action<double> checkExpInt = (x) => {
|
---|
| 584 | Evaluate(interpreter, ds, "(expint " + x + ")", 0, alglib.exponentialintegralei(x));
|
---|
| 585 | };
|
---|
| 586 |
|
---|
| 587 | foreach (var e in new[] { -2.0, -1.0, 0.0, 1.0, 2.0 }) {
|
---|
| 588 | checkAiry(e);
|
---|
| 589 | checkBessel(e);
|
---|
| 590 | checkSinCosIntegrals(e);
|
---|
| 591 | checkGamma(e);
|
---|
| 592 | checkExpInt(e);
|
---|
| 593 | checkDawson(e);
|
---|
| 594 | checkPsi(e);
|
---|
| 595 | checkNormErf(e);
|
---|
| 596 | checkFresnelSinCosIntegrals(e);
|
---|
| 597 | checkHypSinCosIntegrals(e);
|
---|
| 598 | }
|
---|
| 599 | }
|
---|
| 600 |
|
---|
| 601 | private void EvaluateLaggedOperations(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, IDataset ds) {
|
---|
| 602 | // lag
|
---|
| 603 | Evaluate(interpreter, ds, "(lagVariable 1.0 a -1) ", 1, ds.GetDoubleValue("A", 0));
|
---|
| 604 | Evaluate(interpreter, ds, "(lagVariable 1.0 a -1) ", 2, ds.GetDoubleValue("A", 1));
|
---|
| 605 | Evaluate(interpreter, ds, "(lagVariable 1.0 a 0) ", 2, ds.GetDoubleValue("A", 2));
|
---|
| 606 | Evaluate(interpreter, ds, "(lagVariable 1.0 a 1) ", 0, ds.GetDoubleValue("A", 1));
|
---|
| 607 |
|
---|
| 608 | // integral
|
---|
| 609 | Evaluate(interpreter, ds, "(integral -1.0 (variable 1.0 a)) ", 1, ds.GetDoubleValue("A", 0) + ds.GetDoubleValue("A", 1));
|
---|
| 610 | Evaluate(interpreter, ds, "(integral -1.0 (lagVariable 1.0 a 1)) ", 1, ds.GetDoubleValue("A", 1) + ds.GetDoubleValue("A", 2));
|
---|
| 611 | Evaluate(interpreter, ds, "(integral -2.0 (variable 1.0 a)) ", 2, ds.GetDoubleValue("A", 0) + ds.GetDoubleValue("A", 1) + ds.GetDoubleValue("A", 2));
|
---|
| 612 | Evaluate(interpreter, ds, "(integral -1.0 (* (variable 1.0 a) (variable 1.0 b)))", 1, ds.GetDoubleValue("A", 0) * ds.GetDoubleValue("B", 0) + ds.GetDoubleValue("A", 1) * ds.GetDoubleValue("B", 1));
|
---|
| 613 | Evaluate(interpreter, ds, "(integral -2.0 3.0)", 1, 9.0);
|
---|
| 614 |
|
---|
| 615 | // derivative
|
---|
| 616 | // (f_0 + 2 * f_1 - 2 * f_3 - f_4) / 8; // h = 1
|
---|
| 617 | Evaluate(interpreter, ds, "(diff (variable 1.0 a)) ", 5, (ds.GetDoubleValue("A", 5) + 2 * ds.GetDoubleValue("A", 4) - 2 * ds.GetDoubleValue("A", 2) - ds.GetDoubleValue("A", 1)) / 8.0);
|
---|
| 618 | Evaluate(interpreter, ds, "(diff (variable 1.0 b)) ", 5, (ds.GetDoubleValue("B", 5) + 2 * ds.GetDoubleValue("B", 4) - 2 * ds.GetDoubleValue("B", 2) - ds.GetDoubleValue("B", 1)) / 8.0);
|
---|
| 619 | Evaluate(interpreter, ds, "(diff (* (variable 1.0 a) (variable 1.0 b)))", 5, +
|
---|
| 620 | (ds.GetDoubleValue("A", 5) * ds.GetDoubleValue("B", 5) +
|
---|
| 621 | 2 * ds.GetDoubleValue("A", 4) * ds.GetDoubleValue("B", 4) -
|
---|
| 622 | 2 * ds.GetDoubleValue("A", 2) * ds.GetDoubleValue("B", 2) -
|
---|
| 623 | ds.GetDoubleValue("A", 1) * ds.GetDoubleValue("B", 1)) / 8.0);
|
---|
| 624 | Evaluate(interpreter, ds, "(diff -2.0 3.0)", 5, 0.0);
|
---|
| 625 |
|
---|
| 626 | // timelag
|
---|
| 627 | Evaluate(interpreter, ds, "(lag -1.0 (lagVariable 1.0 a 2)) ", 1, ds.GetDoubleValue("A", 2));
|
---|
| 628 | Evaluate(interpreter, ds, "(lag -2.0 (lagVariable 1.0 a 2)) ", 2, ds.GetDoubleValue("A", 2));
|
---|
| 629 | Evaluate(interpreter, ds, "(lag -1.0 (* (lagVariable 1.0 a 1) (lagVariable 1.0 b 2)))", 1, ds.GetDoubleValue("A", 1) * ds.GetDoubleValue("B", 2));
|
---|
| 630 | Evaluate(interpreter, ds, "(lag -2.0 3.0)", 1, 3.0);
|
---|
| 631 | }
|
---|
| 632 |
|
---|
| 633 | private void EvaluateOperations(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, IDataset ds) {
|
---|
[5574] | 634 | // addition
|
---|
| 635 | Evaluate(interpreter, ds, "(+ (variable 2.0 a ))", 1, 4.0);
|
---|
| 636 | Evaluate(interpreter, ds, "(+ (variable 2.0 a ) (variable 3.0 b ))", 0, 5.0);
|
---|
| 637 | Evaluate(interpreter, ds, "(+ (variable 2.0 a ) (variable 3.0 b ))", 1, 10.0);
|
---|
| 638 | Evaluate(interpreter, ds, "(+ (variable 2.0 a) (variable 3.0 b ))", 2, 8.0);
|
---|
| 639 | Evaluate(interpreter, ds, "(+ 8.0 2.0 2.0)", 0, 12.0);
|
---|
| 640 |
|
---|
| 641 | // subtraction
|
---|
| 642 | Evaluate(interpreter, ds, "(- (variable 2.0 a ))", 1, -4.0);
|
---|
| 643 | Evaluate(interpreter, ds, "(- (variable 2.0 a ) (variable 3.0 b))", 0, -1.0);
|
---|
| 644 | Evaluate(interpreter, ds, "(- (variable 2.0 a ) (variable 3.0 b ))", 1, -2.0);
|
---|
| 645 | Evaluate(interpreter, ds, "(- (variable 2.0 a ) (variable 3.0 b ))", 2, -4.0);
|
---|
| 646 | Evaluate(interpreter, ds, "(- 8.0 2.0 2.0)", 0, 4.0);
|
---|
| 647 |
|
---|
| 648 | // multiplication
|
---|
| 649 | Evaluate(interpreter, ds, "(* (variable 2.0 a ))", 0, 2.0);
|
---|
| 650 | Evaluate(interpreter, ds, "(* (variable 2.0 a ) (variable 3.0 b ))", 0, 6.0);
|
---|
| 651 | Evaluate(interpreter, ds, "(* (variable 2.0 a ) (variable 3.0 b ))", 1, 24.0);
|
---|
| 652 | Evaluate(interpreter, ds, "(* (variable 2.0 a ) (variable 3.0 b ))", 2, 12.0);
|
---|
| 653 | Evaluate(interpreter, ds, "(* 8.0 2.0 2.0)", 0, 32.0);
|
---|
| 654 |
|
---|
| 655 | // division
|
---|
| 656 | Evaluate(interpreter, ds, "(/ (variable 2.0 a ))", 1, 1.0 / 4.0);
|
---|
| 657 | Evaluate(interpreter, ds, "(/ (variable 2.0 a ) 2.0)", 0, 1.0);
|
---|
| 658 | Evaluate(interpreter, ds, "(/ (variable 2.0 a ) 2.0)", 1, 2.0);
|
---|
| 659 | Evaluate(interpreter, ds, "(/ (variable 3.0 b ) 2.0)", 2, 3.0);
|
---|
| 660 | Evaluate(interpreter, ds, "(/ 8.0 2.0 2.0)", 0, 2.0);
|
---|
| 661 |
|
---|
| 662 | // gt
|
---|
| 663 | Evaluate(interpreter, ds, "(> (variable 2.0 a) 2.0)", 0, -1.0);
|
---|
| 664 | Evaluate(interpreter, ds, "(> 2.0 (variable 2.0 a))", 0, -1.0);
|
---|
| 665 | Evaluate(interpreter, ds, "(> (variable 2.0 a) 1.9)", 0, 1.0);
|
---|
| 666 | Evaluate(interpreter, ds, "(> 1.9 (variable 2.0 a))", 0, -1.0);
|
---|
[6732] | 667 | Evaluate(interpreter, ds, "(> (log -1.0) (log -1.0))", 0, -1.0); // (> nan nan) should be false
|
---|
[5574] | 668 |
|
---|
| 669 | // lt
|
---|
| 670 | Evaluate(interpreter, ds, "(< (variable 2.0 a) 2.0)", 0, -1.0);
|
---|
| 671 | Evaluate(interpreter, ds, "(< 2.0 (variable 2.0 a))", 0, -1.0);
|
---|
| 672 | Evaluate(interpreter, ds, "(< (variable 2.0 a) 1.9)", 0, -1.0);
|
---|
| 673 | Evaluate(interpreter, ds, "(< 1.9 (variable 2.0 a))", 0, 1.0);
|
---|
[6732] | 674 | Evaluate(interpreter, ds, "(< (log -1.0) (log -1.0))", 0, -1.0); // (< nan nan) should be false
|
---|
[5574] | 675 |
|
---|
| 676 | // If
|
---|
| 677 | Evaluate(interpreter, ds, "(if -10.0 2.0 3.0)", 0, 3.0);
|
---|
| 678 | Evaluate(interpreter, ds, "(if -1.0 2.0 3.0)", 0, 3.0);
|
---|
| 679 | Evaluate(interpreter, ds, "(if 0.0 2.0 3.0)", 0, 3.0);
|
---|
| 680 | Evaluate(interpreter, ds, "(if 1.0 2.0 3.0)", 0, 2.0);
|
---|
| 681 | Evaluate(interpreter, ds, "(if 10.0 2.0 3.0)", 0, 2.0);
|
---|
[6732] | 682 | Evaluate(interpreter, ds, "(if (log -1.0) 2.0 3.0)", 0, 3.0); // if(nan) should return the else branch
|
---|
[5574] | 683 |
|
---|
| 684 | // NOT
|
---|
| 685 | Evaluate(interpreter, ds, "(not -1.0)", 0, 1.0);
|
---|
| 686 | Evaluate(interpreter, ds, "(not -2.0)", 0, 1.0);
|
---|
| 687 | Evaluate(interpreter, ds, "(not 1.0)", 0, -1.0);
|
---|
| 688 | Evaluate(interpreter, ds, "(not 2.0)", 0, -1.0);
|
---|
| 689 | Evaluate(interpreter, ds, "(not 0.0)", 0, 1.0);
|
---|
[6732] | 690 | Evaluate(interpreter, ds, "(not (log -1.0))", 0, 1.0);
|
---|
[5574] | 691 |
|
---|
| 692 | // AND
|
---|
| 693 | Evaluate(interpreter, ds, "(and -1.0 -2.0)", 0, -1.0);
|
---|
| 694 | Evaluate(interpreter, ds, "(and -1.0 2.0)", 0, -1.0);
|
---|
| 695 | Evaluate(interpreter, ds, "(and 1.0 -2.0)", 0, -1.0);
|
---|
| 696 | Evaluate(interpreter, ds, "(and 1.0 0.0)", 0, -1.0);
|
---|
| 697 | Evaluate(interpreter, ds, "(and 0.0 0.0)", 0, -1.0);
|
---|
| 698 | Evaluate(interpreter, ds, "(and 1.0 2.0)", 0, 1.0);
|
---|
| 699 | Evaluate(interpreter, ds, "(and 1.0 2.0 3.0)", 0, 1.0);
|
---|
| 700 | Evaluate(interpreter, ds, "(and 1.0 -2.0 3.0)", 0, -1.0);
|
---|
[6732] | 701 | Evaluate(interpreter, ds, "(and (log -1.0))", 0, -1.0); // (and NaN)
|
---|
| 702 | Evaluate(interpreter, ds, "(and (log -1.0) 1.0)", 0, -1.0); // (and NaN 1.0)
|
---|
[5574] | 703 |
|
---|
| 704 | // OR
|
---|
| 705 | Evaluate(interpreter, ds, "(or -1.0 -2.0)", 0, -1.0);
|
---|
| 706 | Evaluate(interpreter, ds, "(or -1.0 2.0)", 0, 1.0);
|
---|
| 707 | Evaluate(interpreter, ds, "(or 1.0 -2.0)", 0, 1.0);
|
---|
| 708 | Evaluate(interpreter, ds, "(or 1.0 2.0)", 0, 1.0);
|
---|
| 709 | Evaluate(interpreter, ds, "(or 0.0 0.0)", 0, -1.0);
|
---|
| 710 | Evaluate(interpreter, ds, "(or -1.0 -2.0 -3.0)", 0, -1.0);
|
---|
| 711 | Evaluate(interpreter, ds, "(or -1.0 -2.0 3.0)", 0, 1.0);
|
---|
[6732] | 712 | Evaluate(interpreter, ds, "(or (log -1.0))", 0, -1.0); // (or NaN)
|
---|
| 713 | Evaluate(interpreter, ds, "(or (log -1.0) 1.0)", 0, -1.0); // (or NaN 1.0)
|
---|
[5574] | 714 |
|
---|
[10790] | 715 | // XOR
|
---|
| 716 | Evaluate(interpreter, ds, "(xor -1.0 -2.0)", 0, -1.0);
|
---|
| 717 | Evaluate(interpreter, ds, "(xor -1.0 2.0)", 0, 1.0);
|
---|
| 718 | Evaluate(interpreter, ds, "(xor 1.0 -2.0)", 0, 1.0);
|
---|
| 719 | Evaluate(interpreter, ds, "(xor 1.0 2.0)", 0, -1.0);
|
---|
| 720 | Evaluate(interpreter, ds, "(xor 0.0 0.0)", 0, -1.0);
|
---|
| 721 | Evaluate(interpreter, ds, "(xor -1.0 -2.0 -3.0)", 0, -1.0);
|
---|
| 722 | Evaluate(interpreter, ds, "(xor -1.0 -2.0 3.0)", 0, 1.0);
|
---|
| 723 | Evaluate(interpreter, ds, "(xor -1.0 2.0 3.0)", 0, -1.0);
|
---|
| 724 | Evaluate(interpreter, ds, "(xor 1.0 2.0 3.0)", 0, 1.0);
|
---|
| 725 | Evaluate(interpreter, ds, "(xor (log -1.0))", 0, -1.0);
|
---|
[11430] | 726 | Evaluate(interpreter, ds, "(xor (log -1.0) 1.0)", 0, 1.0);
|
---|
[10790] | 727 |
|
---|
[5574] | 728 | // sin, cos, tan
|
---|
| 729 | Evaluate(interpreter, ds, "(sin " + Math.PI.ToString(NumberFormatInfo.InvariantInfo) + ")", 0, 0.0);
|
---|
| 730 | Evaluate(interpreter, ds, "(sin 0.0)", 0, 0.0);
|
---|
| 731 | Evaluate(interpreter, ds, "(cos " + Math.PI.ToString(NumberFormatInfo.InvariantInfo) + ")", 0, -1.0);
|
---|
| 732 | Evaluate(interpreter, ds, "(cos 0.0)", 0, 1.0);
|
---|
| 733 | Evaluate(interpreter, ds, "(tan " + Math.PI.ToString(NumberFormatInfo.InvariantInfo) + ")", 0, Math.Tan(Math.PI));
|
---|
| 734 | Evaluate(interpreter, ds, "(tan 0.0)", 0, Math.Tan(Math.PI));
|
---|
| 735 |
|
---|
| 736 | // exp, log
|
---|
| 737 | Evaluate(interpreter, ds, "(log (exp 7.0))", 0, Math.Log(Math.Exp(7)));
|
---|
| 738 | Evaluate(interpreter, ds, "(exp (log 7.0))", 0, Math.Exp(Math.Log(7)));
|
---|
| 739 | Evaluate(interpreter, ds, "(log -3.0)", 0, Math.Log(-3));
|
---|
| 740 |
|
---|
[6755] | 741 | // power
|
---|
| 742 | Evaluate(interpreter, ds, "(pow 2.0 3.0)", 0, 8.0);
|
---|
| 743 | Evaluate(interpreter, ds, "(pow 4.0 0.5)", 0, 1.0); // interpreter should round to the nearest integer value value (.5 is rounded to the even number)
|
---|
| 744 | Evaluate(interpreter, ds, "(pow 4.0 2.5)", 0, 16.0); // interpreter should round to the nearest integer value value (.5 is rounded to the even number)
|
---|
| 745 | Evaluate(interpreter, ds, "(pow -2.0 3.0)", 0, -8.0);
|
---|
| 746 | Evaluate(interpreter, ds, "(pow 2.0 -3.0)", 0, 1.0 / 8.0);
|
---|
| 747 | Evaluate(interpreter, ds, "(pow -2.0 -3.0)", 0, -1.0 / 8.0);
|
---|
| 748 |
|
---|
| 749 | // root
|
---|
| 750 | Evaluate(interpreter, ds, "(root 9.0 2.0)", 0, 3.0);
|
---|
| 751 | Evaluate(interpreter, ds, "(root 27.0 3.0)", 0, 3.0);
|
---|
| 752 | Evaluate(interpreter, ds, "(root 2.0 -3.0)", 0, Math.Pow(2.0, -1.0 / 3.0));
|
---|
| 753 |
|
---|
[5574] | 754 | // mean
|
---|
| 755 | Evaluate(interpreter, ds, "(mean -1.0 1.0 -1.0)", 0, -1.0 / 3.0);
|
---|
| 756 | }
|
---|
| 757 |
|
---|
[13315] | 758 | private void Evaluate(ISymbolicDataAnalysisExpressionTreeInterpreter interpreter, IDataset ds, string expr, int index, double expected) {
|
---|
[5574] | 759 | var importer = new SymbolicExpressionImporter();
|
---|
| 760 | ISymbolicExpressionTree tree = importer.Import(expr);
|
---|
| 761 |
|
---|
| 762 | double actual = interpreter.GetSymbolicExpressionTreeValues(tree, ds, Enumerable.Range(index, 1)).First();
|
---|
| 763 |
|
---|
[6809] | 764 | Assert.IsFalse(double.IsNaN(actual) && !double.IsNaN(expected));
|
---|
| 765 | Assert.IsFalse(!double.IsNaN(actual) && double.IsNaN(expected));
|
---|
[11430] | 766 | if (!double.IsNaN(actual) && !double.IsNaN(expected))
|
---|
| 767 | Assert.AreEqual(expected, actual, 1.0E-12, expr);
|
---|
[5574] | 768 | }
|
---|
| 769 | }
|
---|
| 770 | }
|
---|