{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002635004,0.000783188,0.002721537,0.002281754,0.001428065,0.001751113,0.00373556,0.001704883,0.003952497],"category_scores_gemma":[0.008306889,0.0009740526,0.001597363,0.00441447,0.0009345969,0.003787242,0.0037929,0.001731744,0.002032942],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007001578,"about_ca_system_score_gemma":0.002890957,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003477616,"about_ca_topic_score_gemma":0.002861821,"domain_scores_codex":[0.9955527,0.001113962,0.0003120678,0.001347925,0.001346534,0.0003266982],"domain_scores_gemma":[0.9968582,0.001100812,0.0002648588,0.000856425,0.0007483718,0.0001712412],"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.0006412083,0.0003534858,0.002378615,0.0003335328,0.0002697836,0.0001554223,0.0001663127,0.1198423,0.01116324,0.03204305,0.008544708,0.8241083],"study_design_scores_gemma":[0.00004278186,0.00008106718,0.0005124116,0.00001689686,0.00005742973,0.0002082046,0.0000499288,0.9673222,0.003729755,0.02506506,0.002885125,0.00002927201],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004478666,0.000147643,0.9942086,0.00008823676,0.00005468947,0.00004046282,0.00006626191,0.0004277179,0.0004877988],"genre_scores_gemma":[0.1630793,0.0003111305,0.8310331,0.0002171642,0.0001459438,0.000225546,0.0008895842,0.0002068692,0.003891206],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003952497,"threshold_uncertainty_score":0.01393539,"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."}}