summaryrefslogtreecommitdiff
path: root/model/ranksvm.h
diff options
context:
space:
mode:
authorJoe Zhao <ztuowen@gmail.com>2015-05-13 18:56:39 +0800
committerJoe Zhao <ztuowen@gmail.com>2015-05-13 18:56:39 +0800
commit52ca742e14e36cd37010bae9a7678dd5b1a7eaf5 (patch)
treee76674e9ae78764de175f57d7a3bb162c6ac0ed4 /model/ranksvm.h
parent20587ac550cfcb2d7b3d6ec16e46ba1a8d0af869 (diff)
downloadranksvm-52ca742e14e36cd37010bae9a7678dd5b1a7eaf5.tar.gz
ranksvm-52ca742e14e36cd37010bae9a7678dd5b1a7eaf5.tar.bz2
ranksvm-52ca742e14e36cd37010bae9a7678dd5b1a7eaf5.zip
branched for mem
Diffstat (limited to 'model/ranksvm.h')
-rw-r--r--model/ranksvm.h2
1 files changed, 1 insertions, 1 deletions
diff --git a/model/ranksvm.h b/model/ranksvm.h
index aa5e1ca..58cd7f0 100644
--- a/model/ranksvm.h
+++ b/model/ranksvm.h
@@ -25,7 +25,7 @@ protected:
SVMModel model;
int fsize;
public:
- virtual int train(DataList &D)=0;
+ virtual int train(RidList &D)=0;
virtual int predict(DataList &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.