sorted_scores.sort(key=operator.itemgetter(1), reverse=False)
// Compute error rate
n_match = sum(1 for x in sorted_scores if x[0] == 1)
n_thresh = recall_point * n_match
tp = 0
count = 0
for label, score in sorted_scores:
After Change
def ErrorRateAt95Recall(labels, scores):
distances = 1.0 / (scores + 1e-8)
recall_point = 0.95
labels = labels[np.argsort(distances)]
// Sliding threshold: get first index where recall >= recall_point.
// This is the index where the number of elements with label==1 below the threshold reaches a fraction of
// "recall_point" of the total number of elements with label==1.
// (np.argmax returns the first occurrence of a "1" in a bool array).
