#region License Information /* HeuristicLab * Copyright (C) 2002-2015 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 . */ #endregion using System; using System.Collections.Generic; using System.Linq; using HeuristicLab.Analysis; using HeuristicLab.Common; using HeuristicLab.Core; using HeuristicLab.Data; using HeuristicLab.Operators; using HeuristicLab.Optimization; using HeuristicLab.Parameters; using HeuristicLab.Persistence.Default.CompositeSerializers.Storable; namespace HeuristicLab.Encodings.SymbolicExpressionTreeEncoding { /// /// An operator that tracks the frequencies of distinct symbols in symbolic expression trees. /// [Item("SymbolicExpressionSymbolFrequencyAnalyzer", "An operator that tracks frequencies of symbols in symbolic expression trees.")] [StorableType("29CBFC73-BB85-4583-B18C-5632F2D46004")] public class SymbolicExpressionSymbolFrequencyAnalyzer : SingleSuccessorOperator, ISymbolicExpressionTreeAnalyzer { private const string SymbolicExpressionTreeParameterName = "SymbolicExpressionTree"; private const string ResultsParameterName = "Results"; private const string SymbolFrequenciesParameterName = "SymbolFrequencies"; private const string AggregateSymbolsWithDifferentSubtreeCountParameterName = "AggregateSymbolsWithDifferentSubtreeCount"; #region parameter properties public IScopeTreeLookupParameter SymbolicExpressionTreeParameter { get { return (IScopeTreeLookupParameter)Parameters[SymbolicExpressionTreeParameterName]; } } public ILookupParameter SymbolFrequenciesParameter { get { return (ILookupParameter)Parameters[SymbolFrequenciesParameterName]; } } public ILookupParameter ResultsParameter { get { return (ILookupParameter)Parameters[ResultsParameterName]; } } public IValueParameter AggregateSymbolsWithDifferentSubtreeCountParameter { get { return (IValueParameter)Parameters[AggregateSymbolsWithDifferentSubtreeCountParameterName]; } } #endregion #region properties public virtual bool EnabledByDefault { get { return true; } } public BoolValue AggregrateSymbolsWithDifferentSubtreeCount { get { return AggregateSymbolsWithDifferentSubtreeCountParameter.Value; } set { AggregateSymbolsWithDifferentSubtreeCountParameter.Value = value; } } #endregion [StorableConstructor] protected SymbolicExpressionSymbolFrequencyAnalyzer(bool deserializing) : base(deserializing) { } protected SymbolicExpressionSymbolFrequencyAnalyzer(SymbolicExpressionSymbolFrequencyAnalyzer original, Cloner cloner) : base(original, cloner) { } public SymbolicExpressionSymbolFrequencyAnalyzer() : base() { Parameters.Add(new ScopeTreeLookupParameter(SymbolicExpressionTreeParameterName, "The symbolic expression trees to analyze.")); Parameters.Add(new LookupParameter(SymbolFrequenciesParameterName, "The data table to store the symbol frequencies.")); Parameters.Add(new LookupParameter(ResultsParameterName, "The result collection where the symbol frequencies should be stored.")); Parameters.Add(new ValueParameter(AggregateSymbolsWithDifferentSubtreeCountParameterName, "Flag that indicates if the frequencies of symbols with the same name but different number of sub-trees should be aggregated.", new BoolValue(true))); } public override IDeepCloneable Clone(Cloner cloner) { return new SymbolicExpressionSymbolFrequencyAnalyzer(this, cloner); } [StorableHook(HookType.AfterDeserialization)] private void AfterDeserialization() { #region remove with HL 3.4 if (!Parameters.ContainsKey(AggregateSymbolsWithDifferentSubtreeCountParameterName)) Parameters.Add(new ValueParameter(AggregateSymbolsWithDifferentSubtreeCountParameterName, "Flag that indicates if the frequencies of symbols with the same name but different number of sub-trees should be aggregated.", new BoolValue(true))); #endregion } public override IOperation Apply() { ItemArray expressions = SymbolicExpressionTreeParameter.ActualValue; ResultCollection results = ResultsParameter.ActualValue; DataTable symbolFrequencies = SymbolFrequenciesParameter.ActualValue; if (symbolFrequencies == null) { symbolFrequencies = new DataTable("Symbol frequencies", "Relative frequency of symbols aggregated over the whole population."); symbolFrequencies.VisualProperties.YAxisTitle = "Relative Symbol Frequency"; SymbolFrequenciesParameter.ActualValue = symbolFrequencies; results.Add(new Result("Symbol frequencies", symbolFrequencies)); } // all rows must have the same number of values so we can just take the first int numberOfValues = symbolFrequencies.Rows.Select(r => r.Values.Count).DefaultIfEmpty().First(); foreach (var pair in SymbolicExpressionSymbolFrequencyAnalyzer.CalculateSymbolFrequencies(expressions, AggregrateSymbolsWithDifferentSubtreeCount.Value)) { if (!symbolFrequencies.Rows.ContainsKey(pair.Key)) { // initialize a new row for the symbol and pad with zeros DataRow row = new DataRow(pair.Key, "", Enumerable.Repeat(0.0, numberOfValues)); row.VisualProperties.StartIndexZero = true; symbolFrequencies.Rows.Add(row); } symbolFrequencies.Rows[pair.Key].Values.Add(Math.Round(pair.Value, 3)); } // add a zero for each data row that was not modified in the previous loop foreach (var row in symbolFrequencies.Rows.Where(r => r.Values.Count != numberOfValues + 1)) row.Values.Add(0.0); return base.Apply(); } public static IEnumerable> CalculateSymbolFrequencies(IEnumerable trees, bool aggregateDifferentNumberOfSubtrees = true) { Dictionary symbolFrequencies = new Dictionary(); int totalNumberOfSymbols = 0; foreach (var tree in trees) { foreach (var node in tree.IterateNodesPrefix()) { string symbolName; if (aggregateDifferentNumberOfSubtrees) symbolName = node.Symbol.Name; else symbolName = node.Symbol.Name + "-" + node.SubtreeCount; if (symbolFrequencies.ContainsKey(symbolName)) symbolFrequencies[symbolName] += 1; else symbolFrequencies.Add(symbolName, 1); totalNumberOfSymbols++; } } foreach (var pair in symbolFrequencies) yield return new KeyValuePair(pair.Key, pair.Value / totalNumberOfSymbols); } } }