NICE_VisLearning/regression/randomforest/RTBClusterRandom.cpp

/**
* @file RTBClusterRandom.cpp
* @brief random regression tree
* @author Sven Sickert
* @date 07/19/2013

*/
#include <iostream>

#include "RTBClusterRandom.h"

using namespace OBJREC;

#undef DEBUGTREE
#undef DETAILTREE

using namespace std;

using namespace NICE;

RTBClusterRandom::RTBClusterRandom( const Config *conf, std::string section )
{
  max_depth = conf->gI(section, "max_depth", 20 );
  min_examples = conf->gI(section, "min_examples", 10);
  save_indices = conf->gB(section, "save_indices", false);
  
  if ( conf->gB(section, "start_random_generator", false ) )
    srand(time(NULL));
}

RTBClusterRandom::~RTBClusterRandom()
{
}

bool RTBClusterRandom::balancingLeftRight(const vector< pair< double, int > > values,
          double threshold,
          int& count_left,
          int& count_right)
{
  count_left = 0;
  count_right = 0;
  
  for ( vector< pair< double, int > >::const_iterator it = values.begin();
        it != values.end(); it++ )
  {
    double value = it->first;
    if ( value < threshold )
    {
      count_left++;
    }
    else
    {
      count_right++;
    }
  }
  
#ifdef DETAILTREE
  fprintf (stderr, "left vs. right: %d : %d\n", count_left, count_right );
#endif
  
  if ( (count_left == 0) || (count_right == 0) )
    return false; // no split
  
  return true;
}

RegressionNode *RTBClusterRandom::buildRecursive ( const NICE::VVector & x,
          const NICE::Vector & y,
          std::vector<int> & selection,
          int depth)
{
#ifdef DEBUGTREE
    fprintf (stderr, "Examples: %d (depth %d)\n", (int)selection.size(),
    (int)depth);
#endif
    
  RegressionNode *node = new RegressionNode ();
  node->nodePrediction( y, selection );
  double lsError = node->lsError;
  
  if ( depth > max_depth )
  {
#ifdef DEBUGTREE
   fprintf (stderr, "RTBClusterRandom: maxmimum depth reached !\n");
#endif
   node->trainExamplesIndices = selection;
   return node;
  }
  
  if ( (int)selection.size() < min_examples )
  {
#ifdef DEBUGTREE
    fprintf (stderr, "RTBClusterRandom: minimum examples reached %d < %d !\n",
      (int)selection.size(), min_examples );
#endif
    node->trainExamplesIndices = selection;
    return node;
  }

  vector<pair<double, int> > values;
  
  int f = rand() % x[0].size();
    
  values.clear();
  collectFeatureValues ( x, selection, f, values );
    
  double median   = (values.begin() + values.size() / 2)->first;
    
#ifdef DETAILTREE
  double minValue = (min_element ( values.begin(), values.end() ))->first;
  double maxValue = (max_element ( values.begin(), values.end() ))->first;
  fprintf (stderr, "max %f min %f med %f\n", maxValue, minValue, median );
#endif
    
  int count_left, count_right;
  if ( ! balancingLeftRight( values, median, count_left, count_right) )
  {
    fprintf ( stderr, "RTBClusterRandom: no split possible (empty leaf)\n" );
    node->trainExamplesIndices = selection;
    return node;
  }
      
#ifdef DETAILTREE
  fprintf (stderr, "t %f for feature %d\n", median, f );
#endif
  
  node->f = f;
  node->threshold = median;
  
  // re calculating examples_left and examples_right
  vector<int> best_examples_left;
  vector<int> best_examples_right;
  
  best_examples_left.reserve ( values.size() / 2 );
  best_examples_right.reserve ( values.size() / 2 );
  
  for ( vector< pair < double, int > >::const_iterator it = values.begin();
        it != values.end(); it++ )
  {
    double value = it->first;
    if ( value < median )
      best_examples_left.push_back( it->second );
    else
      best_examples_right.push_back( it->second );
  }
  
  node->left = buildRecursive( x, y, best_examples_left, depth+1 );
  node->right = buildRecursive( x, y, best_examples_right, depth+1 );
  
  return node;
}

RegressionNode *RTBClusterRandom::build( const NICE::VVector & x,
          const NICE::Vector & y )
{
  int index = 0;
  
  vector<int> all;
  all.reserve ( y.size() );
  for ( uint i = 0; i < y.size(); i++ )
  {
    all.push_back( index );
    index++;
  }
  
  return buildRecursive( x, y, all, 0);
}