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

include updated functions in relevancy computations

Browse Source
This commit is contained in:
Jonathan Shook
2023-10-09 11:21:54 -05:00
parent c6b69bfa58
commit aed2ee8d58
1 changed files with 6 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -80,6 +80,7 @@ public class ComputeFunctions {
if (actual.length < k) {
throw new RuntimeException("indices fewer than limit, invalid precision computation: index count=" + actual.length + ", limit=" + k);
}
relevant = Arrays.copyOfRange(relevant,0,k);
actual = Arrays.copyOfRange(actual, 0, k);
Arrays.sort(relevant);
Arrays.sort(actual);
@@ -126,6 +127,7 @@ public class ComputeFunctions {
if (actual.length < k) {
throw new RuntimeException("indices fewer than limit, invalid precision computation: index count=" + actual.length + ", limit=" + k);
}
relevant = Arrays.copyOfRange(relevant,0,k);
actual = Arrays.copyOfRange(actual, 0, k);
Arrays.sort(relevant);
Arrays.sort(actual);
@@ -158,6 +160,7 @@ public class ComputeFunctions {
* Reciprocal Rank - The multiplicative inverse of the first rank which is relevant.
*/
public static double reciprocal_rank(long[] relevant, long[] actual, int k) {
relevant = Arrays.copyOfRange(relevant,0,k);
int firstRank = Intersections.firstMatchingIndex(relevant, actual, k);
if (firstRank >= 0) {
return 1.0d / (firstRank+1);
@@ -174,6 +177,7 @@ public class ComputeFunctions {
* RR as in M(RR)
*/
public static double reciprocal_rank(int[] relevant, int[] actual, int k) {
relevant = Arrays.copyOfRange(relevant,0,k);
int firstRank = Intersections.firstMatchingIndex(relevant, actual, k);
if (firstRank<0) {
return 0;
@@ -190,6 +194,7 @@ public class ComputeFunctions {
}
public static double average_precision(int[] relevant, int[] actual, int k) {
relevant = Arrays.copyOfRange(relevant,0,k);
int maxK = Math.min(k,actual.length);
HashSet<Integer> relevantSet = new HashSet<>(relevant.length);
for (Integer i : relevant) {
@@ -211,6 +216,7 @@ public class ComputeFunctions {
return average_precision(relevant, actual, actual.length);
}
public static double average_precision(long[] relevant, long[] actual, int k) {
relevant = Arrays.copyOfRange(relevant,0,k);
int maxK = Math.min(k,actual.length);
HashSet<Long> refset = new HashSet<>(relevant.length);
for (Long i : relevant) {