RoughSetSelector<T>
Models & Types · AiDotNet.Preprocessing.FeatureSelection.RoughSet
Rough Set Theory-based Feature Selection.
Inheritance: TransformerBase<T, Matrix<T>, Matrix<T>> → RoughSetSelector<T>
Implements: ISupervisedFeatureSelector<T>
For Beginners
Rough set theory handles uncertainty by grouping similar objects together. If removing a feature doesn’t change which groups are distinguishable, that feature is redundant. This method finds the smallest set of features that still tells all objects apart.
How It Works
Uses rough set theory concepts like positive region and dependency degree to find the minimal subset of features (reduct) that preserves the classification ability of the full feature set.
Constructors
| Constructor | Summary |
|---|---|
RoughSetSelector(int maxFeatures, int nBins, int[] columnIndices) |
Properties
| Property | Summary |
|---|---|
Vector<T> DependencyDegrees { get; } |
|
bool SupportsInverseTransform { get; } |
|
int MaxFeatures { 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) |