{"id":"W924202900","doi":"10.1007/s10514-015-9439-y","title":"An optimal data association method based on the minimum weighted bipartite perfect matching","year":2015,"lang":"en","type":"article","venue":"Autonomous Robots","topic":"Face and Expression Recognition","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"Universidad de Zaragoza; Jinan University; Else Kröner-Fresenius-Stiftung; National Natural Science Foundation of China","keywords":"Bipartite graph; Computer science; Matching (statistics); Association (psychology); Integer programming; 3-dimensional matching; Data association; Blossom algorithm; Association scheme; Graph; Algorithm; Hungarian algorithm; Assignment problem; Mathematical optimization; Theoretical computer science; Artificial intelligence; Mathematics; 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.001977152,0.000149187,0.0001520636,0.0000837004,0.0002079748,0.0003522277,0.001312423,0.00009666952,0.00004516001],"category_scores_gemma":[0.0001396479,0.0001056957,0.00004118566,0.0002465334,0.00001070408,0.0009248466,0.0002372449,0.0001981737,0.0003364467],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001244988,"about_ca_system_score_gemma":0.0001789366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00006976334,"about_ca_topic_score_gemma":0.000009777096,"domain_scores_codex":[0.9980597,0.0005266469,0.0002080679,0.0005034233,0.0004051381,0.0002970472],"domain_scores_gemma":[0.9978897,0.0004372083,0.0001654034,0.001269123,0.00009695144,0.0001416214],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002006708,0.00138389,0.00173585,0.00003263538,0.0001688068,0.00007186854,0.008212945,0.5687292,0.01689437,0.005000429,0.1441285,0.2534409],"study_design_scores_gemma":[0.0003146617,0.0001309595,0.0003534908,0.00002290691,0.00001209526,0.000002491402,0.00005909565,0.9905487,0.004257102,0.0006223649,0.003513304,0.000162783],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05693677,0.00002666078,0.9325403,0.00699334,0.0005919816,0.000254261,0.00002092185,0.0003297353,0.002306],"genre_scores_gemma":[0.6495782,0.000002868242,0.3464548,0.003163474,0.0001946643,0.00003963252,0.0001709915,0.00002394408,0.0003713817],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5926415,"threshold_uncertainty_score":0.4324454,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06201085835822923,"score_gpt":0.3178430676416262,"score_spread":0.255832209283397,"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."}}