saveRandomScores(); //save all random scores for unweighted file
//find the signifigance of the score
- float rcumul = 0.0000;
+ float rcumul = 1.0000;
for (it = rscoreFreq.begin(); it != rscoreFreq.end(); it++) {
+ rCumul[it->first] = rcumul;
//get percentage of random trees with that info
rscoreFreq[it->first] /= iters;
- rcumul+= it->second;
- rCumul[it->first] = rcumul;
+ rcumul-= it->second;
+
}
//save the signifigance of the users score for printing later
rCumul.clear();
}
- float ucumul = 0.0000;
- float rcumul = 0.0000;
+ float ucumul = 1.0000;
+ float rcumul = 1.0000;
//this loop fills the cumulative maps and put 0.0000 in the score freq map to make it easier to print.
for (it = validScores.begin(); it != validScores.end(); it++) {
it2 = uscoreFreq.find(it->first);
- //user data has that score
- if (it2 != uscoreFreq.end()) { uscoreFreq[it->first] /= T.size(); ucumul+= it2->second; }
- else { uscoreFreq[it->first] = 0.0000; } //no user trees with that score
//make uCumul map
uCumul[it->first] = ucumul;
-
+ //user data has that score
+ if (it2 != uscoreFreq.end()) { uscoreFreq[it->first] /= T.size(); ucumul-= it2->second; }
+ else { uscoreFreq[it->first] = 0.0000; } //no user trees with that score
+
//make rscoreFreq map and rCumul
it2 = totalrscoreFreq.find(it->first);
+ rCumul[it->first] = rcumul;
//get percentage of random trees with that info
- if (it2 != totalrscoreFreq.end()) { totalrscoreFreq[it->first] /= (iters*T.size()); rcumul+= it2->second; }
+ if (it2 != totalrscoreFreq.end()) { totalrscoreFreq[it->first] /= (iters*T.size()); rcumul-= it2->second; }
else { totalrscoreFreq[it->first] = 0.0000; } //no random trees with that score
- rCumul[it->first] = rcumul;
+
}
printUnweightedFile();
printUWSummaryFile();
- //reset randomTree parameter to 0
- globaldata->setRandomTree("0");
-
delete randT;
return 0;
map<float, float> rscoreFreq; //unweighted score, number of random trees with that score.
map<float, float> uscoreFreq; //unweighted, number of user trees with that score.
map<float, float> totalrscoreFreq; //unweighted score, number of random trees with that score.
- map<float, float> rCumul; //unweighted score, cumulative percentage of number of random trees with that score or lower.
- map<float, float> uCumul; //unweighted, cumulative percentage of number of user trees with that score or lower .
+ map<float, float> rCumul; //unweighted score, cumulative percentage of number of random trees with that score or higher.
+ map<float, float> uCumul; //unweighted, cumulative percentage of number of user trees with that score or higher .
map<float, float>::iterator it;
map<float, float>::iterator it2;
//find the signifigance of the score for summary file
for (int t = 0; t < numComp; t++) {
- float rcumul = 0.0000;
+ float rcumul = 1.0000;
for (it = validScores[t].begin(); it != validScores[t].end(); it++) {
//make rscoreFreq map and rCumul
it2 = rscoreFreq[t].find(it->first);
+ rCumul[t][it->first] = rcumul;
//get percentage of random trees with that info
- if (it2 != rscoreFreq[t].end()) { rscoreFreq[t][it->first] /= iters; rcumul+= it2->second; }
+ if (it2 != rscoreFreq[t].end()) { rscoreFreq[t][it->first] /= iters; rcumul-= it2->second; }
else { rscoreFreq[t][it->first] = 0.0000; } //no random trees with that score
- rCumul[t][it->first] = rcumul;
}
}
rCumul.resize(numComp);
for (int b = 0; b < numComp; b++) {
- float ucumul = 0.0000;
- float rcumul = 0.0000;
+ float ucumul = 1.0000;
+ float rcumul = 1.0000;
//this loop fills the cumulative maps and put 0.0000 in the score freq map to make it easier to print.
- for (it = validScores[b].end(); it == validScores[b].begin(); it--) {
+ for (it = validScores[b].begin(); it != validScores[b].end(); it++) {
it2 = uscoreFreq[b].find(it->first);
- //user data has that score
- if (it2 != uscoreFreq[b].end()) { uscoreFreq[b][it->first] /= T.size(); ucumul+= it2->second; }
- else { uscoreFreq[b][it->first] = 0.0000; } //no user trees with that score
//make uCumul map
uCumul[b][it->first] = ucumul;
+ //user data has that score
+ if (it2 != uscoreFreq[b].end()) { uscoreFreq[b][it->first] /= T.size(); ucumul-= it2->second; }
+ else { uscoreFreq[b][it->first] = 0.0000; } //no user trees with that score
//make rscoreFreq map and rCumul
it2 = totalrscoreFreq[b].find(it->first);
+ rCumul[b][it->first] = rcumul;
//get percentage of random trees with that info
- if (it2 != totalrscoreFreq[b].end()) { totalrscoreFreq[b][it->first] /= (iters * T.size()); rcumul+= it2->second; }
+ if (it2 != totalrscoreFreq[b].end()) { totalrscoreFreq[b][it->first] /= (iters * T.size()); rcumul-= it2->second; }
else { totalrscoreFreq[b][it->first] = 0.0000; } //no random trees with that score
- rCumul[b][it->first] = rcumul;
- }
+ }
}
printWeightedFile();
vector< map<float, float> > rscoreFreq; //vector<weighted score, number of random trees with that score.> each group comb has an entry
vector< map<float, float> > uscoreFreq; //vector<weighted, number of user trees with that score.> each group comb has an entry
vector< map<float, float> > totalrscoreFreq; //vector<weighted score, number of random trees with that score.> each group comb has an entry
- vector< map<float, float> > rCumul; //vector<weighted score, number of random trees with that score.> each group comb has an entry
- vector< map<float, float> > uCumul; //vector<weighted, cumulative percentage of number of user trees with that score or lower.> each group comb has an entry
+ vector< map<float, float> > rCumul; //vector<weighted score, number of random trees with that score or higher.> each group comb has an entry
+ vector< map<float, float> > uCumul; //vector<weighted, cumulative percentage of number of user trees with that score or higher.> each group comb has an entry
map<float, float>::iterator it;
map<float, float>::iterator it2;