1 write to LabelMap
Microsoft.ML.FastTree (1)
Training\DcgCalculator.cs (1)
46
set {
LabelMap
= value; }
14 references to LabelMap
Microsoft.ML.FastTree (14)
Training\DcgCalculator.cs (14)
45
get { return
LabelMap
; }
127
Array.Clear(labelCounts, 0,
LabelMap
.Length);
135
int topLabel =
LabelMap
.Length - 1;
145
maxDcg +=
LabelMap
[topLabel] / Math.Log(2.0 + t);
244
double dcg =
LabelMap
[maxLabel1] * DiscountMap[0];
246
dcg +=
LabelMap
[maxLabel2] * DiscountMap[1];
248
dcg +=
LabelMap
[maxLabel3] * DiscountMap[2];
290
double dcg =
LabelMap
[queryLabels[0]] * DiscountMap[0] +
291
LabelMap
[queryLabels[1]] * DiscountMap[1] +
292
LabelMap
[queryLabels[2]] * DiscountMap[2];
310
result +=
LabelMap
[labelsSorted[query][0]] / maxDCG1[query];
353
return
LabelMap
[argMaxLabel] * DiscountMap[0];
422
dcg = dcg +
LabelMap
[labels[begin + permutation[t]]] * DiscountMap[t];
484
dcg += discount[d - begin] *
LabelMap
[ratings[begin + order[d]]];