/** * Chooses the bit position that minimizes the number of false negative generated while maximizing. * the number of false positive removed. * @param h The different bit positions. * @return The position that minimizes the number of false negative generated while maximizing. */ private int ratioRemove(int[] h) { computeRatio(); int minIndex = Integer.MAX_VALUE; double minValue = Double.MAX_VALUE; for (int i = 0; i < nbHash; i++) { if (ratio[h[i]] < minValue) { minValue = ratio[h[i]]; minIndex = h[i]; } } return minIndex; }
/** * Chooses the bit position that minimizes the number of false negative generated while maximizing. * the number of false positive removed. * @param h The different bit positions. * @return The position that minimizes the number of false negative generated while maximizing. */ private int ratioRemove(int[] h) { computeRatio(); int minIndex = Integer.MAX_VALUE; double minValue = Double.MAX_VALUE; for (int i = 0; i < nbHash; i++) { if (ratio[h[i]] < minValue) { minValue = ratio[h[i]]; minIndex = h[i]; } } return minIndex; }
/** * Chooses the bit position that minimizes the number of false negative generated while maximizing. * the number of false positive removed. * @param h The different bit positions. * @return The position that minimizes the number of false negative generated while maximizing. */ private int ratioRemove(int[] h) { computeRatio(); int minIndex = Integer.MAX_VALUE; double minValue = Double.MAX_VALUE; for (int i = 0; i < nbHash; i++) { if (ratio[h[i]] < minValue) { minValue = ratio[h[i]]; minIndex = h[i]; } } return minIndex; }
/** * Chooses the bit position that minimizes the number of false negative generated while maximizing. * the number of false positive removed. * @param h The different bit positions. * @return The position that minimizes the number of false negative generated while maximizing. */ private int ratioRemove(int[] h) { computeRatio(); int minIndex = Integer.MAX_VALUE; double minValue = Double.MAX_VALUE; for (int i = 0; i < nbHash; i++) { if (ratio[h[i]] < minValue) { minValue = ratio[h[i]]; minIndex = h[i]; } } return minIndex; }
/** * Chooses the bit position that minimizes the number of false negative generated while maximizing. * the number of false positive removed. * @param h The different bit positions. * @return The position that minimizes the number of false negative generated while maximizing. */ private int ratioRemove(int[] h) { computeRatio(); int minIndex = Integer.MAX_VALUE; double minValue = Double.MAX_VALUE; for (int i = 0; i < nbHash; i++) { if (ratio[h[i]] < minValue) { minValue = ratio[h[i]]; minIndex = h[i]; } } return minIndex; }
/** * Chooses the bit position that minimizes the number of false negative generated while maximizing. * the number of false positive removed. * @param h The different bit positions. * @return The position that minimizes the number of false negative generated while maximizing. */ private int ratioRemove(int[] h) { computeRatio(); int minIndex = Integer.MAX_VALUE; double minValue = Double.MAX_VALUE; for (int i = 0; i < nbHash; i++) { if (ratio[h[i]] < minValue) { minValue = ratio[h[i]]; minIndex = h[i]; } } return minIndex; }