{"id":"W2117847370","doi":"10.1109/tsmcb.2007.896406","title":"Scaling Genetic Programming to Large Datasets Using Hierarchical Dynamic Subset Selection","year":2007,"lang":"en","type":"letter","venue":"IEEE Transactions on Systems Man and Cybernetics Part B (Cybernetics)","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":48,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Computer science; RSS; Selection (genetic algorithm); Heuristics; Genetic programming; Block (permutation group theory); Benchmarking; Machine learning; Artificial intelligence; Genetic algorithm; Overhead (engineering); Binary classification; Data mining; Algorithm; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00120327,0.0004232046,0.0006365129,0.0004588304,0.000311055,0.0007077317,0.0009156635,0.0007392023,0.001341014],"category_scores_gemma":[0.006115076,0.0002155878,0.00042383,0.001332794,0.0004667226,0.001001354,0.0008622565,0.00122112,0.0008164949],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005805657,"about_ca_system_score_gemma":0.0003806993,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001393977,"about_ca_topic_score_gemma":0.002106657,"domain_scores_codex":[0.9993773,0.0002572024,0.00002886838,0.00009920217,0.0002063367,0.00003119003],"domain_scores_gemma":[0.9975688,0.001663513,0.00008668481,0.0004183036,0.0002268113,0.00003590493],"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.00009701408,0.00009085694,0.001152213,0.0001036739,0.00006001132,0.0002368273,0.00009472329,0.468823,0.007426899,0.02571248,0.01109419,0.4851082],"study_design_scores_gemma":[0.00001995892,0.00003421495,0.0002194348,0.000006232799,0.000005017584,0.00006822604,0.00001314039,0.978469,0.001024359,0.01735402,0.002781111,0.000005300605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05922706,0.0004712865,0.9282122,0.002798063,0.0002266052,0.0001147325,0.0001007949,0.001484741,0.007364559],"genre_scores_gemma":[0.4507605,0.000752471,0.5427303,0.001387418,0.0002955967,0.0005743079,0.0003359182,0.000209128,0.002954442],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001393977,"threshold_uncertainty_score":0.006363571,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02089396545040684,"score_gpt":0.2715984832799908,"score_spread":0.250704517829584,"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."}}