{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T15:49:26Z","timestamp":1777477766705,"version":"3.51.4"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T00:00:00Z","timestamp":1476230400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T00:00:00Z","timestamp":1476230400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["ECCS0856441"],"award-info":[{"award-number":["ECCS0856441"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["61372152"],"award-info":[{"award-number":["61372152"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100002855","name":"Ministry of Science and Technology of the People's Republic of China","doi-asserted-by":"publisher","award":["2015CB351703"],"award-info":[{"award-number":["2015CB351703"]}],"id":[{"id":"10.13039\/501100002855","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["EURASIP J. Adv. Signal Process."],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1186\/s13634-016-0406-3","type":"journal-article","created":{"date-parts":[[2016,10,12]],"date-time":"2016-10-12T01:23:36Z","timestamp":1476235416000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Self-organizing kernel adaptive filtering"],"prefix":"10.1186","volume":"2016","author":[{"given":"Songlin","family":"Zhao","sequence":"first","affiliation":[]},{"given":"Badong","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Zheng","family":"Cao","sequence":"additional","affiliation":[]},{"given":"Pingping","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Jose C.","family":"Principe","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,12]]},"reference":[{"issue":"2","key":"406_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1109\/TSP.2007.907881","volume":"56","author":"W Liu","year":"2008","unstructured":"W Liu, PP Pokharel, JC Pr\u00edncipe, The kernel least mean square algorithm. IEEE Trans. Sig. Process. 56(2), 543\u2013554 (2008).","journal-title":"IEEE Trans. Sig. Process"},{"issue":"8","key":"406_CR2","doi-asserted-by":"publisher","first-page":"2275","DOI":"10.1109\/TSP.2004.830985","volume":"52","author":"Y Engel","year":"2004","unstructured":"Y Engel, S Mannor, R Meir, The kernel recursive least-squares algorithm. IEEE Trans. Sig. Process. 52(8), 2275\u20132285 (2004).","journal-title":"IEEE Trans. Sig. Process"},{"issue":"4","key":"406_CR3","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1162\/neco.1991.3.2.213","volume":"3","author":"J Platt","year":"1991","unstructured":"J Platt, A resource-allocating network for function interpolation. Neural Comput. 3(4), 213\u2013225 (1991).","journal-title":"Neural Comput"},{"issue":"3","key":"406_CR4","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1109\/TSP.2010.2096420","volume":"59","author":"P Bouboulis","year":"2011","unstructured":"P Bouboulis, S Theodoridis, Extension of Wirtinger\u2019s calculus to reproducing kernel Hilbert spaces and the complex kernel LMS. J. IEEE Trans. Sig. Process. 59(3), 964\u2013978 (2011).","journal-title":"J. IEEE Trans. Sig. Process"},{"key":"406_CR5","first-page":"1","volume":"1","author":"K Slavakis","year":"2008","unstructured":"K Slavakis, S Theodoridis, Sliding window generalized kernel affine projection algorithm using projection mappings. EURASIP J. Adv. Sig. Process. 1:, 1\u201316 (2008).","journal-title":"EURASIP J. Adv. Sig. Process"},{"issue":"3","key":"406_CR6","doi-asserted-by":"publisher","first-page":"1058","DOI":"10.1109\/TSP.2008.2009895","volume":"57","author":"C Richard","year":"2009","unstructured":"C Richard, JCM Bermudez, P Honeine, Online prediction of time series data with kernels. IEEE Trans. Sig. Process. 57(3), 1058\u20131066 (2009).","journal-title":"IEEE Trans. Sig. Process"},{"issue":"12","key":"406_CR7","doi-asserted-by":"publisher","first-page":"1950","DOI":"10.1109\/TNN.2009.2033676","volume":"20","author":"W Liu","year":"2009","unstructured":"W Liu, Il Park, JC Pr\u00edncipe, An information theoretic approach of designing sparse kernel adaptive filters. IEEE Trans. Neural Netw. 20(12), 1950\u20131961 (2009).","journal-title":"IEEE Trans. Neural Netw"},{"issue":"1","key":"406_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1109\/TNNLS.2011.2178446","volume":"23","author":"B Chen","year":"2012","unstructured":"B Chen, S Zhao, P Zhu, JC Pr\u00edncipe, Quantized kernel least mean square algorithm. IEEE Trans. Neural Netw. Learn. Syst. 23(1), 22\u201332 (2012).","journal-title":"IEEE Trans. Neural Netw. Learn. Syst"},{"issue":"9","key":"406_CR9","doi-asserted-by":"publisher","first-page":"1484","DOI":"10.1109\/TNNLS.2013.2258936","volume":"24","author":"B Chen","year":"2013","unstructured":"B Chen, S Zhao, P Zhu, JC Pr\u00edncipe, Quantized kernel recursive least squares algorithm. IEEE Trans. Neural Netw. Learn. Syst. 24(9), 1484\u20131491 (2013).","journal-title":"IEEE Trans. Neural Netw. Learn. Syst"},{"key":"406_CR10","doi-asserted-by":"crossref","unstructured":"SV Vaerenbergh, J Via, I Santamana, A sliding-window kernel RLS algorithm and its application to nonlinear channel identification. IEEE Int. Conf. Acoust. Speech Sig. Process, 789\u2013792 (2006).","DOI":"10.1109\/ICASSP.2006.1661394"},{"issue":"3","key":"406_CR11","doi-asserted-by":"publisher","first-page":"1","DOI":"10.4304\/jcm.2.3.1-8","volume":"2","author":"SV Vaerenbergh","year":"2007","unstructured":"SV Vaerenbergh, J Via, I Santamana, Nonlinear system identification using a new sliding-window kernel RLS algorithm. J. Commun. 2(3), 1\u20138 (2007).","journal-title":"J. Commun"},{"key":"406_CR12","doi-asserted-by":"crossref","unstructured":"SV Vaerenbergh, I Santamana, W Liu, JC Pr\u00edncipe, Fixed-budget kernel recursive least-squares. IEEE Int. Conf. Acoust. Speech Sig. Process, 1882\u20131885 (2010).","DOI":"10.1109\/ICASSP.2010.5495350"},{"key":"406_CR13","doi-asserted-by":"crossref","unstructured":"M L\u00e1zaro-Gredilla, SV Vaerenbergh, I Santamana, A Bayesian approach to tracking with kernel recursive least-squares. IEEE Int. Work. Mach. Learn. Sig. Process. (MLSP), 1\u20136 (2011).","DOI":"10.1109\/MLSP.2011.6064585"},{"issue":"9","key":"406_CR14","doi-asserted-by":"publisher","first-page":"2759","DOI":"10.1016\/j.sigpro.2013.02.012","volume":"93","author":"S Zhao","year":"2013","unstructured":"S Zhao, B Chen, P Zhu, JC Pr\u00edncipe, Fixed budget quantized kernel least-mean-square algorithm. Sig. Process. 93(9), 2759\u20132770 (2013).","journal-title":"Sig. Process"},{"key":"406_CR15","doi-asserted-by":"crossref","unstructured":"D Rzepka, in 2012 IEEE 17th Conference on Emerging Technologies & Factory Automation (ETFA). Fixed-budget kernel least mean squares (Krakow, 2012), pp. 1\u20134.","DOI":"10.1109\/ETFA.2012.6489767"},{"key":"406_CR16","doi-asserted-by":"crossref","unstructured":"K Nishikawa, Y Ogawa, F Albu, in Signal and Information Processing Association Annual Summit and Conference (APSIPA). Fixed order implementation of kernel RLS-DCD adaptive filters (Asia-Pacific, 2013), pp. 1\u20136.","DOI":"10.1109\/APSIPA.2013.6694215"},{"key":"406_CR17","first-page":"883","volume":"1","author":"K Slavakis","year":"2013","unstructured":"K Slavakis, P Bouboulis, S Theodoridis, Online learning in reproducing kernel Hilbert spaces. Sig. Process. Theory Mach. Learn.1:, 883\u2013987 (2013).","journal-title":"Sig. Process. Theory Mach. Learn."},{"issue":"11","key":"406_CR18","doi-asserted-by":"publisher","first-page":"2765","DOI":"10.1109\/TSP.2014.2318132","volume":"62","author":"W Gao","year":"2014","unstructured":"W Gao, J Chen, C Richard, J Huang, Online dictionary learning for kernel LMS. IEEE Trans. Sig. Process. 62(11), 2765\u20132777 (2014).","journal-title":"IEEE Trans. Sig. Process"},{"issue":"5","key":"406_CR19","first-page":"465","volume":"14","author":"J Rissanen","year":"1978","unstructured":"J Rissanen, Modeling by shortest data description. Sig. Process. 14(5), 465\u2013471 (1978).","journal-title":"Sig. Process"},{"key":"406_CR20","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M Li","year":"2008","unstructured":"M Li, PMB Vit\u00e1nyi, An introduction to Kolmogorov complexity and its applications (Publisher, Springer-Verlag, New York Inc, 2008)."},{"issue":"2","key":"406_CR21","doi-asserted-by":"publisher","first-page":"716","DOI":"10.1109\/TAC.1974.1100705","volume":"19","author":"H Akaike","year":"1974","unstructured":"H Akaike, A new look at the statistical model identification. IEEE Trans. Autom. Control. 19(2), 716\u2013723 (1974).","journal-title":"IEEE Trans. Autom. Control"},{"issue":"2","key":"406_CR22","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1214\/aos\/1176344136","volume":"6","author":"G Schwarz","year":"1978","unstructured":"G Schwarz, Estimating the dimension of a model. Ann. Stat. 6(2), 461\u2013464 (1978).","journal-title":"Ann. Stat"},{"issue":"6","key":"406_CR23","doi-asserted-by":"publisher","first-page":"2743","DOI":"10.1109\/18.720554","volume":"44","author":"A Barron","year":"1998","unstructured":"A Barron, J Rissanen, B Yu, The minimum description length principle in coding and modeling. IEEE Trans. Inf. Theory. 44(6), 2743\u20132760 (1998).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"4","key":"406_CR24","doi-asserted-by":"publisher","first-page":"629","DOI":"10.1109\/TIT.1984.1056936","volume":"30","author":"J Rissanen","year":"1984","unstructured":"J Rissanen, Universal coding, information, prediction, and estimation. IEEE Trans. Inf. Theory. 30(4), 629\u2013636 (1984).","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"7","key":"406_CR25","doi-asserted-by":"publisher","first-page":"2537","DOI":"10.1109\/18.887861","volume":"46","author":"J Rissanen","year":"2000","unstructured":"J Rissanen, MDL denoising. IEEE Trans. Inf. Theory. 46(7), 2537\u20132543 (2000).","journal-title":"IEEE Trans. Inf. Theory"},{"key":"406_CR26","doi-asserted-by":"crossref","unstructured":"L Xu, Bayesian Ying Yang learning (II): a new mechanism for model selection and regularization. Intell. Technol. Inf. Anal, 661\u2013706 (2004).","DOI":"10.1007\/978-3-662-07952-2_23"},{"issue":"3","key":"406_CR27","doi-asserted-by":"publisher","first-page":"722","DOI":"10.1109\/TCSI.2005.858321","volume":"53","author":"Z Yi","year":"2006","unstructured":"Z Yi, M Small, Minimum description length criterion for modeling of chaotic attractors with multilayer perceptron networks. IEEE Trans. Circ. Syst. I: Regular Pap. 53(3), 722\u2013732 (2006).","journal-title":"IEEE Trans. Circ. Syst. I: Regular Pap"},{"key":"406_CR28","doi-asserted-by":"crossref","unstructured":"T Nakamura, K Judd, AI Mees, M Small, A comparative study of information criteria for model selection. Int. J. Bifurcation Chaos Appl. Sci. Eng. 16(8) (2153).","DOI":"10.1142\/S0218127406015982"},{"key":"406_CR29","doi-asserted-by":"crossref","unstructured":"T Cover, J Thomas, Elements of information theory (Wiley, 1991).","DOI":"10.1002\/0471200611"},{"key":"406_CR30","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1214\/lnms\/1215091140","volume":"40","author":"M Hansen","year":"2003","unstructured":"M Hansen, B Yu, Minimum description length model selection criteria for generalized linear models. Stat. Sci. A Festschrift for Terry Speed. 40:, 145\u2013163 (2003).","journal-title":"Stat. Sci. A Festschrift for Terry Speed"},{"issue":"2","key":"406_CR31","first-page":"79","volume":"21","author":"K Shinoda","year":"2000","unstructured":"K Shinoda, T Watanabe, MDL-based context-dependent subword modeling for speech recognition. Acoust. Sci. Technol. 21(2), 79\u201386 (2000).","journal-title":"Acoust. Sci. Technol"},{"issue":"2","key":"406_CR32","doi-asserted-by":"publisher","first-page":"1445","DOI":"10.1086\/505136","volume":"646","author":"AA Ramos","year":"2006","unstructured":"AA Ramos, The minimum description length principle and model selection in spectropolarimetry. Astrophys. J. 646(2), 1445\u20131451 (2006).","journal-title":"Astrophys. J"},{"key":"406_CR33","unstructured":"RS Zemel, A minimum description length framework for unsupervised learning, Dissertation (University of Toronto, 1993)."},{"key":"406_CR34","unstructured":"AWF Edwards, Likelihood, (Cambridge Univ Pr, 1984)."},{"issue":"6","key":"406_CR35","first-page":"066701","volume":"66","author":"M Small","year":"2002","unstructured":"M Small, CK Tse, Minimum description length neural networks for time series prediction. Astrophys. J. 66(6), 066701 (2002).","journal-title":"Astrophys. J"},{"issue":"4","key":"406_CR36","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1109\/TII.2009.2031433","volume":"5","author":"A Ning","year":"2009","unstructured":"A Ning, H Lau, Y Zhao, TT Wong, Fulfillment of retailer demand by using the MDL-optimal neural network prediction and decision policy. IEEE Trans. Ind. Inform. 5(4), 495\u2013506 (2009).","journal-title":"IEEE Trans. Ind. Inform"},{"issue":"1","key":"406_CR37","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1016\/j.neucom.2010.03.011","volume":"74","author":"JS Wang","year":"2010","unstructured":"JS Wang, YL Hsu, An MDL-based Hammerstein recurrent neural network for control applications. Neurocomputing. 74(1), 315\u2013327 (2010).","journal-title":"Neurocomputing"},{"issue":"4","key":"406_CR38","doi-asserted-by":"publisher","first-page":"046207","DOI":"10.1103\/PhysRevE.80.046207","volume":"80","author":"YI Molkov","year":"2009","unstructured":"YI Molkov, DN Mukhin, EM Loskutov, AM Feigin, GA Fidelin, Using the minimum description length principle for global reconstruction of dynamic systems from noisy time series. Phys. Rev. E. 80(4), 046207 (2009).","journal-title":"Phys. Rev. E"},{"issue":"5","key":"406_CR39","doi-asserted-by":"publisher","first-page":"963","DOI":"10.1016\/S0893-6080(98)00051-3","volume":"11","author":"A Leonardis","year":"1998","unstructured":"A Leonardis, H Bischof, An efficient MDL-based construction of RBF networks. Neural Netw. 11(5), 963\u2013973 (1998).","journal-title":"Neural Netw"},{"issue":"1","key":"406_CR40","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/s100440050015","volume":"2","author":"H Bischof","year":"1999","unstructured":"H Bischof, A Leonardis, A Selb, MDL principle for robust vector quantisation. Pattern Anal. Appl. 2(1), 59\u201372 (1999).","journal-title":"Pattern Anal. Appl"},{"key":"406_CR41","doi-asserted-by":"crossref","unstructured":"T Rakthanmanon, EJ Keogh, S Lonardi, S Evans, MDL-based time series clustering. Knowl. Inf. Syst., 1\u201329 (2012).","DOI":"10.1007\/s10115-012-0508-7"},{"key":"406_CR42","unstructured":"H Bischof, A Leonardis, in 15th International Conference on Pattern Recognition. Fuzzy c-means in an MDL-framework (Barcelona, 2000), pp. 740\u2013743."},{"issue":"1","key":"406_CR43","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1142\/S0218213004001429","volume":"13","author":"I Jonye","year":"2004","unstructured":"I Jonye, LB Holder, DJ Cook, MDL-based context-free graph grammar induction and applications. Int. J. Artif. Intell. Tools. 13(1), 65\u201380 (2004).","journal-title":"Int. J. Artif. Intell. Tools"},{"key":"406_CR44","doi-asserted-by":"crossref","unstructured":"S Papadimitriou, J Sun, C Faloutsos, P Yu, Hierarchical, parameter-free community discovery. Mach. Learn. Knowl. Discov. Databases., 170\u2013187 (2008).","DOI":"10.1007\/978-3-540-87481-2_12"},{"issue":"3","key":"406_CR45","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1214\/aoms\/1177704472","volume":"33","author":"E Parzen","year":"1962","unstructured":"E Parzen, On estimation of a probability density function and mode. Ann. Math. Stat. 33(3), 1065\u20131076 (1962).","journal-title":"Ann. Math. Stat"},{"key":"406_CR46","volume-title":"Introduction to the Theory of Statistics","author":"AM Mood","year":"1974","unstructured":"AM Mood, FA Graybill, DC Boes, Introduction to the Theory of Statistics (McGraw-Hill, USA, 1974)."},{"key":"406_CR47","volume-title":"Applications of empirical process theory","author":"SA Geer","year":"2000","unstructured":"SA Geer, Applications of empirical process theory (The Press Syndicate of the University of Cambridge, Cambridge, 2000)."},{"key":"406_CR48","unstructured":"The Santa Fe time series competition data. http:\/\/www-psych.stanford.edu\/~andreas\/Time-Series\/SantaFe.html . Accessed June 2016."},{"key":"406_CR49","unstructured":"AS Weigend, NA Gershenfeld, Time series prediction: forecasting the future and understanding the past (Westview Press, 1994)."},{"key":"406_CR50","unstructured":"Sound files obtained from system simulations. http:\/\/www.cnel.ufl.edu\/~pravin\/Page_7.htm . Accessed June 2016."},{"key":"406_CR51","unstructured":"B Bigi, in The eighth international conference on Language Resources and Evaluation. SPPAS: a tool for the phonetic segmentations of Speech (Istanbul, 2012), pp. 1748\u20131755."},{"key":"406_CR52","unstructured":"SPPAS: automatic annotation of speech. http:\/\/www.sppas.org . Accessed June 2016."}],"container-title":["EURASIP Journal on Advances in Signal Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-016-0406-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1186\/s13634-016-0406-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1186\/s13634-016-0406-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T06:53:16Z","timestamp":1749624796000},"score":1,"resource":{"primary":{"URL":"https:\/\/asp-eurasipjournals.springeropen.com\/articles\/10.1186\/s13634-016-0406-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,12]]},"references-count":52,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["406"],"URL":"https:\/\/doi.org\/10.1186\/s13634-016-0406-3","relation":{},"ISSN":["1687-6180"],"issn-type":[{"value":"1687-6180","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,10,12]]},"assertion":[{"value":"20 June 2016","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 September 2016","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 October 2016","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"106"}}