Changeset 565
- Timestamp:
- Mar 16, 2006, 3:19:41 PM (17 years ago)
- Location:
- trunk
- Files:
-
- 9 edited
Legend:
- Unmodified
- Added
- Removed
-
trunk/lib/classifier/DataLookup1D.h
r555 r565 32 32 /// 33 33 DataLookup1D(const DataLookup2D&, const size_t index, 34 const bool row_vector =true);34 const bool row_vector); 35 35 36 36 /// -
trunk/lib/classifier/KernelLookup.h
r564 r565 126 126 /// 127 127 inline const MatrixLookup* data(void) const 128 { return new MatrixLookup(kernel_->data(),column_index_ ); }128 { return new MatrixLookup(kernel_->data(),column_index_,false); } 129 129 130 130 … … 163 163 /// 164 164 inline const MatrixLookup* weights(void) const 165 { return new MatrixLookup(kernel_->weights(),column_index_ ); }165 { return new MatrixLookup(kernel_->weights(),column_index_, false); } 166 166 167 167 -
trunk/lib/classifier/KernelWeighted_MEV.h
r555 r565 59 59 inline double element(const DataLookup1D& vec, const size_t i) const 60 60 { 61 return (*kf_)(vec, DataLookup1D(*data_,i ),61 return (*kf_)(vec, DataLookup1D(*data_,i,false), 62 62 DataLookup1D(vec.size(),1.0), 63 DataLookup1D(*weights_,i ));63 DataLookup1D(*weights_,i,false)); 64 64 } 65 65 … … 70 70 const size_t i) const 71 71 { 72 return (*kf_)(vec, DataLookup1D(*data_,i),w,DataLookup1D(*weights_,i)); 72 return (*kf_)(vec, DataLookup1D(*data_,i, false), 73 w,DataLookup1D(*weights_,i, false)); 73 74 } 74 75 -
trunk/lib/classifier/KernelWeighted_SEV.h
r555 r565 62 62 inline double element(const DataLookup1D& vec, const size_t i) const 63 63 { 64 return (*kf_)(vec, DataLookup1D(*data_,i ),64 return (*kf_)(vec, DataLookup1D(*data_,i, false), 65 65 DataLookup1D(vec.size(),1.0), 66 DataLookup1D(*weights_,i ));66 DataLookup1D(*weights_,i, false)); 67 67 } 68 68 … … 73 73 const size_t i) const 74 74 { 75 return (*kf_)(vec, DataLookup1D(*data_,i),w,DataLookup1D(*weights_,i)); 75 return (*kf_)(vec, DataLookup1D(*data_,i, false), 76 w,DataLookup1D(*weights_,i, false)); 76 77 } 77 78 -
trunk/lib/classifier/Kernel_MEV.h
r555 r565 58 58 /// 59 59 inline double element(const DataLookup1D& vec, const size_t i) const 60 { return kf_->operator()(vec, DataLookup1D(*data_,i )); }60 { return kf_->operator()(vec, DataLookup1D(*data_,i,false)); } 61 61 62 62 inline double element(const DataLookup1D& vec, const DataLookup1D& w, 63 63 const size_t i) const 64 {return (*kf_)(vec, DataLookup1D(*data_,i), w, DataLookup1D(w.size(),1.0));} 64 {return (*kf_)(vec, DataLookup1D(*data_,i,false), 65 w, DataLookup1D(w.size(),1.0));} 65 66 66 67 const Kernel_MEV* selected(const std::vector<size_t>& index) const; -
trunk/lib/classifier/Kernel_SEV.cc
r548 r565 40 40 double Kernel_SEV::element(const DataLookup1D& vec, const size_t i) const 41 41 { 42 return kf_->operator()(vec, DataLookup1D(*data_,i ));42 return kf_->operator()(vec, DataLookup1D(*data_,i, false)); 43 43 } 44 44 … … 46 46 const size_t i) const 47 47 { 48 return (*kf_)(vec, DataLookup1D(*data_,i), w, DataLookup1D(w.size(),1.0)); 48 return (*kf_)(vec, DataLookup1D(*data_,i, false), 49 w, DataLookup1D(w.size(),1.0)); 49 50 } 50 51 -
trunk/lib/classifier/MatrixLookup.h
r560 r565 62 62 MatrixLookup(const gslapi::matrix& matrix, 63 63 const std::vector<size_t>& index, 64 const bool row_vectors =true);64 const bool row_vectors); 65 65 66 66 /// … … 94 94 /// 95 95 MatrixLookup(const MatrixLookup& matrix, const std::vector<size_t>&, 96 const bool row_vectors =true);96 const bool row_vectors); 97 97 98 98 /// -
trunk/lib/classifier/SVM.cc
r559 r565 82 82 index.push_back(ranker_->id(i)); 83 83 kernel_ = kernel.selected(index); 84 assert(kernel_->rows()==kernel.rows()); 85 assert(kernel_->columns()==kernel.columns()); 84 86 owner_ = true; 85 87 86 88 } 87 89 -
trunk/test/data_lookup_1d_test.cc
r537 r565 41 41 *error << "DataLookup1D::DataLookup1D(const MatrixLookup&\n" 42 42 << " const size_t, const bool)..."; 43 classifier::DataLookup1D v1(m1,1 );43 classifier::DataLookup1D v1(m1,1, true); 44 44 if (v1.size()!=m1.columns() || v1(0)!=m1(1,0) || 45 45 v1(1)!=m1(1,1) ) {
Note: See TracChangeset
for help on using the changeset viewer.