.png){kind=icon}
Return
Quantum annealing-based feature selection
.png){kind=icon}
OA
AI
DOI：10.1016/j.neucom.2025.131673.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
• Problem Addressed: We tackle the computationally difficult problem of feature selection for machine learning models, specifically by maximizing mutual information (MI) and conditional mutual information (CMI) between features and the target variable. • Proposed Solution: We employ the adiabatic quantum computation paradigm to tackle this problem. The study utilizes a hybrid annealing approach, specifically the D-Wave Kerberos framework, which combines classical and quantum algorithms to solve the complex optimization problem. The feature selection task is reformulated as a Mutual Information Quadratic Unconstrained Binary Optimization (MIQUBO) problem, which can be solved on a quantum annealer. • Real-World Application: The MIQUBO method is applied to a practical, real-world scenario: forecasting the prices of used excavators. • Key Findings: The research demonstrates that using the MIQUBO approach leads to an improvement in the prediction performance of machine learning models. This is particularly true for datasets where the mutual information is less concentrated on a small subset of features.
Keywords:
Quantum annealing
Mutual information
Feature selection
Quadratic unconstrained binary optimization
Journal
IF:
6.5
Papers:
2.5W
Citations:
6.5W
Organization
No organization information available
Cited Papers
ShareSaveEffective global approaches for mutual information based feature selection.png)
Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data miningOAAI
Proceedings of the 20th ACM SIGKDD international conference on Knowledge discovery and data miningIF0
OAAIShareSaveDeploying a quantum annealing processor to detect tree cover in aerial imagery of CaliforniaPLOS ONE
OAAI
PLOS ONEIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more