Modified experiments.

Author: cmdevries

src/EMTree.cpp

@@ -405,14 +405,17 @@ void journalPaperExperiments(vector<SVector<bool>*>& vectors) {
     // run TSVQ vs EM-tree convergence
     if (false) {
         int depth = 3, m = 10;
-        int iterRange = 40; // test RMSE at 1 to maxiters iterations
+        int iterRange = 100; // test RMSE at 1 to maxiters iterations
+        int seed = 1234; // start with same seed each time
 
         //TSVQ
-        if (true) {
+        if (false) {
+            cout << "TSVQ convergence" << endl;
             vector<double> rmse;
             vector<int> clusters;
             vector<double> seconds;
             for (int maxiters = 1; maxiters <= iterRange; ++maxiters) {
+                srand(seed);
                 boost::timer::auto_cpu_timer all;
                 TSVQ<vecType, clustererType, distanceType, protoType> tsvq(m, depth, maxiters);
                 tsvq.cluster(vectors);
@@ -430,6 +433,7 @@ void journalPaperExperiments(vector<SVector<bool>*>& vectors) {
 
         //EM-tree
         if (true) {
+            cout << "EM-tree convergence" << endl;
             vector<double> rmse;
             vector<int> clusters;
             vector<double> seconds;
@@ -438,6 +442,7 @@ void journalPaperExperiments(vector<SVector<bool>*>& vectors) {
                 for (int i = 0; i < depth - 1; ++i) {
                     splits.push_back(m);
                 }
+                srand(seed);
                 boost::timer::auto_cpu_timer all;
                 EMTree<vecType, clustererType, distanceType, protoType> emt(m);
                 // seeding does first iteration
@@ -531,7 +536,7 @@ void journalPaperExperiments(vector<SVector<bool>*>& vectors) {
     }
 
     // run kmeans exerpiments
-    if (true) {
+    if (false) {
         int maxiters = 1000;
         cout << "k-means maxiters=" << maxiters << endl;
         vector<double> rmse;
@@ -557,9 +562,9 @@ void journalPaperExperiments(vector<SVector<bool>*>& vectors) {
     }
 
     // run K-tree experiments
-    if (false) {
+    if (true) {
         // build tree
-        vector<int> orders = {10000, 5000, 2500, 1000, 750, 500, 400, 300, 250, 200, 150, 100, 75, 50, 25};
+        vector<int> orders = {100};//{10000, 5000, 2500, 1000, 750, 500, 400, 300, 250, 200, 150, 100, 75, 50, 25};
         for (int m : orders) {
             const int maxiters = 1000;
             cout << "-----" << endl;