{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002942578,0.0001301767,0.0002080484,0.000209523,0.00006032922,0.00004259291,0.0004350162,0.00008078502,0.0000373977],"category_scores_gemma":[0.0001108442,0.0001175288,0.0001056316,0.0002444379,0.00008639305,0.0004739081,0.00003399474,0.00005142247,0.000004147659],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005487901,"about_ca_system_score_gemma":0.0001140649,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005068316,"about_ca_topic_score_gemma":0.000009319622,"domain_scores_codex":[0.9988708,0.00005714425,0.000372222,0.0002691555,0.0002726316,0.0001580684],"domain_scores_gemma":[0.9985759,0.0002430324,0.0003583434,0.0003412646,0.0004258021,0.00005569003],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.00001634653,0.0002111912,0.00005212981,0.00005941843,0.00002497445,6.118148e-7,0.001213638,0.001396779,0.001601878,0.008778469,0.004367332,0.9822772],"study_design_scores_gemma":[0.0002927645,0.0002051427,0.00005428493,0.00004873163,0.000007348711,0.000001775585,0.00002399786,0.439575,0.5504479,0.008135662,0.001107744,0.00009960963],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00114832,0.00007508176,0.996053,0.0008485744,0.000124174,0.0003996059,0.00001407872,0.0002786463,0.001058561],"genre_scores_gemma":[0.194315,0.000001655567,0.8052526,0.0001441648,0.00004503818,0.00007375169,0.000009289722,0.000009546763,0.0001489193],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9821776,"threshold_uncertainty_score":0.4792687,"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."}}