{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0005555163,0.0008400779,0.0007296214,0.0007549003,0.0008607105,0.000838714,0.001067084,0.0009680639,0.0000231552],"category_scores_gemma":[0.00000775237,0.0009176323,0.0002293048,0.001092743,0.0001703699,0.0002224396,0.00004367137,0.002287511,0.0001579133],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003611903,"about_ca_system_score_gemma":0.0001844746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003335408,"about_ca_topic_score_gemma":0.0001819804,"domain_scores_codex":[0.9943349,0.0003034994,0.001158689,0.001732712,0.001105583,0.001364594],"domain_scores_gemma":[0.9973439,0.0002836934,0.0003524261,0.001307046,0.0002229529,0.0004899729],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"not_applicable","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0001423867,0.003526991,0.0002183414,0.002663662,0.001805981,0.001342934,0.003583486,0.177763,0.00138859,0.004907459,0.6492176,0.1534396],"study_design_scores_gemma":[0.0004959956,0.0002498369,0.0001319526,0.0004134511,0.0001837119,0.0005030201,0.00004101047,0.3378455,0.0001117043,0.0001269989,0.6588098,0.00108703],"study_design_candidate":"not_applicable","study_design_consensus":"not_applicable","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002506446,0.0005026263,0.9820434,0.01042386,0.001618525,0.001647868,0.00079426,0.0003646538,0.00009833039],"genre_scores_gemma":[0.441025,0.001833154,0.3683359,0.1567319,0.0097013,0.002476262,0.002676919,0.001243193,0.01597636],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6137075,"threshold_uncertainty_score":0.9993274,"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."}}