{"id":"W4378419870","doi":"10.1007/978-3-031-34020-8_20","title":"Binary Black Widow with Hill Climbing Algorithm for Feature Selection","year":2023,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Hill climbing; Computer science; Algorithm; Feature selection; Metaheuristic; Binary number; Convergence (economics); Set (abstract data type); Ideal (ethics); Extension (predicate logic); Domain (mathematical analysis); Artificial intelligence; Mathematics","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.0003872435,0.000741707,0.001143086,0.000848396,0.0006446492,0.0007781998,0.001831142,0.000867802,0.007891682],"category_scores_gemma":[0.0007737251,0.0003383086,0.0007609222,0.00194611,0.000205551,0.0006787598,0.0007639436,0.0008334697,0.001700758],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002567588,"about_ca_system_score_gemma":0.0005823714,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003969243,"about_ca_topic_score_gemma":0.00334376,"domain_scores_codex":[0.9996676,0.00006312609,0.0000173994,0.00006418466,0.0001484563,0.00003913828],"domain_scores_gemma":[0.9998643,0.00004311141,0.000009043807,0.00002001594,0.00005503762,0.000008394184],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0002664556,0.0001713657,0.0004523024,0.0002900625,0.0001323383,0.000139691,0.00006562182,0.126758,0.01379435,0.009119354,0.02140671,0.8274037],"study_design_scores_gemma":[0.00005944371,0.0001289669,0.0005710064,0.00002569426,0.00004488095,0.0001734651,0.00002242448,0.9758373,0.005995987,0.005049673,0.01206506,0.00002611903],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.009236432,0.001479609,0.9807684,0.0001211419,0.0001853901,0.0001068421,0.0001688051,0.001444421,0.00648902],"genre_scores_gemma":[0.1375323,0.0008787948,0.8402572,0.0001816029,0.00009985828,0.000346085,0.0007488672,0.0002943309,0.01966097],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007891682,"threshold_uncertainty_score":0.02640033,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04667246751670973,"score_gpt":0.3125757170518372,"score_spread":0.2659032495351275,"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."}}