{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001038662,0.0007202431,0.001928878,0.002966573,0.000860605,0.001842461,0.002410706,0.001968662,0.003635161],"category_scores_gemma":[0.01062782,0.0005541772,0.0007799779,0.004474202,0.0007587948,0.00629489,0.003355295,0.001268405,0.001059995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009323521,"about_ca_system_score_gemma":0.0009610916,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001512508,"about_ca_topic_score_gemma":0.003060679,"domain_scores_codex":[0.9980139,0.0004178605,0.0001230475,0.0003963928,0.0008923662,0.0001564705],"domain_scores_gemma":[0.9960197,0.001690136,0.0003431916,0.001238288,0.0005494258,0.0001594096],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0007097515,0.0006248431,0.00487316,0.0006359709,0.0002588441,0.0004200942,0.0004237657,0.2631161,0.0367494,0.1021807,0.01218396,0.5778233],"study_design_scores_gemma":[0.00003039243,0.00008229687,0.0002991825,0.00000925657,0.00003317922,0.0001503422,0.00008687127,0.9307387,0.007295175,0.05932024,0.001941138,0.00001314355],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07740386,0.0004320322,0.9169945,0.0002317094,0.00009108184,0.000131748,0.0002048751,0.001550367,0.002959759],"genre_scores_gemma":[0.5634577,0.0002939453,0.4310908,0.0001471208,0.0001390027,0.0001833339,0.0009125915,0.0003495431,0.003426073],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003635161,"threshold_uncertainty_score":0.01216084,"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."}}