summaryrefslogtreecommitdiff
path: root/model/rankaccu.h
blob: a5866da6baa24030d20a13609b985ec3fe1029cb (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
//
// Created by joe on 4/12/15.
//

#ifndef RANKSVM_RANKACCU_H
#define RANKSVM_RANKACCU_H

#include<vector>
#include"../tools/dataProvider.h"

#define CMC_MAX 100

class CMC
{
private:
    std::vector<double> acc;
    int cnt;
    double sum;
public:
    void clear(){for (int i=0;i<CMC_MAX;++i) acc[i]=0; cnt=0; sum=0;};
    CMC(){acc.reserve(CMC_MAX); clear();};
    void addEntry(int idx) { ++cnt; if (idx <CMC_MAX) acc[idx]+=1; sum+=idx;}
    std::vector<double> getAcc() {
        std::vector<double> res;
        res.reserve(CMC_MAX);
        double cumu = 0;
        for (int i=0;i<CMC_MAX;++i)
        {
            cumu += acc[i];
            res[i] = cumu / cnt;
        }
        return res;
    }
    int getCount()
    {
        return cnt;
    }
    double getAvg()
    {
        return sum/cnt;
    }
};

class Fscore
{
private:
    std::vector<double> pos,neg;
    std::vector<double> apos,aneg;
    int cpos,cneg;
    int f;
public:
    void clear() {
        cpos=0;cneg=0;pos.clear();neg.clear();apos.clear();aneg.clear();
    }
    Fscore(){clear();}
    void init(int fsize) {
        f=fsize;pos.resize(fsize);neg.resize(fsize);apos.resize(fsize);aneg.resize(fsize);
        for (int i=0;i<fsize;++i) apos[i]=aneg[i]=pos[i]=neg[i]=0;
    }
    void firstPass(RidList &rid,int x){
        Eigen::VectorXd vec = rid.getVec(x);
        std::vector<double> *p;
        if (rid.getL(x)>0) {
            p=&apos;
            cpos+=1;
        }
        else {
            p=&aneg;
            cneg+=1;
        }
        for (int i=0;i<f;++i)
            (*p)[i]+=vec(i);
    }
    void calAvg(){
        for (int i=0;i<f;++i)
            apos[i]/=cpos;
        for (int i=0;i<f;++i)
            aneg[i]/=cneg;
    }
    void secondPass(RidList &rid,int x){
        Eigen::VectorXd vec = rid.getVec(x);
        std::vector<double> *p,*a;
        if (rid.getL(x)>0) {
            p=&pos;
            a=&apos;
        }
        else {
            p=&neg;
            a=&aneg;
        }
        for (int i=0;i<f;++i)
            (*p)[i]+=(vec(i)-(*a)[i])*(vec(i)-(*a)[i]);
    }
    std::vector<double> getFscore(){
        std::vector<double> res;
        res.reserve(f);
        for (int i=0;i<f;++i)
        {
            double avg;
            avg = (cpos*apos[i]+cneg*aneg[i])/(cpos+cneg);
            res[i] = (apos[i]-avg)*(apos[i]-avg)+(aneg[i]-avg)*(aneg[i]-avg);
            res[i] /= pos[i]/(cpos-1)+neg[i]/(cneg-1);
        }
        return res;
    }
    void audit(RidList &rid){
        init(rid.getfSize());
        for (int i=0;i<rid.getSize();++i)
            firstPass(rid,i);
        calAvg();
        for (int i=0;i<rid.getSize();++i)
            secondPass(rid,i);
    }
};

void rank_CMC(RidList &D,const std::vector<double> pred,CMC & cmc);

void rank_accu(RidList &D,const std::vector<double> pred);

void rank_pair(RidList &D,const std::vector<double> pred,std::vector<double> &pair);

#endif //RANKSVM_RANKACCU_H