source: trunk/src/ConsensusInputRanker.cc @ 133

// $Id: ConsensusInputRanker.cc 133 2004-08-16 12:01:15Z peter $


#include "ConsensusInputRanker.h"
// Thep C++ Tools
#include "CrossValidation.h"
#include "InputRanker.h"
#include "Statistics.h"
#include "stl_utility.h"

// System includes
#include <vector>

namespace theplu {
namespace cpptools {  

  ConsensusInputRanker::ConsensusInputRanker(const gslapi::matrix& data,
                                             const gslapi::vector& target,
                                             Score& score_object,
                                             const size_t rounds,
                                             const size_t k)
    :id_(std::vector<size_t>()), input_rankers_(std::vector<InputRanker>()), 
     k_(k), nof_rankers_(k*rounds), rank_(std::vector<size_t>())

  {
    CrossValidation cv(target, k_);
    for (size_t i=0; i<nof_rankers_; i++){
      //InputRanker ir(data, target, score_object);
      input_rankers_.push_back(InputRanker(data, target, score_object));
    }
    // Sorting with respect to median rank
    theplu::cpptools::Statistics stat;
    std::vector<std::pair<size_t,double> > median(data.rows());
    for (size_t i=0; i<data.rows(); i++){ 
      std::vector<size_t> ranks(nof_rankers_);
      for (size_t j=0; j<nof_rankers_; j++) 
        ranks[j]=input_rankers_[j].rank(i+1);
      median[i].first = i;
      median[i].second = stat.median(ranks);
    }
    
    //sort medians and assign id_ and rank_
    sort(median.begin(), median.end(), 
         pair_value_compare<size_t, double>());
    id_.resize(data.rows());
    rank_.resize(data.rows());
    for (size_t i=0; i<data.rows(); i++){
      id_[i]=median[i].first;
      rank_[id_[i]]=i;            
    }

  }
    

}} // of namespace cpptools and namespace theplu