{"id":"W1508212832","doi":"10.1007/978-3-540-24840-8_12","title":"Towards Efficient Training on Large Datasets for Genetic Programming","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":25,"is_retracted":false,"has_abstract":false,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; Genetic programming; Machine learning; Artificial intelligence; Selection (genetic algorithm); Matching (statistics); Hierarchy; Focus (optics); Overhead (engineering); Set (abstract data type); Process (computing); Training set; Data mining","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006149756,0.0004132403,0.0003530574,0.0004495033,0.0005155695,0.0003947403,0.002518566,0.0002652579,0.000009743839],"category_scores_gemma":[0.00004543444,0.0003834282,0.0001329443,0.0004766406,0.0003047917,0.0001767226,0.000675517,0.0005731179,0.0000229735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000349742,"about_ca_system_score_gemma":0.0008515972,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000007424901,"about_ca_topic_score_gemma":0.00001518895,"domain_scores_codex":[0.9965509,0.00001240193,0.0004134761,0.001503697,0.0007468651,0.0007727217],"domain_scores_gemma":[0.9980801,0.0001991015,0.000198211,0.001197167,0.0001495882,0.0001757832],"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.000002111254,0.00007411382,7.59426e-7,0.00002289584,0.000005741756,0.00001729965,0.0005913337,0.119514,0.00001387255,0.1798567,0.00001984197,0.6998814],"study_design_scores_gemma":[0.0004573411,0.0002498179,0.0001159256,0.000317307,0.000008326517,0.00004437094,4.115514e-7,0.8331727,0.0001480692,0.148809,0.01609716,0.0005795649],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003434052,0.0001878676,0.9959584,0.001489876,0.0007156644,0.000916597,0.0001210556,0.0001536567,0.0004225557],"genre_scores_gemma":[0.03323559,0.00001093832,0.9651578,0.0009052617,0.0004461798,0.00009513536,0.00007074961,0.00002885421,0.00004947],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7136587,"threshold_uncertainty_score":0.9998618,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0262054816399336,"score_gpt":0.276469715053704,"score_spread":0.2502642334137705,"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."}}