2019
DOI: 10.1038/s41598-019-49539-6
|View full text |Cite
|
Sign up to set email alerts
|

Efficient partition of integer optimization problems with one-hot encoding

Abstract: Quantum annealing is a heuristic algorithm for solving combinatorial optimization problems, and hardware for implementing this algorithm has been developed by D-Wave Systems Inc. The current version of the D-Wave quantum annealer can solve unconstrained binary optimization problems with a limited number of binary variables. However, the cost functions of several practical problems are defined by a large number of integer variables. To solve these problems using the quantum annealer, integer variables are gener… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
49
0
1

Year Published

2020
2020
2024
2024

Publication Types

Select...
10

Relationship

0
10

Authors

Journals

citations
Cited by 124 publications
(58 citation statements)
references
References 43 publications
0
49
0
1
Order By: Relevance
“…The absence of clinical features cannot exceed 8%, and patients with more than one missing value would be excluded. The continuous data were normalized by z-score normalization (25), and the categorical data were transformed via one-hot encoding (26). To address the serious imbalance in the number of patients with delayed and non-delayed remission, we intend to synthesize new patient samples of delayed remission using three commonly used resampling techniques in the training dataset: the synthetic minority oversampling technique (SMOTE), SMOTETomek, and SMOTEENN (27,28).…”
Section: Study Design and ML Algorithmsmentioning
confidence: 99%
“…The absence of clinical features cannot exceed 8%, and patients with more than one missing value would be excluded. The continuous data were normalized by z-score normalization (25), and the categorical data were transformed via one-hot encoding (26). To address the serious imbalance in the number of patients with delayed and non-delayed remission, we intend to synthesize new patient samples of delayed remission using three commonly used resampling techniques in the training dataset: the synthetic minority oversampling technique (SMOTE), SMOTETomek, and SMOTEENN (27,28).…”
Section: Study Design and ML Algorithmsmentioning
confidence: 99%
“…15,16 The quantitative data were normalized, and the multicategorical variables were processed by One-Hot. 17 After initial screening by single-factor method, recursive feature elimination (RFE) based on random forest (RF) with fivefold cross-validation (CV) was used to screen the overall features. The main idea of RFE is to repeatedly build the model and then select the best feature, pick out the selected feature, and then repeat this process on the remaining features until all features have been traversed.…”
Section: Data Preprocessing and Feature Selectionmentioning
confidence: 99%
“…Multi-class variables were converted into binary ones by using one-hot encoding [15,16] . XGBoost, a machine learning prediction model, was used to compute the significance of the variable [13] .…”
Section: Data Preprocessing and Assessmentmentioning
confidence: 99%