{"id":"W1998452541","doi":"10.1007/s10710-008-9067-9","title":"Coevolutionary bid-based genetic programming for problem decomposition in classification","year":2008,"lang":"en","type":"article","venue":"Genetic Programming and Evolvable Machines","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":22,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Artificial intelligence; Machine learning; Bidding; Classifier (UML); Genetic programming; Support vector machine","routes":{"ca_aff":true,"ca_fund":false,"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.000228732,0.0002253555,0.0002040447,0.0002234116,0.0006241216,0.0001127796,0.0003676496,0.0001017766,0.000002251569],"category_scores_gemma":[0.00001773158,0.0002248605,0.00007370311,0.0006308834,0.0001359454,0.000209018,0.0000836546,0.0001214025,0.00000667019],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007718828,"about_ca_system_score_gemma":0.0001510429,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001714476,"about_ca_topic_score_gemma":0.00003709311,"domain_scores_codex":[0.9981706,0.00005982665,0.0004292823,0.0006388526,0.0002232358,0.0004782598],"domain_scores_gemma":[0.999104,0.0001040778,0.0001381874,0.0003790285,0.0001457598,0.000128949],"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.00003549159,0.000924887,0.0966135,0.0002397288,0.00002738304,0.00001534841,0.0005226342,0.009602569,0.001413316,0.005008331,0.0006776244,0.8849192],"study_design_scores_gemma":[0.0008280945,0.0002349257,0.1959968,0.0000494299,0.00001421925,0.0001148978,0.00002674105,0.7882788,0.0000481247,0.005411346,0.008669637,0.0003269904],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.1208374,0.002323573,0.8738951,0.001148143,0.00009211499,0.001357164,0.000007393906,0.0002723397,0.00006676851],"genre_scores_gemma":[0.4134088,0.00005939946,0.5852459,0.00004430456,0.00006381935,0.001065462,0.00004450113,0.00001374853,0.00005409262],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8845922,"threshold_uncertainty_score":0.9169544,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01982953284110033,"score_gpt":0.2670076920093719,"score_spread":0.2471781591682716,"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."}}