diff options
author | Joe Zhao <ztuowen@gmail.com> | 2015-06-27 20:42:23 +0800 |
---|---|---|
committer | Joe Zhao <ztuowen@gmail.com> | 2015-06-27 20:42:23 +0800 |
commit | 60881b380b02637c27497c4508faf2345a534679 (patch) | |
tree | 7813e01519a4ee8e8523b8d9445b94ae91afed38 /model/ranksvm.h | |
parent | 76193f75ae34aa587bd87bed17a4b92eec8c6203 (diff) | |
download | ranksvm-60881b380b02637c27497c4508faf2345a534679.tar.gz ranksvm-60881b380b02637c27497c4508faf2345a534679.tar.bz2 ranksvm-60881b380b02637c27497c4508faf2345a534679.zip |
comments & readme
Diffstat (limited to 'model/ranksvm.h')
-rw-r--r-- | model/ranksvm.h | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/model/ranksvm.h b/model/ranksvm.h index a17e3c9..a19ad63 100644 --- a/model/ranksvm.h +++ b/model/ranksvm.h @@ -27,8 +27,6 @@ protected: public: virtual int train(RidList &D)=0; virtual int predict(RidList &D,std::vector<double> &res)=0; - // TODO Not sure how to construct this - // Possible solution: generate a nxn matrix each row contains the sorted list of ranker result. int saveModel(const std::string fname); static RSVM* loadModel(const std::string fname); virtual std::string getName()=0; |