Free cookie consent management tool by TermsFeed Policy Generator

source: trunk/sources/HeuristicLab.Tests/HeuristicLab.Encodings.SymbolicExpressionTreeEncoding-3.4/ProbabilisticTreeCreaterTest.cs @ 6911

Last change on this file since 6911 was 6911, checked in by mkommend, 11 years ago

#1657: Corrected and adapted implementation of !PTC2 to handle symbol frequencies correctly and to always create trees of the target size. Additionally the performance of the grammars have been improved and a unit test was added.

File size: 4.5 KB
Line 
1#region License Information
2/* HeuristicLab
3 * Copyright (C) 2002-2011 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;
23using System.Collections.Generic;
24using System.Diagnostics;
25using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
26using HeuristicLab.Random;
27using Microsoft.VisualStudio.TestTools.UnitTesting;
28
29namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding_3._4.Tests {
30  [TestClass]
31  public class ProbabilisticTreeCreaterTest {
32    private const int POPULATION_SIZE = 10000;
33    private const int MAX_TREE_LENGTH = 100;
34    private const int MAX_TREE_DEPTH = 10;
35    private TestContext testContextInstance;
36
37    /// <summary>
38    ///Gets or sets the test context which provides
39    ///information about and functionality for the current test run.
40    ///</summary>
41    public TestContext TestContext {
42      get {
43        return testContextInstance;
44      }
45      set {
46        testContextInstance = value;
47      }
48    }
49
50    [TestMethod()]
51    public void ProbabilisticTreeCreaterDistributionsTest() {
52      var randomTrees = new List<ISymbolicExpressionTree>();
53      var grammar = Grammars.CreateSimpleArithmeticGrammar();
54      var random = new MersenneTwister(31415);
55      var stopwatch = new Stopwatch();
56      stopwatch.Start();
57      for (int i = 0; i < POPULATION_SIZE; i++) {
58        randomTrees.Add(ProbabilisticTreeCreator.Create(random, grammar, MAX_TREE_LENGTH, MAX_TREE_DEPTH));
59      }
60      stopwatch.Stop();
61
62      foreach (var tree in randomTrees) {
63        Util.IsValid(tree);
64      }
65      double msPerRandomTreeCreation = stopwatch.ElapsedMilliseconds / (double)POPULATION_SIZE;
66
67      Console.WriteLine("ProbabilisticTreeCreator: " + Environment.NewLine +
68        msPerRandomTreeCreation + " ms per random tree (~" + Math.Round(1000.0 / (msPerRandomTreeCreation)) + "random trees / s)" + Environment.NewLine +
69        Util.GetSizeDistributionString(randomTrees, 105, 5) + Environment.NewLine +
70        Util.GetFunctionDistributionString(randomTrees) + Environment.NewLine +
71        Util.GetNumberOfSubtreesDistributionString(randomTrees) + Environment.NewLine +
72        Util.GetTerminalDistributionString(randomTrees) + Environment.NewLine
73        );
74      Assert.IsTrue(Math.Round(1000.0 / (msPerRandomTreeCreation)) > 250); // must achieve more than 250 random trees / s
75    }
76
77    [TestMethod]
78    public void ProbabilisticTreeCreatorSpecificTreeSizesTest() {
79      var trees = new List<ISymbolicExpressionTree>();
80      var grammar = Grammars.CreateSimpleArithmeticGrammar();
81      var random = new MersenneTwister(31415);
82      var treeGrammarType = SymbolicExpressionTreeGrammar_Accessor.ShadowedType.ReferencedType;
83
84
85      for (int targetTreeSize = 1; targetTreeSize <= 100; targetTreeSize++) {
86        var tree = new SymbolicExpressionTree();
87        var rootNode = (SymbolicExpressionTreeTopLevelNode)grammar.ProgramRootSymbol.CreateTreeNode();
88        rootNode.SetGrammar((ISymbolicExpressionTreeGrammar)Activator.CreateInstance(treeGrammarType, grammar));
89        if (rootNode.HasLocalParameters) rootNode.ResetLocalParameters(random);
90        var startNode = (SymbolicExpressionTreeTopLevelNode)grammar.StartSymbol.CreateTreeNode();
91        startNode.SetGrammar((ISymbolicExpressionTreeGrammar)Activator.CreateInstance(treeGrammarType, grammar));
92        if (startNode.HasLocalParameters) startNode.ResetLocalParameters(random);
93        rootNode.AddSubtree(startNode);
94
95        ProbabilisticTreeCreator_Accessor.TryCreateFullTreeFromSeed(random, startNode, targetTreeSize, ((int)Math.Log(targetTreeSize, 2)) + 1);
96        tree.Root = rootNode;
97        Assert.AreEqual(targetTreeSize + 2, tree.Length);  //the root and start node must be additionally added
98      }
99    }
100  }
101}
Note: See TracBrowser for help on using the repository browser.