recommenders/evaluator/backend/cpp/include/metric.h - master - githubmirror/Agent4Rec

recommenders/evaluator/backend/cpp/include/metric.h
131 строка3 KB
chenyuxin1999
init repo
12 окт 2023, 05:43
12 окт 2023, 05:439a08cc7
/*
@author: Zhongchuan Sun
*/
#ifndef METRIC_H
#define METRIC_H

#include <vector>
#include <unordered_set>
#include <unordered_map>
#include <cmath>

using std::vector;
using std::unordered_set;
using std::unordered_map;


void precision(const vector<int> &rank, const unordered_set<int> &truth, float *result_pt)
{
    int hits = 0;
    for(unsigned int i=0; i<rank.size(); i++)
    {
        if(truth.find(rank[i]) != truth.end())
        {
            hits += 1;
        }
        result_pt[i] = 1.0*hits / (i+1);
    }
}


void recall(const vector<int> &rank, const unordered_set<int> &truth, float *result_pt)
{
    int hits = 0;
    auto truth_len = truth.size();
    for(unsigned int i=0; i<rank.size(); i++)
    {
        if(truth.find(rank[i]) != truth.end())
        {
            hits += 1;
        }
        result_pt[i] = 1.0*hits / truth_len;
    }
}


void ap(const vector<int> &rank, const unordered_set<int> &truth, float *result_pt)
{
    int hits = 0;
    float pre = 0;
    float sum_pre = 0;
    for(unsigned int i=0; i<rank.size(); i++)
    {
        if(truth.find(rank[i]) != truth.end())
        {
            hits += 1;
            pre = 1.0*hits / (i+1);
            sum_pre += pre;
        }
        result_pt[i] = (hits == 0) ? 0.0 : sum_pre/hits;
        // result_pt[i] = sum_pre/hits;
    }
}



void ndcg(const vector<int> &rank, const unordered_set<int> &truth, float *result_pt)
{
    float iDCG = 0;
    float DCG = 0;
    auto truth_len = truth.size();
    for(unsigned int i=0; i<rank.size(); i++)
    {
        if(truth.find(rank[i]) != truth.end())
        {
            DCG += 1.0/log2(i+2);
        }
        if(i<truth_len)
        {
            iDCG += 1.0/log2(i+2);
        }
        result_pt[i] = DCG/iDCG;
    }
}


void mrr(const vector<int> &rank, const unordered_set<int> &truth, float *result_pt)
{
    float rr = 0;
    for(unsigned int i=0; i<rank.size(); i++)
    {
        if(truth.find(rank[i]) != truth.end())
        {
            rr = 1.0/(i+1);
            for(auto j=i; j<rank.size(); j++)
            {
                result_pt[j] = rr;
            }
            break;
        }
        else
        {
            rr = 0.0;
            result_pt[i] =rr;
        }
    }
}


void hr(const vector<int> &rank, const unordered_set<int> &truth, float *result_pt)
{
    float hits = 0;
    for(unsigned int i=0; i<rank.size(); i++)
    {
        if(truth.find(rank[i]) != truth.end())
        {
            hits = 1.0;
        }
        result_pt[i] = hits;
    }
}

typedef void(*metric_fun)(const vector<int> &, const unordered_set<int> &, float *);
unordered_map<int, metric_fun> metric_dict = {{1, precision},
                                              {2, recall},
                                              {3, ap},
                                              {4, ndcg},
                                              {5, mrr},
                                              {6, hr}
                                             };

#endif