{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.00136345,0.0003116453,0.0002792155,0.001399339,0.0009989133,0.0008482334,0.002066696,0.000162704,0.000007357649],"category_scores_gemma":[0.00002148275,0.0003144223,0.00007276443,0.0007472148,0.0006107743,0.005564493,0.00061684,0.0006625013,0.00005577063],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001515305,"about_ca_system_score_gemma":0.0002692006,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001153282,"about_ca_topic_score_gemma":0.000007968189,"domain_scores_codex":[0.9981085,0.00003737495,0.0006795943,0.000437922,0.0004345658,0.0003020203],"domain_scores_gemma":[0.9977632,0.0002216347,0.0003288178,0.001079412,0.0005129672,0.00009394323],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000003751465,0.0000155304,0.00001917952,0.00005711229,0.000007701927,1.395094e-7,0.0005971307,0.003423789,0.000006310704,0.6867945,0.00003541579,0.3090395],"study_design_scores_gemma":[0.0003214041,0.0001709994,0.0001153176,0.0001826263,0.000009694773,0.00001455793,0.000004264249,0.9098054,0.00009055292,0.03033822,0.05861632,0.0003307101],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00006918609,0.0006934289,0.9879916,0.0007816263,0.0006308887,0.0005842278,0.00004076591,0.0002533025,0.008954979],"genre_scores_gemma":[0.2249709,0.003978928,0.7637513,0.001365022,0.0001578128,0.0002730764,0.0005296394,0.00004351603,0.004929762],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9063815,"threshold_uncertainty_score":0.9999308,"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."}}