| Class | Description |
|---|---|
| BDS |
Bidirectional Search (BDS) is a greedy method of selecting a subset
of features to use for prediction.
|
| LRS |
plus-L minus-R Selection (LRS) is a greedy method of selecting a subset
of features to use for prediction.
|
| MutualInfoFS |
Performs greedy feature selection based on Mutual Information of the features
with respect to the class values.
|
| ReliefF |
Provides an implementation of the ReliefF algorithm for feature importance computing.
|
| SBS |
Sequential Backward Selection (SBS) is a greedy method of selecting a subset
of features to use for prediction.
|
| SFS |
Sequential Forward Selection (SFS) is a greedy method of selecting a subset
of features to use for prediction.
|
| Enum | Description |
|---|---|
| MutualInfoFS.NumericalHandeling |
The definition for mutual information for continuous attributes requires
an integration of an unknown function, as such requires some form of
approximation.
|
Copyright © 2017. All rights reserved.