{"id":"W1965857117","doi":"10.1214/08-aoas199","title":"$\\mathcal{G}$-SELC: Optimization by sequential elimination of level combinations using genetic algorithms and Gaussian processes","year":2009,"lang":"en","type":"article","venue":"The Annals of Applied Statistics","topic":"Computational Drug Discovery Methods","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Georgia Research Foundation; Acadia University; University of Georgia; Pfizer; National Science Foundation","keywords":"Gaussian process; Set (abstract data type); Process (computing); Gaussian; Data set; Genetic algorithm","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002811195,0.0001128737,0.0001733916,0.00007605503,0.0001046297,0.00006089291,0.0003272985,0.00003454248,0.000002409604],"category_scores_gemma":[0.0001176397,0.00009995749,0.00001673602,0.0004124226,0.0001084465,0.0001509727,0.00007366655,0.00006381168,4.643988e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000009400029,"about_ca_system_score_gemma":0.0001312779,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009684961,"about_ca_topic_score_gemma":6.109219e-7,"domain_scores_codex":[0.9989036,0.00006877038,0.0003518756,0.0001946252,0.0003503519,0.0001307985],"domain_scores_gemma":[0.9987714,0.0003112005,0.0003122427,0.000178021,0.0003787607,0.00004833255],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002136303,0.0001659859,0.000002664016,0.00008933841,0.00002510515,8.451385e-7,0.001368742,0.571112,0.002038771,0.3641126,0.0003053923,0.06075718],"study_design_scores_gemma":[0.0002018004,0.00008707136,0.001247774,0.00001404311,0.00001779086,0.000002951851,0.00003799422,0.8584626,0.0082022,0.1316129,0.00001487492,0.00009795339],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004325229,0.00009022461,0.9939224,0.001015906,0.00003080138,0.0002098851,0.0002151689,0.0000193439,0.0001710221],"genre_scores_gemma":[0.4385985,0.00005603028,0.5611499,0.0001462485,0.00001105881,0.000002468824,0.00002774312,0.000004898705,0.000003120722],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4342733,"threshold_uncertainty_score":0.4076148,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.107672180175107,"score_gpt":0.3684116037186514,"score_spread":0.2607394235435444,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}