返回
Feature selection on quantum computers
DOI:10.1007/s42484-023-00099-z.png)
摘要
En 中文
In machine learning, fewer features reduce model complexity. Carefully assessing the influence of each input feature on the model quality is therefore a crucial preprocessing step. We propose a novel feature selection algorithm based on a quadratic unconstrained binary optimization (QUBO) problem, which allows to select a specified number of features based on their importance and redundancy. In contrast to iterative or greedy methods, our direct approach yields higher-quality solutions. QUBO problems are particularly interesting because they can be solved on quantum hardware. To evaluate our proposed algorithm, we conduct a series of numerical experiments using a classical computer, a quantum gate computer, and a quantum annealer. Our evaluation compares our method to a range of standard methods on various benchmark data sets. We observe competitive performance.
Keyword:
Feature selection
VQE
Quantum annealer
QUBO
期刊
Q
IF:
4.4
论文数:
453
被引数:
796
机构
引用论文
A variational eigenvalue solver on a photonic quantum processor光子量子处理器上的变分特征值求解器
NATURE COMMUNICATIONS
IF15.7
Bortezomib, Lenalidomide and Dexamethasone Vs. Lenalidomide and Dexamethasone in Patients (Pts) with Previously Untreated Multiple Myeloma without an Intent for Immediate Autologous Stem Cell Transplant (ASCT): Results of the Randomized Phase III Trial SWOG S0777
Blood
IF0
Purification of the mRNAs for Ewe αs‐Casein and β‐Casein by Immunoprecipitation of Polysomes通过多聚核糖体免疫沉淀纯化Ewe αs‐Casein和β‐Casein的mRNAs
A Pilot Quantitative Study of Topographic Correlation between Reticular Pseudodrusen and the Choroidal Vasculature Using En Face Optical Coherence Tomography
PLoS ONE
IF0

