public class LFSMethods extends Object implements RevisionHandler
Modifier and Type | Class and Description |
---|---|
class |
LFSMethods.Link2
Class for a node in a linked list.
|
class |
LFSMethods.LinkedList2
Class for handling a linked list.
|
Constructor and Description |
---|
LFSMethods()
empty constructor
methods are not static because of access to inner class Link2 and
LinkedList2
|
Modifier and Type | Method and Description |
---|---|
BitSet |
floatingForwardSearch(int cacheSize,
BitSet startGroup,
int[] ranking,
int k,
boolean incrementK,
int maxStale,
Instances data,
SubsetEvaluator evaluator,
boolean verbose)
Performs linear floating forward selection
( the stopping criteria cannot be changed to a specific size value )
|
BitSet |
forwardSearch(int cacheSize,
BitSet startGroup,
int[] ranking,
int k,
boolean incrementK,
int maxStale,
int forceResultSize,
Instances data,
SubsetEvaluator evaluator,
boolean verbose)
Performs linear forward selection
|
BitSet |
getBestGroup() |
BitSet |
getBestGroupOfSize(int size) |
double |
getBestMerit() |
int |
getNumEvalsCached() |
int |
getNumEvalsTotal() |
String |
getRevision()
Returns the revision string.
|
int[] |
rankAttributes(Instances data,
SubsetEvaluator evaluator,
boolean verbose) |
public LFSMethods()
public BitSet getBestGroup()
public double getBestMerit()
public BitSet getBestGroupOfSize(int size)
public int getNumEvalsCached()
public int getNumEvalsTotal()
public int[] rankAttributes(Instances data, SubsetEvaluator evaluator, boolean verbose) throws Exception
Exception
public BitSet forwardSearch(int cacheSize, BitSet startGroup, int[] ranking, int k, boolean incrementK, int maxStale, int forceResultSize, Instances data, SubsetEvaluator evaluator, boolean verbose) throws Exception
cacheSize
- chacheSize (times number of instances) to store already evaluated setsstartGroup
- start group for search (can be null)ranking
- ranking of attributes (as produced by rankAttributes), no ranking would be [0,1,2,3,4..]k
- number of top k attributes that are taken into accountincrementK
- true -> fixed-set, false -> fixed-widthmaxStale
- number of times the search proceeds even though no improvement was found (1 = hill-climbing)forceResultSize
- stopping criteria changed from no-improvement (forceResultSize=-1) to subset-sizedata
- evaluator
- verbose
- Exception
public BitSet floatingForwardSearch(int cacheSize, BitSet startGroup, int[] ranking, int k, boolean incrementK, int maxStale, Instances data, SubsetEvaluator evaluator, boolean verbose) throws Exception
cacheSize
- chacheSize (times number of instances) to store already evaluated setsstartGroup
- start group for search (can be null)ranking
- ranking of attributes (as produced by rankAttributes), no ranking would be [0,1,2,3,4..]k
- number of top k attributes that are taken into accountincrementK
- true -> fixed-set, false -> fixed-widthmaxStale
- number of times the search proceeds even though no improvement was found (1 = hill-climbing)data
- evaluator
- verbose
- Exception
public String getRevision()
getRevision
in interface RevisionHandler
Copyright © 2019 University of Waikato, Hamilton, NZ. All rights reserved.