/** Creates a default BestFirst */ public ASSearch getSearch() { return new GreedyStepwise(); }
search(m_ASEval, null); resetOptions(); m_doneRanking = true; m_calculatedNumToSelect = final_rank.length; } else { determineNumToSelectFromThreshold(final_rank);
/** * Set whether to search backwards instead of forwards * * @param back true to search backwards */ public void setSearchBackwards(boolean back) { m_backward = back; if (m_backward) { setGenerateRanking(false); } }
if (getSearchBackwards()) { options.add("-B"); if (getConservativeForwardSelection()) { options.add("-C"); if (!(getStartSet().equals(""))) { options.add("-P"); options.add("" + startSetToString()); if (getGenerateRanking()) { options.add("-R"); options.add("" + getThreshold()); options.add("" + getNumToSelect()); options.add("" + getNumExecutionSlots()); if (getDebuggingOutput()) { options.add("-D");
public void setOptions(String[] options) throws Exception { String optionString; resetOptions(); setSearchBackwards(Utils.getFlag('B', options)); setConservativeForwardSelection(Utils.getFlag('C', options)); setStartSet(optionString); setGenerateRanking(Utils.getFlag('R', options)); Double temp; temp = Double.valueOf(optionString); setThreshold(temp.doubleValue()); setNumToSelect(Integer.parseInt(optionString)); setNumExecutionSlots(Integer.parseInt(optionString)); setDebuggingOutput(Utils.getFlag('D', options));
GreedyStepwise fs = new GreedyStepwise(); double[][] rankres; fs.setGenerateRanking(true); m_ASEval.buildEvaluator(m_Instances); fs.search(m_ASEval, m_Instances); rankres = fs.rankedAttributes(); m_Ranking = new int[rankres.length]; for (int i = 0; i < rankres.length; i++) {
GreedyStepwise search = new GreedyStepwise(); search.setSearchBackwards(this.backwardSelection);
resetOptions(); m_Instances = new Instances(data, 0); if (!(getStartSet().equals(""))) { m_starting = m_startRange.getSelection(); if (m_debug) { System.err.print("Best subset found so far: "); int[] atts = attributeList(m_best_group); for (int a : atts) { System.err.print("" + (a + 1) + " "); return attributeList(m_best_group);
public void setOptions(String[] options) throws Exception { String optionString; resetOptions(); setSearchBackwards(Utils.getFlag('B', options)); setConservativeForwardSelection(Utils.getFlag('C', options)); setStartSet(optionString); setGenerateRanking(Utils.getFlag('R', options)); Double temp; temp = Double.valueOf(optionString); setThreshold(temp.doubleValue()); setNumToSelect(Integer.parseInt(optionString)); setNumExecutionSlots(Integer.parseInt(optionString)); setDebuggingOutput(Utils.getFlag('D', options));
if (getSearchBackwards()) { options.add("-B"); if (getConservativeForwardSelection()) { options.add("-C"); if (!(getStartSet().equals(""))) { options.add("-P"); options.add("" + startSetToString()); if (getGenerateRanking()) { options.add("-R"); options.add("" + getThreshold()); options.add("" + getNumToSelect()); options.add("" + getNumExecutionSlots()); if (getDebuggingOutput()) { options.add("-D");
resetOptions(); m_Instances = new Instances(data, 0); if (!(getStartSet().equals(""))) { m_starting = m_startRange.getSelection(); if (m_debug) { System.err.print("Best subset found so far: "); int[] atts = attributeList(m_best_group); for (int a : atts) { System.err.print("" + (a + 1) + " "); return attributeList(m_best_group);
/** Creates a default GreedyStepwise */ public ASSearch getSearch() { return new GreedyStepwise(); }
search(m_ASEval, null); resetOptions(); m_doneRanking = true; m_calculatedNumToSelect = final_rank.length; } else { determineNumToSelectFromThreshold(final_rank);
/** * Set whether to search backwards instead of forwards * * @param back true to search backwards */ public void setSearchBackwards(boolean back) { m_backward = back; if (m_backward) { setGenerateRanking(false); } }
/** Creates a default BestFirst */ public ASSearch getSearch() { return new GreedyStepwise(); }
/** Creates a default GreedyStepwise */ public ASSearch getSearch() { return new GreedyStepwise(); }
/** Creates a default GreedyStepwise */ public ASSearch getSearch() { return new GreedyStepwise(); }
/** Creates a default GreedyStepwise */ public ASSearch getSearch() { return new GreedyStepwise(); }
/** Creates a default GreedyStepwise */ public ASSearch getSearch() { return new GreedyStepwise(); }
/** * constructor. Sets defaults for each member varaible. Default attribute * evaluator is CfsSubsetEval; default search method is BestFirst. */ public AttributeSelection() { setFolds(10); setRanking(false); setXval(false); setSeed(1); setEvaluator(new CfsSubsetEval()); setSearch(new GreedyStepwise()); m_selectionResults = new StringBuffer(); m_selectedAttributeSet = null; m_attributeRanking = null; }