journal article·2025-08-26Open access

Dictionary Learning-Based Data Pruning for System Identification

Tingna Wang, Sikai Zhang, Mingming Song, Limin Sun

Applied Sciences· Volume 15· Issue 17

Abstract

In system identification, augmenting time series data via time shifting and nonlinearisation can lead to both feature and sample redundancy. However, research has mainly focused on feature redundancy while largely ignoring the issue of sample redundancy. This paper proposes a novel data pruning method, called mini-batch FastCan, to reduce sample-wise redundancy based on dictionary learning. Time series data is represented by some representative samples via dictionary learning. The useful samples are selected based on their correlation with the representative samples. The method is tested on two simulated datasets and two benchmark datasets. The R-squared value between the coefficients of models trained on the full datasets and the coefficients of models trained on pruned datasets is adopted to evaluate the performance of data pruning methods. It is found that the proposed method significantly outperforms the random pruning method, with a higher median or mean and a lower variance of R-squared values.
Source: crossref · Quality: baseline

Research context

OpenAlex topics: Advanced Computational Techniques and Applications · Time Series Analysis and Forecasting · Anomaly Detection Techniques and Applications

SciVX discovery tags are terminology-based. OpenAlex topics are source-provided classifications.

Affiliations

College of Civil Engineering, Tongji University, Shanghai 200092, China

Shanghai Qi Zhi Institute, Shanghai 200232, China

Baosight Software, Shanghai 201900, China

State Key Laboratory of Disaster Reduction in Civil Engineering, Tongji University, Shanghai 200092, China

Funding

Shanghai Qi Zhi Institute Innovation Program · National Natural Science Foundation of China

References (29)

Show source-provided references
1. Box, G.E., Jenkins, G.M., Reinsel, G.C., and Ljung, G.M. (2015). Time Series Analysis: Forecasting and Control, John Wiley & Sons, Inc.. [5th ed.]. Chapter 1.
2. Billings, S.A. (2013). Nonlinear System Identification: NARMAX Methods in the Time, Frequency, and Spatio-Temporal Domains, John Wiley & Sons, Ltd.. Chapter 1.10.1002/9781118535561 ↗
3. Nelles, O. (2001). Nonlinear System Identification: From Classical Approaches to Neural Networks and Fuzzy Models, SpringerLink.
4. Miller, W.T., Sutton, R.S., and Werbos, P.J. (1990). Neural Networks for Control, The MIT Press.10.7551/mitpress/4939.001.0001 ↗
5. Jenkins, G.M., and Watts, D.G. (1968). Spectral Analysis and Its Applications, Holden-Day, Inc.
6. Schetzen, M. (1980). The Volterra and Wiener Theories of Nonlinear Systems, John Wiley & Sons Inc.
7. Representations of non-linear systems: The NARMAX model10.1080/00207178908559683 ↗
8. NARMAX representation and identification of ankle dynamics10.1109/TBME.2002.803507 ↗
9. Boynton, R., Balikhin, M., Wei, H., and Lang, Z. (2018). Applications of NARMAX in space weather. Machine Learning Techniques for Space Weather, Elsevier.10.1016/B978-0-12-811788-0.00008-1 ↗
10. Orthogonal parameter estimation algorithm for non-linear stochastic systems10.1080/00207178808906169 ↗
11. Orthogonal least squares methods and their application to nonlinear system identification10.1080/00207178908953472 ↗
12. Model selection approaches for non-linear system identification: A review10.1080/00207720802083018 ↗
13. Optimal input signals for nonlinear-system identification10.1049/piee.1971.0183 ↗
14. Optimal inputs for linear system identification10.1109/TAC.1974.1100554 ↗
15. Raju, R.S., Daruwalla, K., and Lipasti, M. (2021). Accelerating deep learning with dynamic data pruning. arXiv.
16. Beyond neural scaling laws: Beating power law scaling via data pruning
17. Yang, Z., Yang, H., Majumder, S., Cardoso, J., and Gallego, G. (2024). Data pruning can do more: A Comprehensive data pruning approach for object re-identification. arXiv.
18. Marion, M., Üstün, A., Pozzobon, L., Wang, A., Fadaee, M., and Hooker, S. (2023). When less is more: Investigating data pruning for pretraining LLMs at scale. arXiv.
19. Jin, R., Xu, Q., Wu, M., Xu, Y., Li, D., Li, X., and Chen, Z. (2024). LLM-based knowledge pruning for time series data analytics on edge-computing devices. arXiv.
20. Orthogonal least squares based fast feature selection for linear classification10.1016/j.patcog.2021.108419 ↗
21. Canonical-correlation-based fast feature selection for structural health monitoring10.1016/j.ymssp.2024.111895 ↗
22. K-SVD: An algorithm for designing overcomplete dictionaries for sparse representation10.1109/TSP.2006.881199 ↗
23. Task-driven dictionary learning10.1109/TPAMI.2011.156 ↗
24. Fast low-rank shared dictionary learning for image classification10.1109/TIP.2017.2729885 ↗
25. Ayed, F., and Hayou, S. (2023). Data pruning and neural scaling laws: Fundamental limitations of score-based algorithms. arXiv.
26. Janot, A., Gautier, M., and Brunot, M. (2019, January 10–12). Data set and reference models of EMPS. Proceedings of the Nonlinear System Identification Benchmarks, Eindhoven, The Netherlands.
27. Schoukens, J., and Ljung, L. (2009). Wiener-Hammerstein Benchmark, Linköping University Electronic Press.
28. Billinge, S. (2025, July 21). bg-mpl-stylesheets. Available online: https://github.com/Billingegroup/bg-mpl-stylesheets.
29. Sculley, D. (2010, January 26–30). Web-scale k-means clustering. Proceedings of the 19th International Conference on World Wide Web, Raleigh, NC, USA.10.1145/1772690.1772862 ↗