Changeset 14391 for trunk/sources/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4

Timestamp:

11/15/16 20:23:12 (8 years ago)

Author:

gkronber

Message:

#2697:

• extended converter for linear models to support lagged variables and changed AR(k) to use this method

Location:

trunk/sources/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Converters

Files:

• Convert.cs (modified) (1 diff)
• LinearModelToTreeConverter.cs (modified) (2 diffs)

trunk/sources/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Converters/Convert.cs

@@ -48 +48 @@
       return LinearModelToTreeConverter.CreateTree(variableNames, coefficients, @const);
     }
+    public static ISymbolicExpressionTree CreateLinearModel(string[] variableNames, int[] lags, double[] coefficients,
+      double @const = 0) {
+      return LinearModelToTreeConverter.CreateTree(variableNames, coefficients, @const);
+    }
   }
 }

trunk/sources/HeuristicLab.Problems.DataAnalysis.Symbolic/3.4/Converters/LinearModelToTreeConverter.cs

@@ -28 +28 @@
     public static ISymbolicExpressionTree CreateTree(string[] variableNames, double[] coefficients,
       double @const = 0) {
+      return CreateTree(variableNames, new int[variableNames.Length], coefficients, @const);
+    }
+
+    public static ISymbolicExpressionTree CreateTree(string[] variableNames, int[] lags, double[] coefficients,
+      double @const = 0) {
       if (variableNames.Length == 0 ||
-        variableNames.Length != coefficients.Length)
-        throw new ArgumentException("The length of the variable names and coefficients vectors must match");
+        variableNames.Length != coefficients.Length ||
+        variableNames.Length != lags.Length)
+        throw new ArgumentException("The length of the variable names, lags, and coefficients vectors must match");
+
       ISymbolicExpressionTree tree = new SymbolicExpressionTree(new ProgramRootSymbol().CreateTreeNode());
       ISymbolicExpressionTreeNode startNode = new StartSymbol().CreateTreeNode();
@@ -38 +45 @@
 
       for (int i = 0; i < variableNames.Length; i++) {
-        VariableTreeNode vNode = (VariableTreeNode)new Variable().CreateTreeNode();
-        vNode.VariableName = variableNames[i];
-        vNode.Weight = coefficients[i];
-        addition.AddSubtree(vNode);
+        if (lags[i] == 0) {
+          VariableTreeNode vNode = (VariableTreeNode)new Variable().CreateTreeNode();
+          vNode.VariableName = variableNames[i];
+          vNode.Weight = coefficients[i];
+          addition.AddSubtree(vNode);
+        } else {
+          LaggedVariableTreeNode vNode = (LaggedVariableTreeNode)new LaggedVariable().CreateTreeNode();
+          vNode.VariableName = variableNames[i];
+          vNode.Weight = coefficients[i];
+          vNode.Lag = lags[i];
+          addition.AddSubtree(vNode);
+        }
       }