MétaCan
Menu
Back to cohort
Record W2047880019 · doi:10.1109/ccece.2006.277797

Noisy Autoregressive System Identification Based on Repeated Autocorrelation Function

2006· article· en· W2047880019 on OpenAlexaff
Shaikh Anowarul Fattah, Wei‐Ping Zhu, Muneeb Ahmad

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicBlind Source Separation Techniques
Canadian institutionsConcordia University
Fundersnot available
KeywordsAutocorrelationAutoregressive modelDecorrelationNoise (video)Identification (biology)Function (biology)Partial autocorrelation functionAlgorithmStatisticsSystem identificationMathematicsComputer scienceLeast-squares function approximationSpeech recognitionData modelingArtificial intelligenceAutoregressive integrated moving averageTime series

Abstract

fetched live from OpenAlex

This paper presents an identification approach for the minimum-phase autoregressive (AR) systems in the presence of heavy noise based on a repeated autocorrelation function (RACF) of observed data. It is shown that RACF retains poles of the original system and in noisy environment if it is used instead of single ACF in the modified least-squares Yule-Walker equations the effect of additive noise can be reduced. A termination criterion for the repeated operations is proposed based on the decaying nature of correlation values. The length of ACF, which is kept fixed in all RACFs, is determined from the decorrelation time of the single ACF. Simulation results show the superiority of performance by the proposed method in comparison to some of the existing methods in estimating the AR parameters even at a very low SNR of -5 dB

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.980
Threshold uncertainty score0.437

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.001
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.006
GPT teacher head0.214
Teacher spread0.208 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicBlind Source Separation TechniquesFrench-language works237,207