{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T07:15:21Z","timestamp":1648970121280},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T00:00:00Z","timestamp":1548288000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Key R&D Program of China","award":["2018YFB1004300"],"award-info":[{"award-number":["2018YFB1004300"]}]},{"name":"NSFC-NRF Joint Research Project","award":["61861146001"],"award-info":[{"award-number":["61861146001"]}]},{"name":"Young Elite Scientist Sponsorship Program by CAST","award":["2017QNRC001"],"award-info":[{"award-number":["2017QNRC001"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Data Sci Anal"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s41060-019-00174-4","type":"journal-article","created":{"date-parts":[[2019,1,24]],"date-time":"2019-01-24T23:44:40Z","timestamp":1548373480000},"page":"389-400","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Accelerating adaptive online learning by matrix approximation"],"prefix":"10.1007","volume":"9","author":[{"given":"Yuanyu","family":"Wan","sequence":"first","affiliation":[]},{"given":"Lijun","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,24]]},"reference":[{"issue":"4","key":"174_CR1","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1016\/S0022-0000(03)00025-4","volume":"66","author":"D Achlioptas","year":"2003","unstructured":"Achlioptas, D.: Database-friendly random projections: Johnson\u2013Lindenstrauss with binary coins. J. Comput. Syst. Sci. 66(4), 671\u2013687 (2003)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"174_CR2","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1007\/s41060-017-0050-5","volume":"3","author":"R Allesiardo","year":"2017","unstructured":"Allesiardo, R., Fraud, R., Maillard, O.A.: The non-stationary stochastic multi-armed bandit problem. Int. J. Data Sci. Anal. 3(4), 267\u2013283 (2017)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"1","key":"174_CR3","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/j.jcss.2007.04.016","volume":"74","author":"B Awerbuch","year":"2008","unstructured":"Awerbuch, B., Kleinberg, R.: Online linear optimization and adaptive routing. J. Comput. Syst. Sci. 74(1), 97\u2013114 (2008)","journal-title":"J. Comput. Syst. Sci."},{"key":"174_CR4","unstructured":"Boutsidis, C., Zouzias, A., Drineas, P.: Random projections for \n$$k$$\n\n\n\nk\n\n\n\n-means clustering. In: Advances in Neural Information Processing Systems, vol. 23, pp. 298\u2013306 (2010)"},{"issue":"3","key":"174_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"174_CR6","doi-asserted-by":"crossref","unstructured":"Dasgupta, S., Freund, Y.: Random projection trees and low dimensional manifolds. In: Proceedings of the 40th Annual ACM Symposium on Theory of computing, pp. 537\u2013546 (2008)","DOI":"10.1145\/1374376.1374452"},{"key":"174_CR7","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"174_CR8","unstructured":"Duchi, J., Shalev-Shwartz, S., Singer, Y., Tewari, A.: Composite objective mirror descent. In: Proceedings of the 23rd Annual Conference on Learning Theory, pp. 14\u201326 (2010)"},{"key":"174_CR9","unstructured":"Fern, X.Z., Brodley, C.E.: Random projection for high dimensional data clustering: a cluster ensemble approach. In: Proceedings of the 20th International Conference on Machine Learning, pp. 186\u201393 (2003)"},{"key":"174_CR10","doi-asserted-by":"crossref","unstructured":"Fradkin, D., Madigan, D.: Experiments with random projections for machine learning. In: Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 517\u2013522 (2003)","DOI":"10.1145\/956750.956812"},{"key":"174_CR11","unstructured":"Freund, Y., Dasgupta, S., Kabra, M., Verma, N.: Learning the structure of manifolds using random projections. In: Advances in Neural Information Processing Systems, vol. 21, pp. 473\u2013480 (2008)"},{"key":"174_CR12","unstructured":"Gao, W., Jin, R., Zhu, S., Zhou, Z.H.: One-pass AUC optimization. In: Proceedings of the 30th International Conference on Machine Learning, pp. 906\u2013914 (2013)"},{"issue":"5","key":"174_CR13","doi-asserted-by":"publisher","first-page":"1762","DOI":"10.1137\/15M1009718","volume":"45","author":"M Ghashami","year":"2016","unstructured":"Ghashami, M., Liberty, E., Phillips, J.M., Woodruff, D.P.: Frequent directions: simple and deterministic matrix sketching. SIAM J. Comput. 45(5), 1762\u20131792 (2016)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"174_CR14","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1137\/1031049","volume":"31","author":"WW Hager","year":"1989","unstructured":"Hager, W.W.: Updating the inverse of a matrix. SIAM Rev. 31(2), 221\u2013239 (1989)","journal-title":"SIAM Rev."},{"key":"174_CR15","doi-asserted-by":"publisher","unstructured":"Hassani, M., T\u00f6ws, D., Cuzzocrea, A., Seidl, T.: BFSPMiner: an effective and efficient batch-free algorithm for mining sequential patterns over data streams. Int. J. Data Sci. Anal. 1\u201317 (2017). \nhttps:\/\/doi.org\/10.1007\/S41060-017-0084-8","DOI":"10.1007\/S41060-017-0084-8"},{"issue":"2","key":"174_CR16","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10994-007-5016-8","volume":"69","author":"E Hazan","year":"2007","unstructured":"Hazan, E., Agarwal, A., Kale, S.: Logarithmic regret algorithms for online convex optimization. Mach. Learn. 69(2), 169\u2013192 (2007)","journal-title":"Mach. Learn."},{"key":"174_CR17","unstructured":"Kaski, S.: Dimensionality reduction by random mapping: fast similarity computation for clustering. In: Proceedings of the 1998 IEEE International Joint Conference on Neural Networks, vol. 1, pp. 413\u2013418 (1998)"},{"key":"174_CR18","unstructured":"Krizhevsky, A.: Learning multiple layers of features from tiny images. Technical report, University of Toronto (2009)"},{"key":"174_CR19","unstructured":"Krummenacher, G., McWilliams, B., Kilcher, Y., Buhmann, J.M., Meinshausen, N.: Scalable adaptive stochastic optimization using random projections. In: Advances in Neural Information Processing Systems, vol. 29, pp. 1750\u20131758 (2016)"},{"key":"174_CR20","doi-asserted-by":"crossref","unstructured":"LeCun, Y., Bottou, L., Bengio, Y., Haffner, P.: Gradient-based learning applied to document recognition. In: Proceedings of the IEEE, vol. 86, pp. 2278\u20132324 (1998)","DOI":"10.1109\/5.726791"},{"issue":"1","key":"174_CR21","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1007\/s00454-010-9309-5","volume":"45","author":"E Liberty","year":"2011","unstructured":"Liberty, E., Ailon, N., Singer, A.: Dense fast random projections and lean walsh transforms. Discrete Comput. Geom. 45(1), 34\u201344 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"174_CR22","unstructured":"Luo, H., Agarwal, A., Cesa-Bianchi, N., Langford, J.: Efficient second order online learning by sketching. In: Advances in Neural Information Processing Systems, vol. 29, pp. 902\u2013910 (2016)"},{"key":"174_CR23","doi-asserted-by":"crossref","unstructured":"Magen, A., Zouzias, A.: Low rank matrix-valued Chernoff bounds and approximate matrix multiplication. In: Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1422\u20131436 (2011)","DOI":"10.1137\/1.9781611973082.109"},{"key":"174_CR24","first-page":"2735","volume":"13","author":"OA Maillard","year":"2012","unstructured":"Maillard, O.A., Munos, R.: Linear regression with random projections. J. Mach. Learn. Res. 13, 2735\u20132772 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"174_CR25","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/s41060-017-0045-2","volume":"3","author":"K Miyaguchi","year":"2017","unstructured":"Miyaguchi, K., Yamanishi, K.: Online detection of continuous changes in stochastic processes. Int. J. Data Sci. Anal. 3(3), 213\u2013229 (2017)","journal-title":"Int. J. Data Sci. Anal."},{"issue":"2","key":"174_CR26","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1137\/090771806","volume":"53","author":"N Nalko","year":"2011","unstructured":"Nalko, N., Martinsson, P.G., Tropp, J.A.: Finding structure with randomness: probabilistic algorithms for constructing approximate matrix decompositions. SIAM Rev. 53(2), 217\u2013288 (2011)","journal-title":"SIAM Rev."},{"key":"174_CR27","unstructured":"Netzer, Y., Wang, T., Coates, A., Bissacco, A., Wu, B., Ng, A.Y.: Reading digits in natural images with unsupervised feature learning. In: NIPS Workshop on Deep Learning and Unsupervised Feature Learning 2011 (2011)"},{"key":"174_CR28","unstructured":"Rahimi, A., Recht, B.: Random features for large-scale kernel machines. In: Advances in Neural Information Processing Systems, vol. 21, pp. 1177\u20131184 (2008)"},{"issue":"1\u20132","key":"174_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1561\/2200000048","volume":"8","author":"JA Tropp","year":"2015","unstructured":"Tropp, J.A.: An introduction to matrix concentration inequalities. Found. Trends Mach. Learn. 8(1\u20132), 1\u2013230 (2015)","journal-title":"Found. Trends Mach. Learn."},{"key":"174_CR30","doi-asserted-by":"crossref","unstructured":"Wan, Y., Wei, N., Zhang, L.: Efficient adaptive online learning via frequent directions. In: Proceedings of the 27th International Joint Conference on Artificial Intelligence, pp. 2748\u20132754 (2018)","DOI":"10.24963\/ijcai.2018\/381"},{"key":"174_CR31","doi-asserted-by":"crossref","unstructured":"Wan, Y., Zhang, L.: Accelerating adaptive online learning by matrix approximation. In: Proceedings of the 22nd Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 405\u2013417 (2018)","DOI":"10.1007\/978-3-319-93037-4_32"},{"issue":"1\u20132","key":"174_CR32","first-page":"1","volume":"10","author":"DP Woodruff","year":"2014","unstructured":"Woodruff, D.P.: Sketching as a tool for numerical linear algebra. Found. Trends Mach. Learn. 10(1\u20132), 1\u2013157 (2014)","journal-title":"Found. Trends Mach. Learn."},{"key":"174_CR33","unstructured":"Xiao, L.: Dual averaging method for regularized stochastic learning and online optimization. In: Advances in Neural Information Processing Systems, vol. 22, pp. 2116\u20132124 (2009)"},{"issue":"4","key":"174_CR34","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/s41060-017-0088-4","volume":"6","author":"H Yenala","year":"2018","unstructured":"Yenala, H., Jhanwar, A., Chinnakotla, M.K., Goyal, J.: Deep learning for detecting inappropriate content in text. Int. J. Data Sci. Anal. 6(4), 273\u2013286 (2018)","journal-title":"Int. J. Data Sci. Anal."},{"key":"174_CR35","unstructured":"Zhang, L., Mahdavi, M., Jin, R., Yang, T., Zhu, S.: Recovering the optimal solution by dual random projection. In: Proceedings of the 26th Annual Conference on Learning Theory, pp. 135\u2013157 (2013)"},{"key":"174_CR36","unstructured":"Zhang, L., Yang, T., Jin, R., Xiao, Y., Zhou, Z.H.: Online stochastic linear optimization under one-bit feedback. In: Proceedings of the 33rd International Conference on Machine Learning, pp. 392\u2013401 (2016)"},{"key":"174_CR37","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Proceedings of the 20th International Conference on Machine Learning, pp. 928\u2013936 (2003)"}],"container-title":["International Journal of Data Science and Analytics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s41060-019-00174-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-019-00174-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s41060-019-00174-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T22:12:25Z","timestamp":1587334345000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s41060-019-00174-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,1,24]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["174"],"URL":"https:\/\/doi.org\/10.1007\/s41060-019-00174-4","relation":{},"ISSN":["2364-415X","2364-4168"],"issn-type":[{"value":"2364-415X","type":"print"},{"value":"2364-4168","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,1,24]]},"assertion":[{"value":"27 November 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"14 January 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 January 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}