1 | using System;
|
---|
2 | using System.Diagnostics;
|
---|
3 | using HeuristicLab.Random;
|
---|
4 | using Microsoft.VisualStudio.TestTools.UnitTesting;
|
---|
5 |
|
---|
6 | namespace HeuristicLab.Problems.DataAnalysis.Symbolic.Tests {
|
---|
7 | [TestClass]
|
---|
8 | public class BottomUpSimilarityCalculatorTest {
|
---|
9 | private readonly SymbolicExpressionTreeBottomUpSimilarityCalculator busCalculator;
|
---|
10 | private readonly SymbolicExpressionImporter importer;
|
---|
11 |
|
---|
12 | private const int N = 150;
|
---|
13 | private const int Rows = 1;
|
---|
14 | private const int Columns = 10;
|
---|
15 |
|
---|
16 | public BottomUpSimilarityCalculatorTest() {
|
---|
17 | busCalculator = new SymbolicExpressionTreeBottomUpSimilarityCalculator();
|
---|
18 | importer = new SymbolicExpressionImporter();
|
---|
19 | }
|
---|
20 |
|
---|
21 | [TestMethod]
|
---|
22 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
23 | [TestProperty("Time", "short")]
|
---|
24 | public void BottomUpTreeSimilarityCalculatorTestMapping() {
|
---|
25 | TestMatchedNodes("(+ 1 2)", "(+ 2 1)", 5);
|
---|
26 | TestMatchedNodes("(- 2 1)", "(- 1 2)", 2);
|
---|
27 | TestMatchedNodes("(* (variable 1 X1) (variable 1 X2))", "(* (+ (variable 1 X1) 1) (+ (variable 1 X2) 1))", 2);
|
---|
28 |
|
---|
29 | TestMatchedNodes("(* (variable 1 X1) (variable 1 X2))", "(* (+ (variable 1 X1) 1) (variable 1 X2))", 2);
|
---|
30 |
|
---|
31 | TestMatchedNodes("(+ (variable 1 a) (variable 1 b))", "(+ (variable 1 a) (variable 1 a))", 1);
|
---|
32 | TestMatchedNodes("(+ (+ (variable 1 a) (variable 1 b)) (variable 1 b))", "(+ (* (+ (variable 1 a) (variable 1 b)) (variable 1 b)) (+ (+ (variable 1 a) (variable 1 b)) (variable 1 b)))", 5);
|
---|
33 |
|
---|
34 | TestMatchedNodes(
|
---|
35 | "(* (+ 2.84 (exp (+ (log (/ (variable 2.0539 X5) (variable -9.2452e-1 X6))) (/ (variable 2.0539 X5) (variable -9.2452e-1 X6))))) 2.9081)",
|
---|
36 | "(* (- (variable 9.581e-1 X6) (+ (- (variable 5.1491e-1 X5) 1.614e+1) (+ (/ (variable 2.0539 X5) (variable -9.2452e-1 X6)) (log (/ (variable 2.0539 X5) (variable -9.2452e-1 X6)))))) 2.9081)",
|
---|
37 | 9);
|
---|
38 |
|
---|
39 | TestMatchedNodes("(+ (exp 2.1033) (/ -4.3072 (variable 2.4691 X7)))", "(/ 1 (+ (/ -4.3072 (variable 2.4691 X7)) (exp 2.1033)))", 6);
|
---|
40 | TestMatchedNodes("(+ (exp 2.1033) (/ -4.3072 (variable 2.4691 X7)))", "(/ 1 (+ (/ (variable 2.4691 X7) -4.3072) (exp 2.1033)))", 4);
|
---|
41 |
|
---|
42 | const string expr1 = "(* (- 1.2175e+1 (+ (/ (exp -1.4134e+1) (exp 9.2013)) (exp (log (exp (/ (exp (- (* -4.2461 (variable 2.2634 X5)) (- -9.6267e-1 3.3243))) (- (/ (/ (variable 1.0883 X1) (variable 6.9620e-1 X2)) (log 1.3011e+1)) (variable -4.3098e-1 X7)))))))) (log 1.3011e+1))";
|
---|
43 | const string expr2 = "(* (- 1.2175e+1 (+ (/ (/ (+ (variable 3.0140 X9) (variable 1.3430 X8)) -1.0864e+1) (exp 9.2013)) (exp (log (exp (/ (exp (- (* -4.2461 (variable 2.2634 X5)) (- -9.6267e-1 3.3243))) (- (/ (/ (variable 1.0883 X1) (variable 6.9620e-1 X2)) (log 1.3011e+1)) (variable -4.3098e-1 X7)))))))) (exp (variable 4.0899e-1 X7)))";
|
---|
44 |
|
---|
45 | TestMatchedNodes(expr1, expr2, 23);
|
---|
46 |
|
---|
47 | }
|
---|
48 |
|
---|
49 | private void TestMatchedNodes(string expr1, string expr2, int expected) {
|
---|
50 | var t1 = importer.Import(expr1);
|
---|
51 | var t2 = importer.Import(expr2);
|
---|
52 |
|
---|
53 | var mapping = busCalculator.ComputeBottomUpMapping(t1.Root, t2.Root);
|
---|
54 | var c = mapping.Count;
|
---|
55 |
|
---|
56 | if (c != expected) {
|
---|
57 | throw new Exception("Match count " + c + " is different than expected value " + expected);
|
---|
58 | }
|
---|
59 | }
|
---|
60 |
|
---|
61 | [TestMethod]
|
---|
62 | [TestCategory("Problems.DataAnalysis.Symbolic")]
|
---|
63 | [TestProperty("Time", "long")]
|
---|
64 | public void BottomUpTreeSimilarityCalculatorTestPerformance() {
|
---|
65 | var grammar = new TypeCoherentExpressionGrammar();
|
---|
66 | grammar.ConfigureAsDefaultRegressionGrammar();
|
---|
67 | var twister = new MersenneTwister(31415);
|
---|
68 | var ds = Util.CreateRandomDataset(twister, Rows, Columns);
|
---|
69 | var trees = Util.CreateRandomTrees(twister, ds, grammar, N, 1, 100, 0, 0);
|
---|
70 |
|
---|
71 | double s = 0;
|
---|
72 | var sw = new Stopwatch();
|
---|
73 |
|
---|
74 | sw.Start();
|
---|
75 | for (int i = 0; i < trees.Length - 1; ++i) {
|
---|
76 | for (int j = i + 1; j < trees.Length; ++j) {
|
---|
77 | s += busCalculator.CalculateSimilarity(trees[i], trees[j]);
|
---|
78 | }
|
---|
79 | }
|
---|
80 |
|
---|
81 | sw.Stop();
|
---|
82 | Console.WriteLine("Elapsed time: " + sw.ElapsedMilliseconds / 1000.0 + ", Avg. similarity: " + s / (N * (N - 1) / 2));
|
---|
83 | Console.WriteLine(N * (N + 1) / (2 * sw.ElapsedMilliseconds / 1000.0) + " similarity calculations per second.");
|
---|
84 | }
|
---|
85 | }
|
---|
86 | }
|
---|