Search alternatives:
weight optimization » joint optimization (Expand Search), yet optimization (Expand Search)
design optimization » bayesian optimization (Expand Search)
binary across » binary factors (Expand Search), vary across (Expand Search), bias across (Expand Search)
class weight » class weights (Expand Search)
weight optimization » joint optimization (Expand Search), yet optimization (Expand Search)
design optimization » bayesian optimization (Expand Search)
binary across » binary factors (Expand Search), vary across (Expand Search), bias across (Expand Search)
class weight » class weights (Expand Search)
-
1
-
2
-
3
-
4
Supplementary file 1_Encodings of the weighted MAX k-CUT problem on qubit systems.pdf
Published 2025“…This problem has significant applications across multiple domains. This study explores encoding methods for MAX k-CUT on qubit systems by utilizing quantum approximate optimization algorithms (QAOA) and addressing the challenge of encoding integer values on quantum devices with binary variables. …”
-
5
Synthetic Realness: Authenticity Collapse in the Age of AI
Published 2025“…The concept reframes authenticity not as a binary but as a perception trap shaped by coherence bias and algorithmic polish.…”
-
6
Table 1_Heavy metal biomarkers and their impact on hearing loss risk: a machine learning framework analysis.docx
Published 2025“…Multiple machine learning algorithms, including Random Forest, XGBoost, Gradient Boosting, Logistic Regression, CatBoost, and MLP, were optimized and evaluated. …”
-
7
Machine Learning-Ready Dataset for Cytotoxicity Prediction of Metal Oxide Nanoparticles
Published 2025“…</p><p dir="ltr"><b>Applications and Model Compatibility:</b></p><p dir="ltr">The dataset is optimized for use in supervised learning workflows and has been tested with algorithms such as:</p><p dir="ltr">Gradient Boosting Machines (GBM),</p><p dir="ltr">Support Vector Machines (SVM-RBF),</p><p dir="ltr">Random Forests, and</p><p dir="ltr">Principal Component Analysis (PCA) for feature reduction.…”