/** * Constructor */ public ExhaustiveSearch() { resetOptions(); }
sizeOfBest = countFeatures(m_bestGroup); tempSize = countFeatures(tempGroup); if (tempMerit > best_merit || (tempSize < sizeOfBest)) { best_merit = tempMerit; m_evaluations++; if (tempMerit >= best_merit) { tempSize = countFeatures(tempGroup); if (tempMerit > best_merit || (tempSize < sizeOfBest)) { best_merit = tempMerit; System.out.println("New best subset (" + Utils.doubleToString(Math.abs(best_merit), 8, 5) + "): " + printSubset(m_bestGroup)); return attributeList(m_bestGroup);
/** * Parses a given list of options. * <p/> * * <!-- options-start --> Valid options are: * <p/> * * <pre> * -V * Output subsets as the search progresses. * (default = false). * </pre> * * <!-- options-end --> * * @param options the list of options as an array of strings * @throws Exception if an option is not supported * **/ @Override public void setOptions(String[] options) throws Exception { resetOptions(); setVerbose(Utils.getFlag('V', options)); Utils.checkForRemainingOptions(options); }