{"id":"W4402543084","doi":"10.1007/978-3-031-69257-4_16","title":"Machine Learning-Based Per-Instance Algorithm Selection for High-Performance Subgraph Isomorphism Enumeration","year":2024,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"","funders":"Engineering and Physical Sciences Research Council; Tezpur University; Queen's University; Queen's University Belfast","keywords":"Enumeration; Isomorphism (crystallography); Selection (genetic algorithm); Computer science; Subgraph isomorphism problem; Induced subgraph isomorphism problem; Algorithm; Combinatorics; Artificial intelligence; Mathematics; Theoretical computer science; Chemistry; Crystallography; Graph","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001667097,0.001512257,0.002340012,0.001808821,0.0009761926,0.002190122,0.00406428,0.001894772,0.01468722],"category_scores_gemma":[0.008839468,0.0006462338,0.001439956,0.00301677,0.0006211092,0.003849087,0.002076069,0.003123488,0.003955232],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00140314,"about_ca_system_score_gemma":0.002616041,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002296498,"about_ca_topic_score_gemma":0.006058125,"domain_scores_codex":[0.9978175,0.00078245,0.000132809,0.0005110274,0.0004684043,0.0002877297],"domain_scores_gemma":[0.9958043,0.002401338,0.0001379506,0.0009728398,0.0005093479,0.0001742222],"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.0005796272,0.0005714322,0.00123891,0.0003486614,0.0001631563,0.0001353488,0.00007482312,0.1950304,0.006165509,0.02620769,0.03492502,0.7345595],"study_design_scores_gemma":[0.00003999891,0.00005600533,0.0001732771,0.00001060974,0.00002026996,0.0000561266,0.00002063146,0.976894,0.001972798,0.01894895,0.001797878,0.0000095735],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03187538,0.001068662,0.9473914,0.0006023975,0.0003369175,0.0002514589,0.000575256,0.006956108,0.01094242],"genre_scores_gemma":[0.2553838,0.000439356,0.7279085,0.000367632,0.0002392626,0.0004060487,0.003271994,0.001593555,0.01038996],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01468722,"threshold_uncertainty_score":0.0491336,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01597903330997189,"score_gpt":0.244677277797499,"score_spread":0.2286982444875271,"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."}}