QuantumAnnealingSelector<T>
Models & Types · AiDotNet.Preprocessing.FeatureSelection.Quantum
Quantum Annealing-Inspired Feature Selection.
Inheritance: TransformerBase<T, Matrix<T>, Matrix<T>> → QuantumAnnealingSelector<T>
Implements: IFixedCountFeatureSelector<T>, ISupervisedFeatureSelector<T>
For Beginners
Quantum annealing is like simulated annealing (slowly cooling a system) but with quantum effects that allow “tunneling” through barriers to find better solutions. This method simulates this process to search for the best feature combination.
How It Works
Simulates quantum annealing for feature selection, using quantum tunneling effects to escape local optima and find globally optimal feature subsets.
Constructors
| Constructor | Summary |
|---|---|
QuantumAnnealingSelector(int nFeaturesToSelect, int nSteps, double initialGamma, double finalGamma, int[] columnIndices) |
Properties
| Property | Summary |
|---|---|
Vector<T> FeatureScores { 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) |