Changeset 11462 for branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Analyzers/SymbolicDataAnalysisUsefulGenesAnalyzer.cs

Timestamp:

10/14/14 01:37:43 (10 years ago)

Author:

bburlacu

Message:

#1772: Fixed bug and improved the SymbolicDataAnalysisUsefulGenesAnalyzer. Fixed very minor typo in the SymbolicDataAnalysisPoly10Analyzer.

Location:

branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Analyzers

Files:

• . (modified) (1 prop)
• SymbolicDataAnalysisUsefulGenesAnalyzer.cs (modified) (8 diffs)

branches/HeuristicLab.EvolutionTracking/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Analyzers/SymbolicDataAnalysisUsefulGenesAnalyzer.cs

@@ -45 +45 @@
     private const string UpdateCounterParameterName = "UpdateCounter";
     private const string UpdateIntervalParameterName = "UpdateInterval";
+    private const string MinimumGenerationsParameterName = "MinimumGenerations";
     private const string PruningProbabilityParameterName = "PruningProbability";
     private const string PercentageOfBestSolutionsParameterName = "PercentageOfBestSolutions";
     private const string PromotedSubtreesResultName = "Promoted subtrees";
+    private const string AverageQualityImprovementResultName = "Average quality improvement";
+    private const string AverageLengthReductionResultName = "Average length reduction";
     private const string RandomParameterName = "Random";
 
@@ -85 +88 @@
     public ValueParameter<IntValue> UpdateIntervalParameter {
       get { return (ValueParameter<IntValue>)Parameters[UpdateIntervalParameterName]; }
+    }
+
+    public ValueParameter<IntValue> MinimumGenerationsParameter {
+      get { return (ValueParameter<IntValue>)Parameters[MinimumGenerationsParameterName]; }
     }
 
@@ -105 +112 @@
       get { return UpdateIntervalParameter.Value.Value; }
       set { UpdateIntervalParameter.Value.Value = value; }
+    }
+
+    public int MinimumGenerations {
+      get { return MinimumGenerationsParameter.Value.Value; }
+      set { MinimumGenerationsParameter.Value.Value = value; }
     }
 
@@ -129 +141 @@
       Parameters.Add(new ValueParameter<IntValue>(UpdateCounterParameterName, new IntValue(0)));
       Parameters.Add(new ValueParameter<IntValue>(UpdateIntervalParameterName, new IntValue(1)));
-      Parameters.Add(new ValueParameter<PercentValue>(PercentageOfBestSolutionsParameterName, "How many of the best individuals should be pruned using this method."));
-      Parameters.Add(new ValueParameter<PercentValue>(PruningProbabilityParameterName, "The probability to apply pruning"));
+      Parameters.Add(new ValueParameter<IntValue>(MinimumGenerationsParameterName, "The minimum number of generations the algorithm must be let to evolve before applying this analyzer.", new IntValue(50)));
+      Parameters.Add(new ValueParameter<PercentValue>(PercentageOfBestSolutionsParameterName, "How many of the best individuals should be pruned using this method.", new PercentValue(1.0)));
+      Parameters.Add(new ValueParameter<PercentValue>(PruningProbabilityParameterName, "The probability to apply pruning", new PercentValue(0.1)));
       #endregion
     }
@@ -150 +163 @@
     }
 
+    public override void InitializeState() {
+      UpdateCounter = 0;
+      base.InitializeState();
+    }
+
     public override IOperation Apply() {
+      int generations = GenerationsParameter.ActualValue.Value;
       #region Update counter & update interval
+      if (generations < MinimumGenerations)
+        return base.Apply();
       UpdateCounter++;
       if (UpdateCounter != UpdateInterval) {
@@ -162 +183 @@
       var qualities = QualityParameter.ActualValue.ToArray();
 
-      // order trees by quality
-      Array.Sort(qualities, trees);
+      Array.Sort(qualities, trees); // sort trees array based on qualities
 
       var interpreter = SymbolicDataAnalysisTreeInterpreterParameter.ActualValue;
@@ -171 +191 @@
 
       int replacedTrees = 0;
+      int avgLengthReduction = 0;
+      double avgQualityImprovement = 0;
 
       var count = (int)Math.Floor(trees.Length * PercentageOfBestSolutions);
 
-      for (int i = 0; i < count; ++i) {
+      for (int i = trees.Length - 1; i >= trees.Length - count; --i) {
+        if (random.NextDouble() > PruningProbability) continue;
         var tree = trees[i];
         var quality = qualities[i].Value;
         var root = tree.Root.GetSubtree(0).GetSubtree(0);
 
-        foreach (var s in root.IterateNodesPrefix()) {
-          if (random.NextDouble() < PruningProbability) continue;
+        foreach (var s in root.IterateNodesPrefix().Skip(1)) {
           var r2 = EvaluateSubtree(s, interpreter, problemData, rows);
-          if (s == root || r2 < quality) continue;
+          if (double.IsNaN(r2) || r2 <= quality) continue;
+          avgQualityImprovement += (r2 - quality);
+          avgLengthReduction += (tree.Length - s.GetLength());
+          replacedTrees++;
+          // replace tree with its own subtree
           var startNode = tree.Root.GetSubtree(0);
           startNode.RemoveSubtree(0);
           startNode.AddSubtree(s);
-          replacedTrees++;
+          // update tree quality
+          qualities[i].Value = r2;
+
           break;
         }
       }
+
+      avgQualityImprovement /= replacedTrees;
+      avgLengthReduction = (int)Math.Round((double)avgLengthReduction / replacedTrees);
 
       var results = ResultCollectionParameter.ActualValue;
@@ -202 +233 @@
       table.Rows[PromotedSubtreesResultName].Values.Add(replacedTrees);
 
+      if (results.ContainsKey(AverageQualityImprovementResultName)) {
+        table = (DataTable)results[AverageQualityImprovementResultName].Value;
+      } else {
+        table = new DataTable(AverageQualityImprovementResultName);
+        table.Rows.Add(new DataRow(AverageQualityImprovementResultName));
+        results.Add(new Result(AverageQualityImprovementResultName, table));
+      }
+      table.Rows[AverageQualityImprovementResultName].Values.Add(avgQualityImprovement);
+
+      if (results.ContainsKey(AverageLengthReductionResultName)) {
+        table = (DataTable)results[AverageLengthReductionResultName].Value;
+      } else {
+        table = new DataTable(AverageLengthReductionResultName);
+        table.Rows.Add(new DataRow(AverageLengthReductionResultName));
+        results.Add(new Result(AverageLengthReductionResultName, table));
+      }
+      table.Rows[AverageLengthReductionResultName].Values.Add(avgLengthReduction);
+
       return base.Apply();
     }