{"id":"W4232881219","doi":"10.1109/icpr.2004.1334077","title":"A comparison of junction tree and relaxation algorithms for point matching using different distance metrics","year":2004,"lang":"en","type":"article","venue":"Proceedings of the 17th International Conference on Pattern Recognition, 2004. ICPR 2004.","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Probabilistic logic; Algorithm; Computer science; Graph; Matching (statistics); Graphical model; Probabilistic analysis of algorithms; Relaxation (psychology); Tree (set theory); Point (geometry); Mathematics; Theoretical computer science; Artificial intelligence; Combinatorics; Statistics","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.004179054,0.0009064901,0.00180039,0.00222051,0.0008208437,0.001724251,0.003447755,0.002101166,0.003597661],"category_scores_gemma":[0.01380937,0.0008408694,0.001658656,0.003648891,0.001017052,0.006162435,0.001983976,0.002890902,0.001012641],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001624182,"about_ca_system_score_gemma":0.0024072,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004046936,"about_ca_topic_score_gemma":0.005666017,"domain_scores_codex":[0.9952447,0.001646799,0.0002639154,0.0007304632,0.001805268,0.0003089259],"domain_scores_gemma":[0.9927215,0.004051199,0.000491461,0.001481386,0.0009593121,0.0002951167],"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.000730305,0.0005661334,0.0008147634,0.0004197262,0.0002084974,0.00005556513,0.0002945798,0.4101385,0.0128241,0.07057872,0.004235399,0.4991336],"study_design_scores_gemma":[0.00008514687,0.0001908449,0.0002459942,0.00001780527,0.00003554819,0.00008254142,0.00004548431,0.9725842,0.006090639,0.01767159,0.002920149,0.00003001482],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009300636,0.0002912141,0.9882752,0.00008878471,0.00002880238,0.00006107207,0.00003967631,0.0007498382,0.001164745],"genre_scores_gemma":[0.06512206,0.0003915148,0.9326489,0.0000656849,0.00002685429,0.0001081728,0.000251298,0.0003648079,0.00102081],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004179054,"threshold_uncertainty_score":0.02210122,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07420581418126966,"score_gpt":0.3121554837650345,"score_spread":0.2379496695837649,"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."}}