{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T04:09:15Z","timestamp":1750910955735,"version":"3.41.0"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,9,16]],"date-time":"2017-09-16T00:00:00Z","timestamp":1505520000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2018,3]]},"DOI":"10.1007\/s10618-017-0542-x","type":"journal-article","created":{"date-parts":[[2017,9,16]],"date-time":"2017-09-16T10:00:06Z","timestamp":1505556006000},"page":"453-482","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["An improvement of the parameterized frequent directions algorithm"],"prefix":"10.1007","volume":"32","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3848-1028","authenticated-orcid":false,"given":"Deena P.","family":"Francis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8680-8390","authenticated-orcid":false,"given":"Kumudha","family":"Raimond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,9,16]]},"reference":[{"issue":"2","key":"542_CR1","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1219092.1219097","volume":"54","author":"D Achlioptas","year":"2007","unstructured":"Achlioptas D, McSherry F (2007) Fast computation of low-rank matrix approximations. J. ACM (JACM) 54(2):9","journal-title":"J. ACM (JACM)"},{"key":"542_CR2","unstructured":"Anguita D, Ghio A, Oneto L, Parra X, Reyes-Ortiz JL (2013) A public domain dataset for human activity recognition using smartphones. In: ESANN"},{"key":"542_CR3","doi-asserted-by":"crossref","unstructured":"Boutsidis C, Mahoney MW, Drineas P (2009) An improved approximation algorithm for the column subset selection problem. In: Proceedings of the twentieth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 968\u2013977","DOI":"10.1137\/1.9781611973068.105"},{"key":"542_CR4","doi-asserted-by":"crossref","unstructured":"Brand M (2002) Incremental singular value decomposition of uncertain data with missing values. In: European conference on computer vision. Springer, Berlin, pp 707\u2013720","DOI":"10.1007\/3-540-47969-4_47"},{"key":"542_CR5","unstructured":"Buss S (2016) Connectus data set Florida sparse matrix collection. http:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Buss\/connectus.html"},{"key":"542_CR6","doi-asserted-by":"crossref","unstructured":"Clarkson KL, Woodruff DP (2013) Low rank approximation and regression in input sparsity time. In: Proceedings of the forty-fifth annual ACM symposium on theory of computing. ACM, New York, pp 81\u201390","DOI":"10.1145\/2488608.2488620"},{"key":"542_CR7","unstructured":"Cuturi M (2011) Fast global alignment kernels. In: Proceedings of the 28th international conference on machine learning (ICML-11), pp 929\u2013936"},{"issue":"7","key":"542_CR8","doi-asserted-by":"crossref","first-page":"1678","DOI":"10.1109\/TKDE.2016.2539943","volume":"28","author":"A Desai","year":"2016","unstructured":"Desai A, Ghashami M, Phillips JM (2016) Improved practical matrix sketching with guarantees. IEEE Trans Knowl Data Eng 28(7):1678\u20131690","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"542_CR9","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1137\/S0097539704442696","volume":"36","author":"P Drineas","year":"2006","unstructured":"Drineas P, Kannan R, Mahoney MW (2006) Fast monte carlo algorithms for matrices II: computing a low-rank approximation to a matrix. SIAM J Comput 36(1):158\u2013183","journal-title":"SIAM J Comput"},{"key":"542_CR10","doi-asserted-by":"crossref","unstructured":"Ghashami M, Phillips JM (2014) Relative errors for deterministic low-rank matrix approximations. In: Proceedings of the twenty-fifth annual ACM-SIAM symposium on discrete algorithms. Society for Industrial and Applied Mathematics, pp 707\u2013717","DOI":"10.1137\/1.9781611973402.53"},{"key":"542_CR11","doi-asserted-by":"crossref","unstructured":"Ghashami M, Desai A, Phillips JM (2014) Improved practical matrix sketching with guarantees. In: European symposium on algorithms. Springer, Berlin, pp 467\u2013479","DOI":"10.1007\/978-3-662-44777-2_39"},{"issue":"5","key":"542_CR12","doi-asserted-by":"crossref","first-page":"1762","DOI":"10.1137\/15M1009718","volume":"45","author":"M Ghashami","year":"2016","unstructured":"Ghashami M, Liberty E, Phillips JM, Woodruff DP (2016) Frequent directions: simple and deterministic matrix sketching. SIAM J Comput 45(5):1762\u20131792","journal-title":"SIAM J Comput"},{"key":"542_CR13","doi-asserted-by":"crossref","unstructured":"Hall PM, Marshall AD, Martin RR (1998) Incremental eigenanalysis for classification. In: BMVC, vol 98. Citeseer, pp 286\u2013295","DOI":"10.5244\/C.12.29"},{"key":"542_CR14","unstructured":"Har-Peled S (2014) Low rank matrix approximation in linear time. arXiv preprint arXiv:1410.8802"},{"key":"542_CR15","doi-asserted-by":"crossref","unstructured":"Hoens TR, Chawla NV, Polikar R (2011) Heuristic updatable weighted random subspaces for non-stationary environments. In: 2011 IEEE 11th international conference on data mining (ICDM). IEEE, Washington, pp 241\u2013250","DOI":"10.1109\/ICDM.2011.75"},{"key":"542_CR16","doi-asserted-by":"crossref","unstructured":"Katakis I, Tsoumakas G, Vlahavas IP (2008) An ensemble of classifiers for coping with recurring contexts in data streams. In: ECAI, pp 763\u2013764","DOI":"10.3233\/978-1-58603-891-5-763"},{"issue":"3","key":"542_CR17","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/s10115-009-0206-2","volume":"22","author":"I Katakis","year":"2010","unstructured":"Katakis I, Tsoumakas G, Vlahavas I (2010) Tracking recurring contexts using ensemble classifiers: an application to email filtering. Knowl Inf Syst 22(3):371\u2013391","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"542_CR18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1214\/aoms\/1177729694","volume":"22","author":"S Kullback","year":"1951","unstructured":"Kullback S, Leibler RA (1951) On information and sufficiency. Ann Math Stat 22(1):79\u201386","journal-title":"Ann Math Stat"},{"key":"542_CR19","unstructured":"Lecun Y, Cortes C (2009) The MNIST database of handwritten digits. http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"issue":"8","key":"542_CR20","doi-asserted-by":"crossref","first-page":"1371","DOI":"10.1109\/83.855432","volume":"9","author":"A Levey","year":"2000","unstructured":"Levey A, Lindenbaum M (2000) Sequential Karhunen\u2013Loeve basis extraction and its application to images. IEEE Trans Image Process 9(8):1371\u20131374","journal-title":"IEEE Trans Image Process"},{"key":"542_CR21","doi-asserted-by":"crossref","unstructured":"Liberty E (2013) Simple and deterministic matrix sketching. In: Proceedings of the 19th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, London, pp 581\u2013588","DOI":"10.1145\/2487575.2487623"},{"issue":"2","key":"542_CR22","first-page":"123","volume":"3","author":"MW Mahoney","year":"2011","unstructured":"Mahoney MW (2011) Randomized algorithms for matrices and data. Found Trends Mach Learn 3(2):123\u2013224","journal-title":"Found Trends Mach Learn"},{"key":"542_CR23","doi-asserted-by":"crossref","unstructured":"Nelson J, Nguy\u00ean HL (2013) Osnap: faster numerical linear algebra algorithms via sparser subspace embeddings. In: 2013 IEEE 54th annual symposium on Foundations of Computer Science (FOCS). IEEE, Washington, pp 117\u2013126","DOI":"10.1109\/FOCS.2013.21"},{"key":"542_CR24","doi-asserted-by":"crossref","unstructured":"Sarl\u00f3s T (2006) Improved approximation algorithms for large matrices via random projections. In: 2006 47th annual IEEE symposium on foundations of computer science (FOCS\u201906). IEEE, Washington, pp 143\u2013152","DOI":"10.1109\/FOCS.2006.37"},{"issue":"3","key":"542_CR25","first-page":"317","volume":"1","author":"JC Schlimmer","year":"1986","unstructured":"Schlimmer JC, Granger RH (1986) Incremental learning from noisy data. Mach Learn 1(3):317\u2013354","journal-title":"Mach Learn"},{"key":"542_CR26","volume-title":"The problem of concept drift: definitions and related work","author":"A Tsymbal","year":"2004","unstructured":"Tsymbal A (2004) The problem of concept drift: definitions and related work. Computer Science Department, Trinity College Dublin, Dublin 106(2)"},{"key":"542_CR27","unstructured":"Wah C, Branson S, Welinder P, Perona P, Belongie S (2011) The Caltech-UCSD birds-200-2011 dataset. Tech. rep, California Institute of Technology"},{"issue":"30","key":"542_CR28","doi-asserted-by":"crossref","first-page":"964","DOI":"10.1007\/s10618-015-0448-4","volume":"4","author":"GI Webb","year":"2016","unstructured":"Webb GI, Hyde R, Cao H, Nguyen HL, Petitjean F (2016) Characterizing concept drift. Data Min Knowl Discov 4(30):964\u2013994","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"542_CR29","first-page":"69","volume":"23","author":"G Widmer","year":"1996","unstructured":"Widmer G, Kubat M (1996) Learning in the presence of concept drift and hidden contexts. Mach Learn 23(1):69\u2013101","journal-title":"Mach Learn"},{"issue":"1\u20132","key":"542_CR30","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1561\/0400000060","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff DP et al (2014) Sketching as a tool for numerical linear algebra. Found Trends Theor Comput Sci 10(1\u20132):1\u2013157","journal-title":"Found Trends Theor Comput Sci"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-017-0542-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0542-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-017-0542-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,25]],"date-time":"2025-06-25T19:40:39Z","timestamp":1750880439000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-017-0542-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,16]]},"references-count":30,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,3]]}},"alternative-id":["542"],"URL":"https:\/\/doi.org\/10.1007\/s10618-017-0542-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2017,9,16]]}}}