-
Notifications
You must be signed in to change notification settings - Fork 4
Expand file tree
/
Copy pathroc.cpp
More file actions
133 lines (116 loc) · 3.11 KB
/
roc.cpp
File metadata and controls
133 lines (116 loc) · 3.11 KB
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
123
124
125
126
127
128
129
130
131
// Copyright (c) 2014 vassilis@entropiece.com
// www.entropiece.com
// cppROC is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#include "roc.hpp"
ROC::ROC(std::string filename){
float score;
int label;
std::ifstream inFile(filename.c_str());
if(!inFile) {
std::cerr << "File "<< filename << " not found.";
}
// read the data from the file
while(!inFile.eof()) {
inFile >> score >> label;
if (!inFile) break;
this->data.push_back(std::make_pair(score,label));
}
getROCFromData(this->data);
}
ROC::~ROC() {
}
void ROC::writeToFile(std::string filename){
std::ofstream outfile(filename.c_str());
for (int i = 0; i < this->TP.size(); i++) {
outfile << FP[i] << "\t" << TP[i] << std::endl;
}
std::cout << "ROC curve points saved to file " << filename << std::endl;
}
float ROC::get95ErrorRate(){
// TODO - Implement this
return 1.0;
}
float ROC::getAreaUnderCurve(){
// TODO - Implement this
int size = TP.size();
float q1,q2,p1,p2;
q1 = FP[0];
q2 = TP[0];
float area = 0.0;
for(int i=1;i < size;++i){
p1 = FP[i];
p2 = TP[i];
area += sqrt(pow( ((1-q1)+(1-p1))/2 * (q2-p2),2));
q1=p1;
q2=p2;
}
return area;
}
bool compare(const std::pair<float,int>&i, const std::pair<float,int>&j){
return i.first > j.first;
}
// Main ROC algorithm from the paper
// ROC Graphs: Notes and Practical Considerations for
// Researchers - Tom Fawcett (Algorithm 2)
// @TECHREPORT{Fawcett04rocgraphs:,
// author = {Tom Fawcett},
// title = {ROC Graphs: Notes and Practical Considerations for Researchers},
// year = {2004}
// }
void ROC::getROCFromData(std::vector<std::pair<float,int> > data){
//sort the data by classification score
sort(data.begin(),data.end(),compare);
int L = data.size();
int P = 0;
int N = 0;
// count positive and negative class occurences
for (int j = 0; j < data.size(); j++) {
if (data[j].second==1)
{
P++;
}
else
{
N++;
}
}
double f_i;
bool label;
//init FP TP counters
double FP = 0;
double TP = 0;
double f_prev = -std::numeric_limits<double>::infinity();
std::vector<std::pair<float,float> > R;
//loop through all data
for (int i = 0; i < L; i++) {
f_i = data[i].first;
label = data[i].second;
if (f_i != f_prev)
{
// add points to roc curves
this->TP.push_back(TP/P);
this->FP.push_back(FP/N);
f_prev = f_i;
}
if (label==1)
{
TP = TP + 1;
}
else
{
FP = FP + 1;
}
}
//add point 1-1
this->TP.push_back(TP/P);
this->FP.push_back(FP/N);
}