{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,14]],"date-time":"2025-11-14T10:03:16Z","timestamp":1763114596278,"version":"3.37.3"},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T00:00:00Z","timestamp":1669248000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T00:00:00Z","timestamp":1669248000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Stat Comput"],"published-print":{"date-parts":[[2023,2]]},"DOI":"10.1007\/s11222-022-10181-4","type":"journal-article","created":{"date-parts":[[2022,11,24]],"date-time":"2022-11-24T20:09:57Z","timestamp":1669320597000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["LASSO for streaming data with adaptative filtering"],"prefix":"10.1007","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7166-6940","authenticated-orcid":false,"given":"Marco","family":"Cap\u00f3","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aritz","family":"P\u00e9rez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 A.","family":"Lozano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,24]]},"reference":[{"key":"10181_CR1","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-47534-9","volume-title":"Data Streams: Models and Algorithms","author":"CC Aggarwal","year":"2007","unstructured":"Aggarwal, C.C.: Data Streams: Models and Algorithms, vol. 31. Springer, Berlin (2007)"},{"key":"10181_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1","key":"10181_CR3","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1137\/S003614450037906X","volume":"43","author":"SS Chen","year":"2001","unstructured":"Chen, S.S., Donoho, D.L., Saunders, M.A.: Atomic decomposition by basis pursuit. SIAM Rev. 43(1), 129\u2013159 (2001)","journal-title":"SIAM Rev."},{"issue":"11","key":"10181_CR4","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1002\/cpa.20042","volume":"57","author":"I Daubechies","year":"2004","unstructured":"Daubechies, I., Defrise, M., De Mol, C.: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint. Commun. Pure Appl. Math. J. Issued Courant Inst. Math. Sci. 57(11), 1413\u20131457 (2004)","journal-title":"Commun. Pure Appl. Math. J. Issued Courant Inst. Math. Sci."},{"issue":"2","key":"10181_CR5","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1214\/009053604000000067","volume":"32","author":"B Efron","year":"2004","unstructured":"Efron, B., Hastie, T., Johnstone, I., Tibshirani, R., et al.: Least angle regression. Ann. Stat. 32(2), 407\u2013499 (2004)","journal-title":"Ann. Stat."},{"issue":"3","key":"10181_CR6","doi-asserted-by":"crossref","first-page":"397","DOI":"10.1080\/10618600.1998.10474784","volume":"7","author":"WJ Fu","year":"1998","unstructured":"Fu, W.J.: Penalized regressions: the bridge versus the lasso. J. Comput. Graph. Stat. 7(3), 397\u2013416 (1998)","journal-title":"J. Comput. Graph. Stat."},{"issue":"2","key":"10181_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1083784.1083789","volume":"34","author":"MM Gaber","year":"2005","unstructured":"Gaber, M.M., Zaslavsky, A., Krishnaswamy, S.: Mining data streams: a review. ACM Sigmod Rec. 34(2), 18\u201326 (2005)","journal-title":"ACM Sigmod Rec."},{"key":"10181_CR8","unstructured":"Garrigues, P., Ghaoui, L.E.: An homotopy algorithm for the LASSO with online observations. In: Advances in Neural Information Processing Systems, pp. 489\u2013496 (2009)"},{"key":"10181_CR9","unstructured":"G\u00e4rtner, B., Jaggi, M., Maria, C.: An exponential lower bound on the complexity of regularization paths (2009). arXiv preprint arXiv:0903.4817"},{"key":"10181_CR10","doi-asserted-by":"crossref","unstructured":"Gustafsson, F., Gustafsson, F.: Adaptive Filtering and Change Detection, vol.\u00a01. Citeseer (2000)","DOI":"10.1002\/0470841613"},{"key":"10181_CR11","first-page":"1391","volume":"5","author":"T Hastie","year":"2004","unstructured":"Hastie, T., Rosset, S., Tibshirani, R., Zhu, J.: The entire regularization path for the support vector machine. J. Mach. Learn. Res. 5, 1391\u20131415 (2004)","journal-title":"J. Mach. Learn. Res."},{"key":"10181_CR12","doi-asserted-by":"publisher","DOI":"10.1201\/b18401","volume-title":"Statistical Learning with Sparsity: The LASSO and Generalizations","author":"T Hastie","year":"2015","unstructured":"Hastie, T., Tibshirani, R., Wainwright, M.: Statistical Learning with Sparsity: The LASSO and Generalizations. CRC Press, Boca Raton (2015)"},{"key":"10181_CR13","volume-title":"Statistical Digital Signal Processing and Modeling","author":"MH Hayes","year":"2009","unstructured":"Hayes, M.H.: Statistical Digital Signal Processing and Modeling. Wiley, Hoboken (2009)"},{"key":"10181_CR14","volume-title":"Adaptive Filter Theory","author":"SS Haykin","year":"2008","unstructured":"Haykin, S.S.: Adaptive Filter Theory. Pearson Education India, New Delhi (2008)"},{"issue":"2","key":"10181_CR15","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1214\/10-AOAS329","volume":"4","author":"NA Heard","year":"2010","unstructured":"Heard, N.A., Weston, D.J., Platanioti, K., Hand, D.J., et al.: Bayesian anomaly detection methods for social networks. Ann. Appl. Stat. 4(2), 645\u2013662 (2010)","journal-title":"Ann. Appl. Stat."},{"key":"10181_CR16","unstructured":"Ida, Y., Fujiwara, Y., Kashima, H.: Fast sparse group LASSO. In: Advances in Neural Information Processing Systems, pp. 1702\u20131710 (2019)"},{"key":"10181_CR17","doi-asserted-by":"crossref","unstructured":"Kim, Y., Kim, J.: Gradient LASSO for feature selection. In: Proceedings of the Twenty-First International Conference on Machine Learning, pp. 60 (2004)","DOI":"10.1145\/1015330.1015364"},{"issue":"4","key":"10181_CR18","doi-asserted-by":"publisher","first-page":"606","DOI":"10.1109\/JSTSP.2007.910971","volume":"1","author":"SJ Kim","year":"2007","unstructured":"Kim, S.J., Koh, K., Lustig, M., Boyd, S., Gorinevsky, D.: An interior-point method for large-scale $$l_1 $$-regularized least squares. IEEE J. Sel. Top. Signal Process. 1(4), 606\u2013617 (2007)","journal-title":"IEEE J. Sel. Top. Signal Process."},{"issue":"4","key":"10181_CR19","doi-asserted-by":"publisher","first-page":"994","DOI":"10.1198\/106186008X386210","volume":"17","author":"J Kim","year":"2008","unstructured":"Kim, J., Kim, Y., Kim, Y.: A gradient-based optimization algorithm for lasso. J. Comput. Graph. Stat. 17(4), 994\u20131009 (2008)","journal-title":"J. Comput. Graph. Stat."},{"issue":"1","key":"10181_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2674026.2674028","volume":"16","author":"G Krempl","year":"2014","unstructured":"Krempl, G., \u017dliobaite, I., Brzezi\u0144ski, D., H\u00fcllermeier, E., Last, M., Lemaire, V., et al.: Open challenges for data stream mining research. ACM SIGKDD Explor. Newsl. 16(1), 1\u201310 (2014)","journal-title":"ACM SIGKDD Explor. Newsl."},{"key":"10181_CR21","unstructured":"Langford, J., Li, L., Zhang, T.: Sparse online learning via truncated gradient. In: Advances in Neural Information Processing Systems, pp. 905\u2013912 (2009)"},{"key":"10181_CR22","doi-asserted-by":"crossref","unstructured":"Liu, H., Palatucci, M., Zhang, J.: Blockwise coordinate descent procedures for the multi-task lasso, with applications to neural semantic basis discovery. In: Proceedings of the 26th Annual International Conference on Machine Learning, pp. 649\u2013656 (2009)","DOI":"10.1145\/1553374.1553458"},{"key":"10181_CR23","unstructured":"Lokhorst, J., Venables, B., Turlach, B., Maechler, M.: LASSO2: L1 constrained estimation aka \u2018LASSO\u2019. R package version. pp. 1\u20132 (2007)"},{"key":"10181_CR24","unstructured":"Mairal, J., Yu, B.: Complexity analysis of the lasso regularization path (2012). arXiv preprint arXiv:1205.0079"},{"key":"10181_CR25","unstructured":"Malioutov, D.M., Cetin, M., Willsky, A.S.: Homotopy continuation for sparse signal representation. In: Proceedings.(ICASSP\u201905). IEEE International Conference on Acoustics, Speech, and Signal Processing, vol.\u00a05, pp. v\u2013733. IEEE, (2005)"},{"key":"10181_CR26","unstructured":"Monti, R.P., Anagnostopoulos, C., Montana, G.: A framework for adaptive regularization in streaming LASSO models. Stat 1050, 28 (2016)"},{"issue":"5","key":"10181_CR27","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/sam.11390","volume":"11","author":"RP Monti","year":"2018","unstructured":"Monti, R.P., Anagnostopoulos, C., Montana, G.: Adaptive regularization for lasso models in the context of nonstationary data streams. Stat. Anal. Data Min. ASA Data Sci. J. 11(5), 237\u2013247 (2018)","journal-title":"Stat. Anal. Data Min. ASA Data Sci. J."},{"key":"10181_CR28","doi-asserted-by":"crossref","unstructured":"Nesterov, Y.E., Nemirovski, A.: Interior-Point Polynomial Methods in Convex Programming. Studies in Applied Mathematics, vol. 14. SIAM, Philadelphia (1994)","DOI":"10.1137\/1.9781611970791"},{"issue":"3","key":"10181_CR29","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1093\/imanum\/20.3.389","volume":"20","author":"MR Osborne","year":"2000","unstructured":"Osborne, M.R., Presnell, B., Turlach, B.A.: A new approach to variable selection in least squares problems. IMA J. Numer. Anal. 20(3), 389\u2013403 (2000)","journal-title":"IMA J. Numer. Anal."},{"issue":"2","key":"10181_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/s12532-013-0051-x","volume":"5","author":"Z Qin","year":"2013","unstructured":"Qin, Z., Scheinberg, K., Goldfarb, D.: Efficient block-coordinate descent algorithms for the group lasso. Math. Program. Comput. 5(2), 143\u2013169 (2013)","journal-title":"Math. Program. Comput."},{"key":"10181_CR31","doi-asserted-by":"crossref","unstructured":"Rosset, S., Zhu, J.: Piecewise linear regularized solution paths. Ann. Stat. 3, 1012\u20131030 (2007)","DOI":"10.1214\/009053606000001370"},{"key":"10181_CR32","volume-title":"Minimization Methods for Non-differentiable Functions","author":"NZ Shor","year":"2012","unstructured":"Shor, N.Z.: Minimization Methods for Non-differentiable Functions, vol. 3. Springer, Berlin (2012)"},{"issue":"1","key":"10181_CR33","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. R. Stat. Soc. Ser. B (Methodol.) 58(1), 267\u2013288 (1996)","journal-title":"J. R. Stat. Soc. Ser. B (Methodol.)"},{"key":"10181_CR34","doi-asserted-by":"publisher","first-page":"1456","DOI":"10.1214\/13-EJS815","volume":"7","author":"RJ Tibshirani","year":"2013","unstructured":"Tibshirani, R.J., et al.: The lasso problem and uniqueness. Electron. J. Stat. 7, 1456\u20131490 (2013)","journal-title":"Electron. J. Stat."},{"issue":"2","key":"10181_CR35","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1016\/j.neuroimage.2011.10.009","volume":"62","author":"N Weiskopf","year":"2012","unstructured":"Weiskopf, N.: Real-time fMRI and its application to neurofeedback. Neuroimage 62(2), 682\u2013692 (2012)","journal-title":"Neuroimage"},{"key":"10181_CR36","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"SJ Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"},{"issue":"1","key":"10181_CR37","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1214\/07-AOAS147","volume":"2","author":"TT Wu","year":"2008","unstructured":"Wu, T.T., Lange, K., et al.: Coordinate descent algorithms for lasso penalized regression. Ann. Appl. Stat. 2(1), 224\u2013244 (2008)","journal-title":"Ann. Appl. Stat."},{"key":"10181_CR38","volume-title":"Interior Point Algorithms: Theory and Analysis","author":"Y Ye","year":"2011","unstructured":"Ye, Y.: Interior Point Algorithms: Theory and Analysis, vol. 44. Wiley, Hoboken (2011)"},{"key":"10181_CR39","unstructured":"Yuan, L., Liu, J., Ye, J.: Efficient methods for overlapping group LASSO. In: Advances in Neural Information Processing Systems, pp. 352\u2013360 (2011)"}],"container-title":["Statistics and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-022-10181-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11222-022-10181-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11222-022-10181-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T14:11:26Z","timestamp":1728483086000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11222-022-10181-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,24]]},"references-count":39,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,2]]}},"alternative-id":["10181"],"URL":"https:\/\/doi.org\/10.1007\/s11222-022-10181-4","relation":{},"ISSN":["0960-3174","1573-1375"],"issn-type":[{"type":"print","value":"0960-3174"},{"type":"electronic","value":"1573-1375"}],"subject":[],"published":{"date-parts":[[2022,11,24]]},"assertion":[{"value":"15 April 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 November 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}],"article-number":"5"}}