{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003941801,0.000239289,0.0003156071,0.0003303657,0.0001787778,0.0001453018,0.0006811738,0.0000948322,0.00001361946],"category_scores_gemma":[0.0001522341,0.0001921504,0.0001438151,0.0003639906,0.0001170542,0.0006510129,0.0001227585,0.0002032284,0.000002309219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001522623,"about_ca_system_score_gemma":0.00004783901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005166043,"about_ca_topic_score_gemma":0.00001247792,"domain_scores_codex":[0.9981503,0.0000191674,0.000618608,0.0004301824,0.0005605726,0.0002211701],"domain_scores_gemma":[0.9978435,0.0000869333,0.000874559,0.0001457096,0.0009811645,0.00006814715],"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.0005950652,0.002861896,0.04747549,0.0009313549,0.0006454685,0.000002000749,0.009411337,0.001705176,0.04358236,0.3409429,0.0004078491,0.5514392],"study_design_scores_gemma":[0.003249327,0.0006660795,0.01490139,0.00179294,0.000119381,0.00004170218,0.00124229,0.1215189,0.1774174,0.678356,0.00004142546,0.0006531247],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3855207,0.00005827164,0.6120474,0.0007664939,0.0006437261,0.0003823313,0.00006464375,0.00004018513,0.0004762894],"genre_scores_gemma":[0.9852406,0.00002476996,0.01441985,0.0001104204,0.00008518236,0.00003671624,0.00001799684,0.0000162146,0.00004825863],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5997199,"threshold_uncertainty_score":0.7835667,"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."}}