-
Notifications
You must be signed in to change notification settings - Fork 48
/
m_prefs_avgjg_Rnonrel.c
230 lines (217 loc) · 8.96 KB
/
m_prefs_avgjg_Rnonrel.c
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
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
/*
Copyright (c) 2008 - Chris Buckley.
Permission is granted for use and modification of this file for
research, non-commercial purposes.
*/
#include "common.h"
#include "sysfunc.h"
#include "trec_eval.h"
#include "functions.h"
#include "trec_format.h"
static int
te_calc_prefs_avgjg_Rnonrel(const EPI * epi, const REL_INFO * rel_info,
const RESULTS * results, const TREC_MEAS * tm,
TREC_EVAL * eval);
/* See trec_eval.h for definition of TREC_MEAS */
TREC_MEAS te_meas_prefs_avgjg_Rnonrel = { "prefs_avgjg_Rnonrel",
" Ratio of preferences fulfilled to preferences possible within a\n\
judgment group, averaged over jgs, except that the number of\n\
nonrelevant retrieved docs (rel_level == 0.0) in each jg is set to\n\
R, the number of relevant retrieved docs (rel_level > 0.0) in that jg.\n\
\n\
This addresses the general problem that the number of\n\
nonrelevant docs judged for a topic can be critical to fair\n\
evaluation - adding a couple of hundred preferences involving\n\
nonrelevant docs (out of the possibly millions in a collection) can\n\
both change the importance of the topic when averaging and even\n\
change whether system A scores better than system B (even given\n\
identical retrieval on the added nonrel docs).\n\
\n\
This measure conceptually sets the number of nonrelevant retrieved\n\
docs of a jg to R. If the actual number, N, is less than R, then R\n\
* (R-N) fulfilled preferences are added. If N is greater than R,\n\
then only the first R (rank order) docs in the single ec with\n\
rel_level = 0.0 are used and the number of preferences are\n\
recalculated. \n\
If there is a single jg with two equivalence classes (one of them 0.0), \n\
then prefs_avgjg_Rnonrel is akin to the ranked measure bpref.\n\
Assumes '-R prefs' or '-R qrels_prefs'\n",
te_init_meas_s_double,
te_calc_prefs_avgjg_Rnonrel,
te_acc_meas_s,
te_calc_avg_meas_s,
te_print_single_meas_s_double,
te_print_final_meas_s_double,
NULL, -1
};
static void recalculate(const JG * jg, const long num_judged_ret,
long *ret_num_ful, long *ret_num_poss);
static int
te_calc_prefs_avgjg_Rnonrel(const EPI * epi, const REL_INFO * rel_info,
const RESULTS * results, const TREC_MEAS * tm,
TREC_EVAL * eval)
{
RESULTS_PREFS rp;
long i;
double sum;
long R, N;
long num_ful, num_poss;
if (UNDEF == form_prefs_counts(epi, rel_info, results, &rp))
return (UNDEF);
sum = 0.0;
for (i = 0; i < rp.num_jgs; i++) {
R = rp.jgs[i].num_rel;
N = rp.jgs[i].num_nonrel;
if (R >= N) {
/* All pref counts calculated are good, need to add R-N non_relevant
successes to all retrieved rel docs */
num_ful = rp.jgs[i].num_prefs_fulfilled_ret;
num_ful += rp.jgs[i].num_prefs_fulfilled_imp;
num_poss = rp.jgs[i].num_prefs_possible_ret;
num_poss += rp.jgs[i].num_prefs_possible_imp;
num_poss += rp.jgs[i].num_prefs_possible_notoccur;
num_ful += rp.jgs[i].num_rel_ret * (R - N);
num_poss += rp.jgs[i].num_rel * (R - N);
sum += (double) num_ful / (double) num_poss;
} else {
/* Need to recalculate pref counts from scratch since want to
ignore some nonrelevant docs that were counted */
recalculate(&rp.jgs[i], rp.num_judged_ret, &num_ful, &num_poss);
sum += (double) num_ful / (double) num_poss;
}
}
/* average over jgs */
if (sum > 0.0) {
eval->values[tm->eval_index].value = sum / (double) rp.num_jgs;
}
return (1);
}
/* Recalculate preferences for this jg. Code here adapted from
form_prefs_counts. */
/* Note: know num_nonrel_ret > 0, so don't have to worry
about degenerate cases here. Nonrel docs are in last jg->jg_ec_list. */
static void
recalculate(const JG * jg, const long num_judged_ret, long *ret_num_ful,
long *ret_num_poss)
{
long num_ful = 0;
long num_poss = 0;
/* Prefs are represented in one of two possible ways in this JG -
either thorugh EC or through prefs_array. Calculate separately */
if (jg->num_ecs > 0) {
long ec1, ec2;
long *ptr1, *ptr2;
/* Construct new last EC, composed of first R nonrel docs */
EC new_nonrel_ec = { 0.0, jg->num_rel,
jg->ecs[jg->num_ecs - 1].docid_ranks
};
/* Calculate all prefs between rel docs */
for (ec1 = 0; ec1 < jg->num_ecs; ec1++) {
for (ec2 = ec1 + 1; ec2 < jg->num_ecs - 1; ec2++) {
for (ptr1 = jg->ecs[ec1].docid_ranks;
ptr1 < &jg->ecs[ec1].docid_ranks[jg->ecs[ec1].num_in_ec];
ptr1++) {
for (ptr2 = jg->ecs[ec2].docid_ranks;
ptr2 <
&jg->ecs[ec2].docid_ranks[jg->ecs[ec2].num_in_ec];
ptr2++) {
if (*ptr1 < *ptr2 && *ptr1 < num_judged_ret)
/* judgment fulfilled */
num_ful++;
else
num_poss++;
}
}
}
}
/* Calculate all prefs between rel docs and new non_rel EC */
for (ec1 = 0; ec1 < jg->num_ecs; ec1++) {
for (ptr1 = jg->ecs[ec1].docid_ranks;
ptr1 < &jg->ecs[ec1].docid_ranks[jg->ecs[ec1].num_in_ec];
ptr1++) {
for (ptr2 = new_nonrel_ec.docid_ranks;
ptr2 < &new_nonrel_ec.docid_ranks[new_nonrel_ec.num_in_ec];
ptr2++) {
if (*ptr1 < *ptr2 && *ptr1 < num_judged_ret)
/* judgment fulfilled */
num_ful++;
else
num_poss++;
}
}
}
num_poss += num_ful;
} else {
/* Preference array. Go through jg->rel_array in order and find
the num_rel'th nonrel doc (rel_array = 0.0). Any nonrel doc
after that, will not be considered part of the pref array.
Will therefore ignore all rows and columns of the prefs array
that correspond to those nonrel docs.
Note code is now inefficient, but want it to remain parallel
to the code in form_prefs_count for now */
long i, j;
long first_discarded_nonrel;
unsigned char **a = jg->prefs_array.array;
long num_nonrel_seen = 0;
long num_judged = jg->prefs_array.num_judged;
for (i = 0; i < num_judged; i++) {
if (jg->rel_array[i] == 0.0) {
num_nonrel_seen++;
if (num_nonrel_seen == jg->num_rel + 1)
break;
}
}
first_discarded_nonrel = i;
for (i = 0; i < num_judged_ret; i++) {
if (i >= first_discarded_nonrel && jg->rel_array[i] == 0.0)
continue;
for (j = 0; j < i; j++) {
if (j >= first_discarded_nonrel && jg->rel_array[j] == 0.0)
continue;
if (a[i][j]) {
/* Pref not fulfilled. Area A2 (see comment at top) */
num_poss++;
}
}
for (j = i + 1; j < num_judged_ret; j++) {
if (j >= first_discarded_nonrel && jg->rel_array[j] == 0.0)
continue;
if (a[i][j]) {
/* Pref fulfilled. Area A1 (see comment at top) */
num_ful++;
}
}
for (j = num_judged_ret; j < num_judged; j++) {
if (j >= first_discarded_nonrel && jg->rel_array[j] == 0.0)
continue;
if (a[i][j]) {
/* Pref fulfilled implied. Area A3 (see comment at top) */
num_ful++;
}
}
}
for (i = num_judged_ret; i < num_judged; i++) {
if (i >= first_discarded_nonrel && jg->rel_array[i] == 0.0)
continue;
for (j = 0; j < num_judged_ret; j++) {
if (j >= first_discarded_nonrel && jg->rel_array[j] == 0.0)
continue;
if (a[i][j]) {
/* Pref not fulfilled implied. Area A4 (see comment at top) */
num_poss++;
}
}
for (j = num_judged_ret; j < num_judged; j++) {
if (j >= first_discarded_nonrel && jg->rel_array[j] == 0.0)
continue;
if (a[i][j]) {
/* Pref not occur at all. Area A5 (see comment at top) */
num_poss++;
}
}
}
num_poss += num_ful;
}
*ret_num_ful = num_ful;
*ret_num_poss = num_poss;
}