Changeset 667 for trunk/c++_tools/classifier/ConsensusInputRanker.cc
- Timestamp:
- Oct 6, 2006, 9:03:19 AM (16 years ago)
- File:
-
- 1 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/c++_tools/classifier/ConsensusInputRanker.cc
r666 r667 4 4 5 5 #include <c++_tools/classifier/InputRanker.h> 6 #include <c++_tools/classifier/IRRetrieve.h> 6 7 #include <c++_tools/classifier/MatrixLookup.h> 7 8 #include <c++_tools/classifier/MatrixLookupWeighted.h> … … 13 14 14 15 #include <cassert> 16 #include <functional> 15 17 #include <iostream> 16 18 #include <utility> … … 65 67 { 66 68 67 // Sorting with respect to median rank69 // Sorting with respect to median info (from retriever_) 68 70 std::vector<std::pair<double,size_t> > medians(id_.size()); 69 71 for (size_t i=0; i<id_.size(); i++){ 70 std::vector<size_t> ranks(input_rankers_.size()); 72 std::vector<double> scores; 73 scores.reserve(input_rankers_.size()); 71 74 for (size_t j=0; j<input_rankers_.size(); j++) { 72 ranks[j]=input_rankers_[j].rank()[i];75 scores.push_back(retriever_(input_rankers_[j],i)); 73 76 } 74 medians[i].first = statistics::median( ranks);77 medians[i].first = statistics::median(scores); 75 78 medians[i].second = i; 76 79 } 77 80 78 81 //sort medians and assign id_ and rank_ 79 sort(medians.begin(), medians.end()); 82 sort(medians.begin(), medians.end(), 83 std::greater<std::pair<double, size_t> >()); 84 80 85 for (size_t i=0; i<medians.size(); i++){ 81 86 id_[i]=medians[i].second;
Note: See TracChangeset
for help on using the changeset viewer.