CuckooSearchFS<T>
Models & Types · AiDotNet.Preprocessing.FeatureSelection.Wrapper
Cuckoo Search algorithm for feature selection optimization.
Inheritance: TransformerBase<T, Matrix<T>, Matrix<T>> → CuckooSearchFS<T>
Implements: IFixedCountFeatureSelector<T>, ISupervisedFeatureSelector<T>
For Beginners
Like cuckoos laying eggs in other birds’ nests, this algorithm places new solutions and keeps the best ones. Levy flights (long occasional jumps) help escape local optima.
How It Works
Inspired by the brood parasitism of cuckoo birds. Uses Levy flights for exploration and replaces worst nests to evolve better solutions.
Constructors
| Constructor | Summary |
|---|---|
CuckooSearchFS(int nFeaturesToSelect, int populationSize, int nIterations, double discoveryProbability, Func<Matrix<T>, Vector<T>, bool[], T> fitnessFunc, int? randomState, int[] columnIndices) |
Properties
| Property | Summary |
|---|---|
T BestFitness { get; } |
|
Vector<T> FeatureImportances { get; } |
|
bool SupportsInverseTransform { get; } |
|
int NFeaturesToSelect { get; } |
|
int[] SelectedIndices { get; } |
Methods
| Method | Summary |
|---|---|
Matrix<T> FitTransform(Matrix<T> data, Vector<T> target) |
|
bool[] GetSupportMask() |
|
string[] GetFeatureNamesOut(string[] inputFeatureNames) |
|
void Fit(Matrix<T> data, Vector<T> target) |