{"id":"W1561697759","doi":"10.1007/978-3-642-12139-5_11","title":"Enhancing a Tabu Algorithm for Approximate Graph Matching by Using Similarity Measures","year":2010,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tabu search; Heuristics; Greedy algorithm; Computer science; Vertex (graph theory); Matching (statistics); Algorithm; Similarity (geometry); Similarity measure; Exploit; Combinatorics; Graph; Mathematics; Mathematical optimization; Theoretical 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.001540625,0.0009533701,0.001994049,0.00341832,0.001292449,0.002065012,0.003182798,0.002229417,0.01157198],"category_scores_gemma":[0.009677489,0.0006551972,0.001164669,0.006161982,0.0008181152,0.004269809,0.002102247,0.001333648,0.004147727],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001163557,"about_ca_system_score_gemma":0.001561167,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003538402,"about_ca_topic_score_gemma":0.004446285,"domain_scores_codex":[0.9977204,0.0006299787,0.0001380066,0.0003715223,0.0009672759,0.000172781],"domain_scores_gemma":[0.9962031,0.001457967,0.0001735807,0.001154768,0.0009206832,0.00008977715],"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.0005349739,0.0003279545,0.0008174171,0.0002302589,0.0001101008,0.00006990525,0.0001129807,0.09734602,0.01070694,0.03142118,0.01166385,0.8466585],"study_design_scores_gemma":[0.00006366755,0.0001308539,0.0002304168,0.00001903665,0.00003900149,0.0001671939,0.00005643258,0.955079,0.008488601,0.03003213,0.005670391,0.00002315458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0133579,0.0004146497,0.9802057,0.0001162246,0.0001453582,0.0001191302,0.0001405499,0.002563594,0.002936851],"genre_scores_gemma":[0.08563712,0.0002031544,0.9084787,0.0001339152,0.00008675163,0.0001823958,0.0005776858,0.000556189,0.004144138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01157198,"threshold_uncertainty_score":0.03871208,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01738124632312027,"score_gpt":0.2469909259690952,"score_spread":0.2296096796459749,"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."}}