{"id":"W2070535092","doi":"10.1145/2001858.2001963","title":"Bloat control in genetic programming with a histogram-based accept-reject method","year":2011,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Natural Sciences and Engineering Research Council of Canada; Fonds Québécois de la Recherche sur la Nature et les Technologies; Compute Canada","keywords":"Genetic programming; Histogram; Tree (set theory); Computer science; Population; Mathematical optimization; Genetic algorithm; Histogram equalization; Control (management); Dynamic programming; Artificial intelligence; Machine learning; Algorithm; Mathematics; Image (mathematics)","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001851346,0.0001121329,0.0001292682,0.0001065706,0.00007840849,0.00004235773,0.0004968902,0.00003603341,0.0000586814],"category_scores_gemma":[0.000005025897,0.00008620963,0.00003998181,0.0005484489,0.00003489597,0.0001579802,0.00003885212,0.0000909454,0.00003020013],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004212877,"about_ca_system_score_gemma":0.0001006783,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0005204788,"about_ca_topic_score_gemma":0.0001689236,"domain_scores_codex":[0.9990216,0.00006009527,0.0001692533,0.0003442204,0.0001478431,0.0002569106],"domain_scores_gemma":[0.9993356,0.00006192373,0.00005437266,0.0004150211,0.00005599175,0.0000770901],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00006256336,0.002003828,0.03815665,0.0000321976,0.00006114477,0.00009378479,0.001759915,0.002382678,0.000946538,0.1411375,0.0006647354,0.8126985],"study_design_scores_gemma":[0.002813954,0.0004519092,0.06373738,0.00002512782,0.00002651972,0.0000552776,0.00007696274,0.912517,0.001421078,0.00398203,0.01432667,0.0005661601],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001673295,0.00006515469,0.995029,0.0003686308,0.00002384147,0.0003958189,6.761809e-7,0.0001751472,0.002268414],"genre_scores_gemma":[0.3407445,5.622961e-7,0.6586964,0.0002457914,0.00001084875,0.0002090483,6.586745e-7,0.000005131162,0.00008707735],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9101343,"threshold_uncertainty_score":0.3515527,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02019268704997868,"score_gpt":0.2502141393508719,"score_spread":0.2300214523008933,"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."}}