LempelZivSelector<T>
Models & Types · AiDotNet.Preprocessing.FeatureSelection.Complexity
Lempel-Ziv Complexity based Feature Selection.
Inheritance: TransformerBase<T, Matrix<T>, Matrix<T>> → LempelZivSelector<T>
Implements: IFixedCountFeatureSelector<T>
For Beginners
Lempel-Ziv complexity counts how many unique patterns appear when reading a sequence. It’s related to compression - sequences that compress well have low complexity (predictable patterns), while complex sequences have many unique patterns and don’t compress well.
How It Works
Selects features based on their Lempel-Ziv complexity, which measures the number of distinct patterns in a discretized sequence.
Constructors
| Constructor | Summary |
|---|---|
LempelZivSelector(int nFeaturesToSelect, int nBins, int[] columnIndices) |
Properties
| Property | Summary |
|---|---|
Vector<T> ComplexityValues { get; } |
|
bool SupportsInverseTransform { get; } |
|
int NBins { get; } |
|
int NFeaturesToSelect { get; } |
|
int[] SelectedIndices { get; } |
Methods
| Method | Summary |
|---|---|
Matrix<T> FitTransform(Matrix<T> data) |
|
bool[] GetSupportMask() |
|
string[] GetFeatureNamesOut(string[] inputFeatureNames) |