Changeset 17002 for branches/2988_ModelsOfModels2/HeuristicLab.Algorithms.EMM/HelpFunctions.cs

Timestamp:

06/03/19 14:15:11 (5 years ago)

Author:

msemenki

Message:

#2988:
Class HelpFuction get new static functions that are used in different Map’s classes and possible in other classes.
Branch was adapted to Hive.
New version of class structure for Maps:

1. 3 new variants of maps (RankMap, SuccessMap and ZeroMap) are added.
2. BaseMap class was simplified, some class members were deleted and other were transported to child class, because some of them are not used in all kinds of maps.
3. Functions between base class and child class were divided in other way.
4. Mutation operators were adapted to work with new class structure. Now mutation make less work for ModelNodes than previously.
5. ModelNode and Model symbols were simplified. They should not take into account a map type.
6. Models frequency analyzers were adapted for new variants of maps.
7. EMMAlgorithm class was adapted to new maps

Location:

branches/2988_ModelsOfModels2/HeuristicLab.Algorithms.EMM

Files:

• . (modified) (1 prop)
• HelpFunctions.cs (modified) (3 diffs)

branches/2988_ModelsOfModels2/HeuristicLab.Algorithms.EMM

@@ -12 +12 @@
 *.nuget.props
 *.nuget.targets
+Plugin.cs

@@ -12 +12 @@
 *.nuget.props
 *.nuget.targets
+Plugin.cs

branches/2988_ModelsOfModels2/HeuristicLab.Algorithms.EMM/HelpFunctions.cs

@@ -1 @@
-using System;
+#region License Information
+/* HeuristicLab
+ * Copyright (C) 2002-2019 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 <http://www.gnu.org/licenses/>.
+ */
+#endregion
+using HeuristicLab.Core;
 using System.Collections.Generic;
 using System.Linq;
-using System.Text;
-using System.Threading.Tasks;
-using HEAL.Attic;
 
 namespace HeuristicLab.Algorithms.EvolvmentModelsOfModels {
   class HelpFunctions {
+    public static int OneElementFromListProportionalSelection(IRandom random, List<double> list) {
+      double selectedQuality = random.NextDouble() * list.Sum();
+      int index = 0;
+      double currentQuality = list[index];
+      while ((currentQuality < selectedQuality) && (index < list.Count)) {
+        index++;
+        currentQuality += list[index];
+      }
+      return index;
+    }
     public static int ChooseMinElementIndex(List<double> distances, int currentElement, List<int> previousNumbers) {
       double minValue = 100;
@@ -28 +55 @@
       return minElementNumber;
     }
+
     public static bool CheckNumberIsInList(int number, List<int> priviousNumber) {
       foreach (var pNum in priviousNumber) {
@@ -46 +74 @@
       return minElementNumber;
     }
+    public static int ChooseMaxElementIndex(List<double> averageClusterDistance) {
+      double maxValue = averageClusterDistance[0];
+      int maxElementNumber = 0;
+      for (int i = 1; i < averageClusterDistance.Count(); i++) {
+        if (averageClusterDistance[i] > maxValue) {
+          maxValue = averageClusterDistance[i];
+          maxElementNumber = i;
+        }
+      }
+      return maxElementNumber;
+    }
+    public static double CheckSocialKatre(double socialKarteValue, double value, double stepValue) {
+      if (value > (socialKarteValue + stepValue))
+        return stepValue;
+      else if (value > socialKarteValue)
+        return (value - socialKarteValue);
+      else return 0;
+    }
+    public static void ProbabilitiesUpDate(List<List<double>> sucsessStatistics, List<double> probabilities) {
+
+      var averageQuality = new List<double>();
+      foreach (var variant in sucsessStatistics) {
+        if (variant[0] > 0.005) {
+          averageQuality.Add(variant[1] / variant[0]);
+        } else { averageQuality.Add(0); }
+      }
+      int bestModelNumber = ChooseMaxElementIndex(averageQuality);
+      double socialKarte = 1.0 / (probabilities.Count * 20.0); // parameters of method
+      double stepValue = socialKarte / 5.0;
+      double totalChangeValue = 0, changeValue = 0;
+      for (int i = 0; i < probabilities.Count; i++) {
+        changeValue = CheckSocialKatre(socialKarte, probabilities[i], stepValue);
+        totalChangeValue += changeValue;
+        probabilities[i] -= changeValue;
+      }
+      probabilities[bestModelNumber] += totalChangeValue;
+    }
   }
 }

@@ -12 +12 @@
 *.nuget.props
 *.nuget.targets
+Plugin.cs