{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.002653018,0.0008009283,0.0007863881,0.0008928267,0.0009602386,0.00102801,0.003841833,0.0005976062,0.000007614086],"category_scores_gemma":[0.00008369388,0.000754584,0.0003247241,0.0006935128,0.0008487841,0.0009900986,0.001113947,0.001539491,0.000004208995],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001532037,"about_ca_system_score_gemma":0.0004111236,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003538017,"about_ca_topic_score_gemma":0.0000560316,"domain_scores_codex":[0.9949478,0.00006144735,0.0007016977,0.002064684,0.001093588,0.001130808],"domain_scores_gemma":[0.9968438,0.0006390907,0.000454101,0.001424517,0.0003652433,0.0002732463],"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.00000581039,0.00005575496,0.000002834795,0.00008198664,0.00003106982,0.00003547351,0.001212146,0.004472139,0.0165799,0.01301113,0.000004978538,0.9645067],"study_design_scores_gemma":[0.0002385562,0.00007194505,9.849905e-7,0.0002424385,0.00001420401,0.0000674639,3.784121e-7,0.4171478,0.02673991,0.5544878,0.0002903638,0.0006981956],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001458435,0.0004904451,0.9951749,0.0001520931,0.002847237,0.0007407743,0.00004828506,0.0002544833,0.0001459216],"genre_scores_gemma":[0.007390775,0.00002021657,0.9910739,0.0008715534,0.0004832144,0.00002179031,0.00001067436,0.00006202338,0.00006582752],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9638086,"threshold_uncertainty_score":0.9994905,"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."}}