Changeset 286 for trunk/sources/HeuristicLab.StructureIdentification

Timestamp:

06/03/08 16:21:56 (17 years ago)

Author:

gkronber

Message:

• renamed RandomTreeCreator to RampedTreeCreator
• added ProbabilisticTreeCreator and method to create trees with a more uniform size distribution (actual distribution still depends on the arity of functions in the function library)

Location:

trunk/sources/HeuristicLab.StructureIdentification

Files:

• HeuristicLab.StructureIdentification.csproj (modified) (1 diff)
• ProbabilisticTreeCreator.cs (added)
• RampedTreeCreator.cs (moved) (moved from trunk/sources/HeuristicLab.StructureIdentification/RandomTreeCreator.cs) (1 diff)
• TreeGardener.cs (modified) (1 diff)

trunk/sources/HeuristicLab.StructureIdentification/HeuristicLab.StructureIdentification.csproj

@@ -48 +48 @@
   </ItemGroup>
   <ItemGroup>
+    <Compile Include="ProbabilisticTreeCreator.cs" />
     <Compile Include="Evaluation\CoefficientOfDeterminationEvaluator.cs" />
     <Compile Include="Evaluation\MCCEvaluator.cs" />

trunk/sources/HeuristicLab.StructureIdentification/RampedTreeCreator.cs

@@ -29 +29 @@
 
 namespace HeuristicLab.StructureIdentification {
-  public class RandomTreeCreator : OperatorBase {
+  public class RampedTreeCreator : OperatorBase {
     public override string Description {
       get { return @"Generates a new random operator tree."; }
     }
 
-    public RandomTreeCreator()
+    public RampedTreeCreator()
       : base() {
       AddVariableInfo(new VariableInfo("Random", "Uniform random number generator", typeof(MersenneTwister), VariableKind.In));

trunk/sources/HeuristicLab.StructureIdentification/TreeGardener.cs

@@ -97 +97 @@
       IFunctionTree tree = MakeUnbalancedTree(rootFunction, maxTreeSize - 1, maxTreeHeight - 1);
       return tree;
+    }
+
+    internal IFunctionTree PTC2(IRandom random, int size, int maxDepth) {
+      if(size == 1) return RandomSelect(terminals).GetTreeNode();
+      List<object[]> list = new List<object[]>();
+      IFunctionTree root = GetRandomRoot(size, maxDepth).GetTreeNode();
+      int currentSize = 1;
+      int minArity;
+      int maxArity;
+      GetMinMaxArity(root.Function, out minArity, out maxArity);
+      if(maxArity >= size) {
+        maxArity = size;
+      }
+      int actualArity = random.Next(minArity, maxArity + 1);
+      for(int i=0;i<actualArity;i++) {
+        // insert a dummy sub-tree and add the pending extension to the list
+        root.AddSubTree(null);
+        list.Add(new object[] {root, i, 2});
+      }
+
+      while(list.Count > 0 && list.Count + currentSize < size) {
+        int randomIndex = random.Next(list.Count);
+        object[] nextExtension = list[randomIndex];
+        list.RemoveAt(randomIndex);
+        IFunctionTree parent = (IFunctionTree)nextExtension[0];
+        int a = (int)nextExtension[1];
+        int d = (int)nextExtension[2];
+        if(d == maxDepth) {
+          parent.RemoveSubTree(a);
+          parent.InsertSubTree(a, RandomSelect(terminals).GetTreeNode());
+        } else {
+          IFunction selectedFunction = RandomSelect(functions);
+          IFunctionTree newTree = selectedFunction.GetTreeNode();
+          parent.RemoveSubTree(a);
+          parent.InsertSubTree(a, newTree);
+
+          GetMinMaxArity(selectedFunction, out minArity, out maxArity);
+          if(maxArity >= size) {
+            maxArity = size;
+          }
+          actualArity = random.Next(minArity, maxArity + 1);
+          for(int i = 0; i < actualArity; i++) {
+            // insert a dummy sub-tree and add the pending extension to the list
+            newTree.AddSubTree(null);
+            list.Add(new object[] { newTree, i, d + 1 });
+          }
+        }
+        currentSize++;
+      }
+      while(list.Count > 0) {
+        int randomIndex = random.Next(list.Count);
+        object[] nextExtension = list[randomIndex];
+        list.RemoveAt(randomIndex);
+        IFunctionTree parent = (IFunctionTree)nextExtension[0];
+        int a = (int)nextExtension[1];
+        int d = (int)nextExtension[2];
+        IFunction selectedTerminal = RandomSelect(terminals);
+        parent.RemoveSubTree(a);
+        parent.InsertSubTree(a, selectedTerminal.GetTreeNode());
+      }
+      return root;
     }