{'fraction_non_alphanumeric': 0.02209051724137931, 'fraction_numerical': 0.0021551724137931034, 'mean_word_length': 5.608540925266904, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
A novel variable‐length sliding window blockwise least‐squares algorithm for on‐line estimation of time‐varying parameters

Motivated by the advances in computer technology and the fact that the batch/block least‐squares (LS) produces more accurate parameter estimates than its recursive counterparts, several important issues associated with the block LS have been re‐examined in the framework of on‐line identification of systems with abrupt/gradual change parameters in this paper. It is no surprise that the standard block LS performs unsatisfactorily in such a situation. To overcome this deficiency, a novel variable‐length sliding window‐based LS algorithm, known as variable‐length sliding window blockwise least squares, is developed. The algorithm consists of a change detection scheme and a data window with adjustable length. The window length adjustment is triggered by the change detection scheme. Whenever a change in system parameters is detected, the window is shortened to discount ‘old’ data and place more weight on the latest measurements. Several strategies for window length adjustment have been considered. The performance of the proposed algorithm has been evaluated through numerical studies. In comparison with the recursive least squares (RLS) with forgetting factors, superior results have been obtained consistently for the proposed algorithm. Robustness analysis of the algorithm to measurement noise have also been carried out. The significance of the work reported herein is that this algorithm offers a viable alternative to traditional RLS for on‐line parameter estimation by trading off the computational complexity of block LS for improved performance over RLS, because the computational complexity becomes less and less an issue with the rapid advance in computer technologies. Copyright © 2004 John Wiley & Sons, Ltd.