IntenseFinance/nosqlbench
3
0
Fork 0
mirror of https://github.com/nosqlbench/nosqlbench.git synced 2025-02-25 18:55:28 -06:00
Code Issues Packages Projects Releases Wiki Activity

implement reciprocal rank

Browse Source
This commit is contained in:
Jonathan Shook 2023-09-07 11:20:16 -05:00
parent bc3ebfaa15
commit 4fa99daf68
3 changed files with 66 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

29
engine-extensions/src/main/java/io/nosqlbench/engine/extensions/computefunctions/ComputeFunctions.java
View File

@ -189,4 +189,33 @@ public class ComputeFunctions {
return 2.0d * ((recallAtK * precisionAtK) / (recallAtK + precisionAtK));
}
/**
* Reciprocal Rank - The multiplicative inverse of the first rank which is relevant.
*/
public static double RR(long[] reference, long[] sample, int limit) {
int firstRank = Intersections.firstMatchingIndex(reference, sample, limit);
if (firstRank >= 0) {
return 1.0d / (firstRank+1);
} else {
return 0.0;
}
}
public static double RR(long[] reference, long[] sample) {
return RR(reference, sample, reference.length);
}
public static double RR(int[] reference, int[] sample, int limit) {
int firstRank = Intersections.firstMatchingIndex(reference, sample, limit);
if (firstRank >= 0) {
return 1.0d / (firstRank+1);
} else {
return 0.0;
}
}
public static double RR(int[] reference, int[] sample) {
return RR(reference, sample, reference.length);
}
}

26
engine-extensions/src/main/java/io/nosqlbench/engine/extensions/computefunctions/Intersections.java
View File

@ -20,6 +20,32 @@ import java.util.Arrays;
public class Intersections {
/**
* Return a non-negative index of the first value in the sample array which is present in the reference array,
* OR, return a negative number. This returns array index which start at 0, not rank, which is starts at 1.
*/
public static int firstMatchingIndex(long[] reference, long[] sample, int limit) {
Arrays.sort(reference);
int maxIndex = Math.min(sample.length, limit);
int foundAt=-1;
for (int index = 0; index < maxIndex; index++) {
foundAt = Arrays.binarySearch(reference, sample[index]);
if (foundAt>=0) break;
}
return foundAt;
}
public static int firstMatchingIndex(int[] reference, int[] sample, int limit) {
Arrays.sort(reference);
int maxIndex = Math.min(sample.length, limit);
int foundAt=-1;
for (int index = 0; index < maxIndex; index++) {
foundAt = Arrays.binarySearch(reference, sample[index]);
if (foundAt>=0) break;
}
return foundAt;
}
public static int count(int[] reference, int[] sample) {
return count(reference,sample,reference.length);
}

11
engine-extensions/src/test/java/io/nosqlbench/engine/extensions/computefunctions/ComputeFunctionsTest.java
View File

@ -78,4 +78,15 @@ class ComputeFunctionsTest {
}
}
@Test
public void testReciprocalRank() {
assertThat(ComputeFunctions.RR(intsBy3_369,highInts56789))
.as("relevant results in rank 2 should yield RR=0.5")
.isCloseTo(0.5d,offset);
assertThat(ComputeFunctions.RR(highInts56789,lowInts01234))
.as("no relevant results should yield RR=0.0")
.isCloseTo(0.0d,offset);
}
}