{"id":"W1552475743","doi":"10.1109/acssc.2004.1399544","title":"A recursive filter-based algorithm for maximum likeihood localisation of narrow-band autoregressive sources","year":2005,"lang":"en","type":"article","venue":"","topic":"Direction-of-Arrival Estimation Techniques","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Calgary","funders":"","keywords":"Likelihood function; Algorithm; Autoregressive model; Computer science; Maximum likelihood; Expectation–maximization algorithm; Maximization; Computational complexity theory; Estimation theory; Set (abstract data type); Function (biology); Filter (signal processing); Kalman filter; Matrix (chemical analysis); Data set; Mathematical optimization; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006238644,0.0006926588,0.0007987341,0.0006942936,0.000555651,0.0007883621,0.001448581,0.001319,0.004716484],"category_scores_gemma":[0.001914885,0.000482621,0.0007226887,0.0009508759,0.0005172138,0.001219552,0.001026148,0.001109464,0.002875666],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005735548,"about_ca_system_score_gemma":0.0008904184,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002698846,"about_ca_topic_score_gemma":0.003930608,"domain_scores_codex":[0.9996889,0.00005970575,0.00001706074,0.00009125371,0.0001156222,0.00002753765],"domain_scores_gemma":[0.9996823,0.0001369827,0.00003243849,0.00004501093,0.00008826944,0.00001500469],"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.0001605066,0.00009193642,0.0003254144,0.0001118007,0.00006495449,0.0001367515,0.0001852571,0.2073919,0.02690142,0.03615332,0.007426191,0.7210504],"study_design_scores_gemma":[0.00002852581,0.00005728363,0.0001642452,0.00001285084,0.00001591113,0.0001581073,0.00001295803,0.9770741,0.004823202,0.009742375,0.007878927,0.0000314791],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0006041375,0.00004095205,0.9984683,0.00002498888,0.00001608242,0.00001236558,0.000009954261,0.0004442211,0.0003789444],"genre_scores_gemma":[0.02538791,0.00008856753,0.9715523,0.00007420305,0.00002965503,0.0001146007,0.0001079765,0.0001130697,0.002531753],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004716484,"threshold_uncertainty_score":0.01577824,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01497146176207775,"score_gpt":0.2632171021581201,"score_spread":0.2482456403960424,"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."}}