{"id":"W2069543418","doi":"10.1016/j.dam.2012.01.019","title":"Using local similarity measures to efficiently address approximate graph matching","year":2012,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Mathematics; Heuristics; Tabu search; Local search (optimization); Initialization; Computation; Algorithm; Graph; Similarity (geometry); Matching (statistics); Path (computing); Mathematical optimization; Theoretical computer science; Combinatorics; Computer science; Artificial intelligence","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.001154815,0.0003191654,0.0003658377,0.0001827119,0.0003431069,0.0002113378,0.001019392,0.0001008574,0.000009606716],"category_scores_gemma":[0.00002345316,0.0002743479,0.0001300833,0.0006504058,0.0001051883,0.0003465968,0.0005171307,0.0002307132,0.00006481393],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003993457,"about_ca_system_score_gemma":0.00002234668,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000502322,"about_ca_topic_score_gemma":9.645536e-7,"domain_scores_codex":[0.9978046,0.00004575841,0.000402329,0.0003853431,0.0005789351,0.0007830376],"domain_scores_gemma":[0.9984789,0.0001262117,0.0001511097,0.0008424335,0.00005169375,0.0003496523],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001062041,0.0002331044,0.000009995435,0.0001437567,0.00004002997,0.000003142269,0.009629766,0.005988135,0.006540501,0.9732028,0.00003504422,0.004163166],"study_design_scores_gemma":[0.0007136,0.00006495079,0.00007840712,0.0002035624,0.0001087581,0.00006933996,0.003637379,0.1213373,0.05727708,0.8148285,0.0002509899,0.001430146],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04414989,0.00005834161,0.9506939,0.00004343278,0.0002483964,0.0004476094,0.00001012652,0.0002673104,0.004080972],"genre_scores_gemma":[0.6244075,0.000001129774,0.3752813,0.0001882026,0.00005739636,0.00002911345,0.000002507294,0.00002423189,0.000008614901],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5802576,"threshold_uncertainty_score":0.9999709,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04261303505199202,"score_gpt":0.2821936082436539,"score_spread":0.2395805731916618,"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."}}