[5017] | 1 | #region License Information
|
---|
| 2 | /* HeuristicLab
|
---|
[5433] | 3 | * Copyright (C) 2002-2011 Heuristic and Evolutionary Algorithms Laboratory (HEAL)
|
---|
[5017] | 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 |
|
---|
| 22 | using System.Text;
|
---|
[5019] | 23 | using System.Linq;
|
---|
[5017] | 24 | using HeuristicLab.Core;
|
---|
| 25 | using HeuristicLab.Common;
|
---|
| 26 | using HeuristicLab.Persistence.Default.CompositeSerializers.Storable;
|
---|
| 27 | using HeuristicLab.Problems.DataAnalysis;
|
---|
| 28 | using System.Collections.Generic;
|
---|
| 29 | using System;
|
---|
[5431] | 30 | using System.Globalization;
|
---|
[5745] | 31 | using HeuristicLab.Encodings.SymbolicExpressionTreeEncoding;
|
---|
[5017] | 32 |
|
---|
[5745] | 33 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic {
|
---|
[5017] | 34 |
|
---|
[5745] | 35 | [Item("MATLAB String Formatter", "String formatter for string representations of symbolic data analysis expressions in MATLAB syntax.")]
|
---|
[5431] | 36 | [StorableClass]
|
---|
[5745] | 37 | public sealed class SymbolicDataAnalysisExpressionMATLABFormatter : NamedItem, ISymbolicExpressionTreeStringFormatter {
|
---|
[5431] | 38 | private int currentLag;
|
---|
[5017] | 39 |
|
---|
[5431] | 40 | [StorableConstructor]
|
---|
[5745] | 41 | private SymbolicDataAnalysisExpressionMATLABFormatter(bool deserializing) : base(deserializing) { }
|
---|
| 42 | private SymbolicDataAnalysisExpressionMATLABFormatter(SymbolicDataAnalysisExpressionMATLABFormatter original, Cloner cloner) : base(original, cloner) { }
|
---|
| 43 | public SymbolicDataAnalysisExpressionMATLABFormatter()
|
---|
[5019] | 44 | : base() {
|
---|
[5745] | 45 | Name = ItemName;
|
---|
| 46 | Description = ItemDescription;
|
---|
[5017] | 47 | }
|
---|
[5431] | 48 | public override IDeepCloneable Clone(Cloner cloner) {
|
---|
[5745] | 49 | return new SymbolicDataAnalysisExpressionMATLABFormatter(this, cloner);
|
---|
[5431] | 50 | }
|
---|
| 51 | private int currentIndexNumber;
|
---|
| 52 | public string CurrentIndexVariable {
|
---|
| 53 | get {
|
---|
| 54 | return "i" + currentIndexNumber;
|
---|
| 55 | }
|
---|
| 56 | }
|
---|
| 57 | private void ReleaseIndexVariable() {
|
---|
| 58 | currentIndexNumber--;
|
---|
| 59 | }
|
---|
[5017] | 60 |
|
---|
[5431] | 61 | private string AllocateIndexVariable() {
|
---|
| 62 | currentIndexNumber++;
|
---|
| 63 | return CurrentIndexVariable;
|
---|
| 64 | }
|
---|
| 65 |
|
---|
[5745] | 66 | public string Format(ISymbolicExpressionTree symbolicExpressionTree) {
|
---|
[5431] | 67 | currentLag = 0;
|
---|
| 68 | currentIndexNumber = 0;
|
---|
[5017] | 69 | return FormatRecursively(symbolicExpressionTree.Root);
|
---|
| 70 | }
|
---|
| 71 |
|
---|
[5745] | 72 | private string FormatRecursively(ISymbolicExpressionTreeNode node) {
|
---|
| 73 | ISymbol symbol = node.Symbol;
|
---|
[5017] | 74 | StringBuilder stringBuilder = new StringBuilder();
|
---|
| 75 |
|
---|
| 76 | if (symbol is ProgramRootSymbol) {
|
---|
[5019] | 77 | var variableNames = node.IterateNodesPostfix()
|
---|
| 78 | .OfType<VariableTreeNode>()
|
---|
| 79 | .Select(n => n.VariableName)
|
---|
[5020] | 80 | .Distinct()
|
---|
[5019] | 81 | .OrderBy(x => x);
|
---|
[5022] | 82 | stringBuilder.AppendLine("function test_model");
|
---|
[5017] | 83 | foreach (string variableName in variableNames)
|
---|
[5022] | 84 | stringBuilder.AppendLine(" " + variableName + " = Data(:, ???);");
|
---|
[5745] | 85 | stringBuilder.AppendLine(" for " + CurrentIndexVariable + " = size(Data,1):-1:1");
|
---|
| 86 | stringBuilder.AppendLine(" Target_estimated(" + CurrentIndexVariable + ") = " + FormatRecursively(node.GetSubtree(0)) + ";");
|
---|
[5433] | 87 | stringBuilder.AppendLine(" end");
|
---|
| 88 | stringBuilder.AppendLine("end");
|
---|
[5022] | 89 | stringBuilder.AppendLine();
|
---|
| 90 | stringBuilder.AppendLine("function y = log_(x)");
|
---|
| 91 | stringBuilder.AppendLine(" if(x<=0) y = NaN;");
|
---|
| 92 | stringBuilder.AppendLine(" else y = log(x);");
|
---|
[5433] | 93 | stringBuilder.AppendLine(" end");
|
---|
| 94 | stringBuilder.AppendLine("end");
|
---|
| 95 | stringBuilder.AppendLine();
|
---|
| 96 | stringBuilder.AppendLine("function y = fivePoint(f0, f1, f3, f4)");
|
---|
| 97 | stringBuilder.AppendLine(" y = (f0 + 2*f1 - 2*f3 - f4) / 8;");
|
---|
| 98 | stringBuilder.AppendLine("end");
|
---|
[5017] | 99 | return stringBuilder.ToString();
|
---|
| 100 | }
|
---|
| 101 |
|
---|
| 102 | if (symbol is StartSymbol)
|
---|
[5745] | 103 | return FormatRecursively(node.GetSubtree(0));
|
---|
[5017] | 104 |
|
---|
| 105 | stringBuilder.Append("(");
|
---|
| 106 |
|
---|
| 107 | if (symbol is Addition) {
|
---|
[5745] | 108 | for (int i = 0; i < node.SubtreesCount; i++) {
|
---|
[5017] | 109 | if (i > 0) stringBuilder.Append("+");
|
---|
[5745] | 110 | stringBuilder.Append(FormatRecursively(node.GetSubtree(i)));
|
---|
[5017] | 111 | }
|
---|
| 112 | } else if (symbol is And) {
|
---|
[5021] | 113 | stringBuilder.Append("((");
|
---|
[5745] | 114 | for (int i = 0; i < node.SubtreesCount; i++) {
|
---|
[5017] | 115 | if (i > 0) stringBuilder.Append("&");
|
---|
| 116 | stringBuilder.Append("((");
|
---|
[5745] | 117 | stringBuilder.Append(FormatRecursively(node.GetSubtree(i)));
|
---|
[5017] | 118 | stringBuilder.Append(")>0)");
|
---|
| 119 | }
|
---|
[5021] | 120 | stringBuilder.Append(")-0.5)*2"); // MATLAB maps false and true to 0 and 1, resp., we map this result to -1.0 and +1.0, resp.
|
---|
[5017] | 121 | } else if (symbol is Average) {
|
---|
| 122 | stringBuilder.Append("(1/");
|
---|
[5745] | 123 | stringBuilder.Append(node.SubtreesCount);
|
---|
[5017] | 124 | stringBuilder.Append(")*(");
|
---|
[5745] | 125 | for (int i = 0; i < node.SubtreesCount; i++) {
|
---|
[5017] | 126 | if (i > 0) stringBuilder.Append("+");
|
---|
| 127 | stringBuilder.Append("(");
|
---|
[5745] | 128 | stringBuilder.Append(FormatRecursively(node.GetSubtree(i)));
|
---|
[5017] | 129 | stringBuilder.Append(")");
|
---|
| 130 | }
|
---|
| 131 | stringBuilder.Append(")");
|
---|
| 132 | } else if (symbol is Constant) {
|
---|
| 133 | ConstantTreeNode constantTreeNode = node as ConstantTreeNode;
|
---|
[5431] | 134 | stringBuilder.Append(constantTreeNode.Value.ToString(CultureInfo.InvariantCulture));
|
---|
[5017] | 135 | } else if (symbol is Cosine) {
|
---|
| 136 | stringBuilder.Append("cos(");
|
---|
[5745] | 137 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 138 | stringBuilder.Append(")");
|
---|
| 139 | } else if (symbol is Division) {
|
---|
[5745] | 140 | if (node.SubtreesCount == 1) {
|
---|
[5017] | 141 | stringBuilder.Append("1/");
|
---|
[5745] | 142 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 143 | } else {
|
---|
[5745] | 144 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 145 | stringBuilder.Append("/(");
|
---|
[5745] | 146 | for (int i = 1; i < node.SubtreesCount; i++) {
|
---|
[5017] | 147 | if (i > 1) stringBuilder.Append("*");
|
---|
[5745] | 148 | stringBuilder.Append(FormatRecursively(node.GetSubtree(i)));
|
---|
[5017] | 149 | }
|
---|
| 150 | stringBuilder.Append(")");
|
---|
| 151 | }
|
---|
| 152 | } else if (symbol is Exponential) {
|
---|
| 153 | stringBuilder.Append("exp(");
|
---|
[5745] | 154 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 155 | stringBuilder.Append(")");
|
---|
| 156 | } else if (symbol is GreaterThan) {
|
---|
[5021] | 157 | stringBuilder.Append("((");
|
---|
[5745] | 158 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 159 | stringBuilder.Append(">");
|
---|
[5745] | 160 | stringBuilder.Append(FormatRecursively(node.GetSubtree(1)));
|
---|
[5021] | 161 | stringBuilder.Append(")-0.5)*2"); // MATLAB maps false and true to 0 and 1, resp., we map this result to -1.0 and +1.0, resp.
|
---|
[5017] | 162 | } else if (symbol is IfThenElse) {
|
---|
| 163 | stringBuilder.Append("(");
|
---|
[5745] | 164 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 165 | stringBuilder.Append(">0)*");
|
---|
[5745] | 166 | stringBuilder.Append(FormatRecursively(node.GetSubtree(1)));
|
---|
[5017] | 167 | stringBuilder.Append("+");
|
---|
| 168 | stringBuilder.Append("(");
|
---|
[5745] | 169 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5021] | 170 | stringBuilder.Append("<=0)*");
|
---|
[5745] | 171 | stringBuilder.Append(FormatRecursively(node.GetSubtree(2)));
|
---|
[5017] | 172 | } else if (symbol is LaggedVariable) {
|
---|
[5431] | 173 | // this if must be checked before if(symbol is LaggedVariable)
|
---|
[5017] | 174 | LaggedVariableTreeNode laggedVariableTreeNode = node as LaggedVariableTreeNode;
|
---|
[5431] | 175 | stringBuilder.Append(laggedVariableTreeNode.Weight.ToString(CultureInfo.InvariantCulture));
|
---|
[5017] | 176 | stringBuilder.Append("*");
|
---|
[5431] | 177 | stringBuilder.Append(laggedVariableTreeNode.VariableName + LagToString(currentLag + laggedVariableTreeNode.Lag));
|
---|
[5017] | 178 | } else if (symbol is LessThan) {
|
---|
[5021] | 179 | stringBuilder.Append("((");
|
---|
[5745] | 180 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 181 | stringBuilder.Append("<");
|
---|
[5745] | 182 | stringBuilder.Append(FormatRecursively(node.GetSubtree(1)));
|
---|
[5021] | 183 | stringBuilder.Append(")-0.5)*2"); // MATLAB maps false and true to 0 and 1, resp., we map this result to -1.0 and +1.0, resp.
|
---|
[5017] | 184 | } else if (symbol is Logarithm) {
|
---|
[5022] | 185 | stringBuilder.Append("log_(");
|
---|
[5745] | 186 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 187 | stringBuilder.Append(")");
|
---|
| 188 | } else if (symbol is Multiplication) {
|
---|
[5745] | 189 | for (int i = 0; i < node.SubtreesCount; i++) {
|
---|
[5017] | 190 | if (i > 0) stringBuilder.Append("*");
|
---|
[5745] | 191 | stringBuilder.Append(FormatRecursively(node.GetSubtree(i)));
|
---|
[5017] | 192 | }
|
---|
| 193 | } else if (symbol is Not) {
|
---|
[5745] | 194 | stringBuilder.Append("~(");
|
---|
| 195 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
| 196 | stringBuilder.Append(" > 0 )");
|
---|
[5017] | 197 | } else if (symbol is Or) {
|
---|
[5021] | 198 | stringBuilder.Append("((");
|
---|
[5745] | 199 | for (int i = 0; i < node.SubtreesCount; i++) {
|
---|
[5017] | 200 | if (i > 0) stringBuilder.Append("|");
|
---|
| 201 | stringBuilder.Append("((");
|
---|
[5745] | 202 | stringBuilder.Append(FormatRecursively(node.GetSubtree(i)));
|
---|
[5017] | 203 | stringBuilder.Append(")>0)");
|
---|
| 204 | }
|
---|
[5021] | 205 | stringBuilder.Append(")-0.5)*2"); // MATLAB maps false and true to 0 and 1, resp., we map this result to -1.0 and +1.0, resp.
|
---|
[5017] | 206 | } else if (symbol is Sine) {
|
---|
| 207 | stringBuilder.Append("sin(");
|
---|
[5745] | 208 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 209 | stringBuilder.Append(")");
|
---|
| 210 | } else if (symbol is Subtraction) {
|
---|
[5745] | 211 | if (node.SubtreesCount == 1) {
|
---|
[5017] | 212 | stringBuilder.Append("-1*");
|
---|
[5745] | 213 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 214 | } else {
|
---|
[5745] | 215 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
| 216 | for (int i = 1; i < node.SubtreesCount; i++) {
|
---|
[5017] | 217 | stringBuilder.Append("-");
|
---|
[5745] | 218 | stringBuilder.Append(FormatRecursively(node.GetSubtree(i)));
|
---|
[5017] | 219 | }
|
---|
| 220 | }
|
---|
| 221 | } else if (symbol is Tangent) {
|
---|
| 222 | stringBuilder.Append("tan(");
|
---|
[5745] | 223 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5017] | 224 | stringBuilder.Append(")");
|
---|
[5745] | 225 | } else if (symbol is HeuristicLab.Problems.DataAnalysis.Symbolic.Variable) {
|
---|
[5017] | 226 | VariableTreeNode variableTreeNode = node as VariableTreeNode;
|
---|
[5431] | 227 | stringBuilder.Append(variableTreeNode.Weight.ToString(CultureInfo.InvariantCulture));
|
---|
[5017] | 228 | stringBuilder.Append("*");
|
---|
[5431] | 229 | stringBuilder.Append(variableTreeNode.VariableName + LagToString(currentLag));
|
---|
| 230 | } else if (symbol is Power) {
|
---|
| 231 | stringBuilder.Append("(");
|
---|
[5745] | 232 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5431] | 233 | stringBuilder.Append(")^round(");
|
---|
[5745] | 234 | stringBuilder.Append(FormatRecursively(node.GetSubtree(1)));
|
---|
[5431] | 235 | stringBuilder.Append(")");
|
---|
| 236 | } else if (symbol is Root) {
|
---|
| 237 | stringBuilder.Append("(");
|
---|
[5745] | 238 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5431] | 239 | stringBuilder.Append(")^(1 / round(");
|
---|
[5745] | 240 | stringBuilder.Append(FormatRecursively(node.GetSubtree(1)));
|
---|
[5431] | 241 | stringBuilder.Append("))");
|
---|
| 242 | } else if (symbol is Derivative) {
|
---|
| 243 | stringBuilder.Append("fivePoint(");
|
---|
| 244 | // f0
|
---|
[5745] | 245 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5431] | 246 | stringBuilder.Append(", ");
|
---|
| 247 | // f1
|
---|
| 248 | currentLag--;
|
---|
[5745] | 249 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5431] | 250 | stringBuilder.Append(", ");
|
---|
| 251 | // f3
|
---|
| 252 | currentLag -= 2;
|
---|
[5745] | 253 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5431] | 254 | stringBuilder.Append(", ");
|
---|
| 255 | currentLag--;
|
---|
| 256 | // f4
|
---|
[5745] | 257 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5431] | 258 | stringBuilder.Append(")");
|
---|
| 259 | currentLag += 4;
|
---|
| 260 | } else if (symbol is Integral) {
|
---|
| 261 | var laggedNode = node as LaggedTreeNode;
|
---|
| 262 | string prevCounterVariable = CurrentIndexVariable;
|
---|
| 263 | string counterVariable = AllocateIndexVariable();
|
---|
[5745] | 264 | stringBuilder.AppendLine(" sum (map(@(" + counterVariable + ") " + FormatRecursively(node.GetSubtree(0)) + ", (" + prevCounterVariable + "+" + laggedNode.Lag + "):" + prevCounterVariable + "))");
|
---|
[5431] | 265 | ReleaseIndexVariable();
|
---|
| 266 | } else if (symbol is TimeLag) {
|
---|
| 267 | var laggedNode = node as LaggedTreeNode;
|
---|
| 268 | currentLag += laggedNode.Lag;
|
---|
[5745] | 269 | stringBuilder.Append(FormatRecursively(node.GetSubtree(0)));
|
---|
[5431] | 270 | currentLag -= laggedNode.Lag;
|
---|
[5019] | 271 | } else {
|
---|
[5017] | 272 | stringBuilder.Append("ERROR");
|
---|
| 273 | }
|
---|
| 274 |
|
---|
| 275 | stringBuilder.Append(")");
|
---|
| 276 | return stringBuilder.ToString();
|
---|
| 277 | }
|
---|
| 278 |
|
---|
[5431] | 279 |
|
---|
| 280 | private string LagToString(int lag) {
|
---|
| 281 | if (lag < 0) {
|
---|
| 282 | return "(" + CurrentIndexVariable + "" + lag + ")";
|
---|
| 283 | } else if (lag > 0) {
|
---|
| 284 | return "(" + CurrentIndexVariable + "+" + lag + ")";
|
---|
| 285 | } else return "(" + CurrentIndexVariable + ")";
|
---|
[5017] | 286 | }
|
---|
[5431] | 287 |
|
---|
[5017] | 288 | }
|
---|
| 289 | }
|
---|