CommunityDetection/f_score.cpp at master · NilanjanaLodh/CommunityDetection · GitHub

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
#include <bits/stdc++.h>
using namespace std;

double count_c_in_k(vector<double> &c, vector<double> &k) //count how many elements of vector c are in vector k
{
    vector<double> v_intersection;
    set_intersection(c.begin(), c.end(), k.begin(), k.end(), back_inserter(v_intersection));
    return v_intersection.size();
}

double recall(vector<double> &c, vector<double> &k) //recall function
{
    double res = count_c_in_k(c,k)/((double)c.size());
    return res;
}

double precision(vector<double> &c, vector<double> &k) //precision function
{
    double res = (double)count_c_in_k(c,k)/((double)k.size());
    return res;
}

double f_score_algo(vector<vector<double> > &cc, vector<vector<double> > &kk, double &N, ofstream &fa)
{
    double f_score = 0.0;
    int step = 0;
    int i, j;
    vector<double> c, k;
    for(i=0;i<cc.size();i++)
    {
        c= cc[i];
        double temp = 0.0;
        for(j=0;j<kk.size();j++)
        {
            k = kk[j];
            sort(c.begin(),c.end());
            sort(k.begin(),k.end());
            double rec = recall(c,k);
            double prec = precision(c,k);
            double f_c_k;
            if(rec==0 && prec==0)
                f_c_k = 0;
            else
                f_c_k = (double)(2*rec*prec)/(double)(rec+prec);
            temp = max(temp,f_c_k);
        }
        temp = temp*c.size();
        f_score += temp;
        step++;
    }
    f_score/=N;
    fa<<f_score;
    return f_score;
}

void display_vec(vector<vector<double> > v)
{
    int j , k;
    double i;
    for (j=0;j<v.size();j++)
    {
        for(k=0;k<v[j].size();k++)
            i = v[j][k];
            cout<<i<<" ";
        cout<<endl;
    }
}

int main(int argc, char *argv[])
{
    double number_of_nodes = 317080; //number of nodes
    string original_file = argv[1]; //original file
    string predicted_file = argv[2]; //file which is to be compared
    string ans_file = argv[3]; //file where the answer will be written
    vector<vector<double> > cc,kk; //2d vectors

    ofstream fout_a(ans_file);

    //original
    ifstream infile_o(original_file);
    for(string line; getline(infile_o,line);)
    {
        stringstream ss(line);
        double temp;
        vector<double> vec_temp;
        while(ss>>temp){
            vec_temp.push_back(temp);
        }
        cc.push_back(vec_temp);
    }
    //predicted
    ifstream infile_p(predicted_file);
    for(string line; getline(infile_p,line);)
    {
        stringstream ss(line);
        double temp;
        vector<double> vec_temp;
        while(ss>>temp){
            vec_temp.push_back(temp);
        }
        kk.push_back(vec_temp);
    }
    double ans = f_score_algo(cc,kk,number_of_nodes,fout_a); //main algorithm
    cout<<ans;
    return 0;
}