PermutationEntropySelector<T>
Models & Types ยท AiDotNet.Preprocessing.FeatureSelection.Entropy
Permutation Entropy based Feature Selection.
Inheritance: TransformerBase<T, Matrix<T>, Matrix<T>> โ PermutationEntropySelector<T>
Implements: IFixedCountFeatureSelector<T>
For Beginners
Permutation entropy looks at the order of values in small windows. It counts how many different orderings appear and how often. High permutation entropy means complex, unpredictable sequences; low entropy means regular, predictable patterns like trends.
How It Works
Selects features based on permutation entropy, which measures the complexity of time series or sequential data based on ordinal patterns.
Constructors
| Constructor | Summary |
|---|---|
PermutationEntropySelector(int nFeaturesToSelect, int embeddingDimension, int delay, int[] columnIndices) |
Properties
| Property | Summary |
|---|---|
Vector<T> EntropyValues { get; } |
|
bool SupportsInverseTransform { get; } |
|
int Delay { get; } |
|
int EmbeddingDimension { get; } |
|
int NFeaturesToSelect { get; } |
|
int[] SelectedIndices { get; } |
Methods
| Method | Summary |
|---|---|
Matrix<T> FitTransform(Matrix<T> data) |
|
bool[] GetSupportMask() |
|
string[] GetFeatureNamesOut(string[] inputFeatureNames) |