{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.003295884,0.001780461,0.001953564,0.001521514,0.0009331937,0.002003588,0.004022696,0.003428514,0.005338129],"category_scores_gemma":[0.0174292,0.001621263,0.001812576,0.002495224,0.001176123,0.00326022,0.003184209,0.005764606,0.002216213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001325476,"about_ca_system_score_gemma":0.001688788,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006073528,"about_ca_topic_score_gemma":0.01079994,"domain_scores_codex":[0.998419,0.0007113846,0.00009803241,0.0003034525,0.0003426353,0.0001253943],"domain_scores_gemma":[0.9911886,0.006197637,0.0002416937,0.001405866,0.0007760701,0.0001900801],"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.0002736252,0.0002830581,0.001994651,0.0002275668,0.0001702325,0.0001311633,0.0001711869,0.6465417,0.003437008,0.01002915,0.01691237,0.3198283],"study_design_scores_gemma":[0.00003435796,0.00001833732,0.000138228,0.0000130754,0.000009477587,0.00001256695,0.00002160124,0.9880341,0.0005455396,0.01038946,0.0007798494,0.000003460433],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03457117,0.0005952115,0.9541048,0.0008296273,0.0001349193,0.0002343175,0.0005772939,0.005752465,0.003200129],"genre_scores_gemma":[0.0984716,0.0002305156,0.8955472,0.0004512665,0.00009267704,0.000451237,0.00191763,0.0006363871,0.002201639],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006073528,"threshold_uncertainty_score":0.01785785,"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."}}