This paper presents a model-selection strategy based on minimum description length (MDL) that keeps the kernel least-mean-square (KLMS) model tuned to the complexity of the input data. The proposed KLMS-MDL filter adapts its model order as well as its coefficients online, behaving as a self-organizing system and achieving a good compromise between system accuracy and computational complexity without a priori knowledge. Particularly, in a nonstationary scenario, the model order of the proposed algorithm changes continuously with the input data structure. Experiments show the proposed algorithm successfully builds compact kernel adaptive filters with better accuracy than KLMS with sparsity or fixed-budget algorithms.
CITATION STYLE
Zhao, S., Chen, B., Cao, Z., Zhu, P., & Principe, J. C. (2016). Self-organizing kernel adaptive filtering. Eurasip Journal on Advances in Signal Processing, 2016(1). https://doi.org/10.1186/s13634-016-0406-3
Mendeley helps you to discover research relevant for your work.