{"id":"W2998450020","doi":"10.1117/12.734360","title":"<title>Computationally efficient assignment-based algorithms for data association for tracking with angle-only sensors</title>","year":2007,"lang":"en","type":"article","venue":"Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE","topic":"Target Tracking and Data Fusion in Sensor Networks","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"McMaster University","funders":"","keywords":"Data association; Association (psychology); Dimension (graph theory); Algorithm; Tracking (education); Assignment problem; Computer science; Tree (set theory); Association scheme; State (computer science); Track (disk drive); Auction algorithm; Association rule learning; Data mining; Mathematics; Mathematical optimization; Artificial intelligence; 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.001040039,0.0001870454,0.0002162124,0.00008165606,0.0001007587,0.0001587214,0.0009742551,0.0001403569,0.00000979276],"category_scores_gemma":[0.0003881799,0.0001562087,0.0002165185,0.0002338919,0.00005455382,0.0002695162,0.0001138386,0.0001444414,0.000003861914],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000156966,"about_ca_system_score_gemma":0.00005865793,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.581814e-7,"about_ca_topic_score_gemma":1.232271e-7,"domain_scores_codex":[0.998228,3.089452e-8,0.0004074837,0.0003918181,0.0006418696,0.0003307784],"domain_scores_gemma":[0.9978364,0.0004446364,0.0003284393,0.00009495992,0.001217605,0.00007800817],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001100903,0.0002479545,0.0001990454,0.0003373474,0.0004142327,2.800215e-7,0.0001329382,0.004877521,0.03449826,0.8845651,0.06306802,0.01154924],"study_design_scores_gemma":[0.001010103,0.0002029538,0.0003194711,0.0001697918,0.00008636976,0.000008069774,0.00006509573,0.9258907,0.007326091,0.0006930124,0.06392775,0.00030057],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"methods","genre_scores_codex":[0.523069,0.0001777044,0.4615336,0.003105608,0.001488462,0.001537435,0.0005128008,0.0003509179,0.008224482],"genre_scores_gemma":[0.08559823,0.0000126208,0.9126852,0.0001511144,0.0007683717,0.00005234425,0.0001255732,0.00005575244,0.0005508632],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9210132,"threshold_uncertainty_score":0.6370004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01852621358619418,"score_gpt":0.2461051248791333,"score_spread":0.2275789112929391,"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."}}