{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,19]],"date-time":"2025-10-19T06:04:52Z","timestamp":1760853892897,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662493892"},{"type":"electronic","value":"9783662493908"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-49390-8_64","type":"book-chapter","created":{"date-parts":[[2016,3,7]],"date-time":"2016-03-07T18:17:15Z","timestamp":1457374635000},"page":"661-670","source":"Crossref","is-referenced-by-count":2,"title":["Online DC Optimization for Online Binary Linear Classification"],"prefix":"10.1007","author":[{"given":"Ho Vinh","family":"Thanh","sequence":"first","affiliation":[]},{"given":"Le Thi Hoai","family":"An","sequence":"additional","affiliation":[]},{"given":"Bui Dinh","family":"Chien","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"64_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K Azoury","year":"2001","unstructured":"Azoury, K., Warmuth, M.: Relative loss bounds for on-line density estimation with the exponential family of distributions. Mach. Learn. 43(3), 211\u2013246 (2001). http:\/\/dx.doi.org\/10.1023\/A3A1010896012157","journal-title":"Mach. Learn."},{"key":"64_CR2","first-page":"951","volume":"3","author":"K Crammer","year":"2003","unstructured":"Crammer, K., Singer, Y.: Ultraconservative online algorithms for multiclass problems. J. Mach. Learn. Res. 3, 951\u2013991 (2003). http:\/\/dx.doi.org\/10.1162\/jmlr.2003.3.4-5.951","journal-title":"J. Mach. Learn. Res."},{"key":"64_CR3","first-page":"213","volume":"2","author":"C Gentile","year":"2002","unstructured":"Gentile, C.: A new approximate maximal margin classification algorithm. J. Mach. Learn. Res. 2, 213\u2013242 (2002). http:\/\/dl.acm.org\/citation.cfm?id=944790.944811","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"64_CR4","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1023\/A:1026319107706","volume":"53","author":"C Gentile","year":"2003","unstructured":"Gentile, C.: The robustness of the p-norm algorithms. Mach. Learn. 53(3), 265\u2013299 (2003). http:\/\/dx.doi.org\/10.1023\/A:1026319107706","journal-title":"Mach. Learn."},{"issue":"1","key":"64_CR5","first-page":"495","volume":"15","author":"SCH Hoi","year":"2014","unstructured":"Hoi, S.C.H., Wang, J., Zhao, P.: Libol: a library for online learning algorithms. J. Mach. Learn. Res. 15(1), 495\u2013499 (2014). http:\/\/dl.acm.org\/citation.cfm?id=2627435.2627450","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"64_CR6","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/j.jcss.2004.10.016","volume":"71","author":"A Kalai","year":"2005","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. J. Comput. Syst. Sci. 71(3), 291\u2013307 (2005). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0022000004001394","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"64_CR7","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1017938623079","volume":"45","author":"J Kivinen","year":"2001","unstructured":"Kivinen, J., Warmuth, M.: Relative loss bounds for multidimensional regression problems. Mach. Learn. 45(3), 301\u2013329 (2001). http:\/\/dx.doi.org\/10.1023\/A:1017938623079","journal-title":"Mach. Learn."},{"issue":"1","key":"64_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J Kivinen","year":"1997","unstructured":"Kivinen, J., Warmuth, M.K.: Exponentiated gradient versus gradient descent for linear predictors. Inf. Comput. 132(1), 1\u201363 (1997). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0890540196926127","journal-title":"Inf. Comput."},{"key":"64_CR9","unstructured":"Le Thi, H.A.: DC programming and DCA (2012). http:\/\/www.lita.univ-lorraine.fr\/~lethi"},{"key":"64_CR10","unstructured":"Le Thi, H.A., Ho, V.T.: Online DC programming and DCA. LITA, Technical report, University of Lorraine, Metz, France (2015)"},{"issue":"1\u20134","key":"64_CR11","first-page":"23","volume":"133","author":"HA Le Thi","year":"2005","unstructured":"Le Thi, H.A., Pham Dinh, T.: The DC (difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems. Ann. Oper. Res. 133(1\u20134), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1\u20133","key":"64_CR12","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1023\/A:1012435301888","volume":"46","author":"Y Li","year":"2002","unstructured":"Li, Y., Long, P.: The relaxed online maximum margin algorithm. Mach. Learn. 46(1\u20133), 361\u2013387 (2002). http:\/\/dx.doi.org\/10.1023\/A:1012435301888","journal-title":"Mach. Learn."},{"key":"64_CR13","first-page":"615","volume":"12","author":"AB Novikoff","year":"1963","unstructured":"Novikoff, A.B.: On convergence proofs for perceptrons. Proc. Symp. Math. Theor. Automata 12, 615\u2013622 (1963). http:\/\/citeseer.comp.nus.edu.sg\/context\/494822\/0","journal-title":"Proc. Symp. Math. Theor. Automata"},{"issue":"1","key":"64_CR14","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to d.c. programming: theory, algorithms and applications. Acta Mathematica Vietnamica 22(1), 289\u2013355 (1997)","journal-title":"Acta Mathematica Vietnamica"},{"issue":"2","key":"64_CR15","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1137\/S1052623494274313","volume":"8","author":"T Pham Dinh","year":"1998","unstructured":"Pham Dinh, T., Le Thi, H.A.: DC optimization algorithms for solving the trust region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"issue":"6","key":"64_CR16","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1037\/h0042519","volume":"65","author":"F Rosenblatt","year":"1958","unstructured":"Rosenblatt, F.: The perceptron: a probabilistic model for information storage and organization in the brain. Psychol. Rev. 65(6), 386\u2013408 (1958)","journal-title":"Psychol. Rev."},{"key":"64_CR17","unstructured":"Shalev-Shwartz, S.: Online learning: theory, algorithms, and applications. Ph.D. thesis, The Hebrew University of Jerusalem (2007)"},{"issue":"2\u20133","key":"64_CR18","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10994-007-5014-x","volume":"69","author":"S Shalev-Shwartz","year":"2007","unstructured":"Shalev-Shwartz, S., Singer, Y.: A primal-dual perspective of online learning algorithms. Mach. Learn. 69(2\u20133), 115\u2013142 (2007). http:\/\/dx.doi.org\/10.1007\/s10994-007-5014-x","journal-title":"Mach. Learn."},{"key":"64_CR19","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-642-70911-1_20","volume-title":"Brain Theory","author":"C Van Der Malsburg","year":"1986","unstructured":"Van Der Malsburg, C.: Frank rosenblatt: principles of neurodynamics: perceptrons and the theory of brain mechanisms. In: Palm, G., Aertsen, A. (eds.) Brain Theory, pp. 245\u2013248. Springer, Heidelberg (1986). http:\/\/dx.doi.org\/10.1007\/978-3-642-70911-1_20"},{"key":"64_CR20","unstructured":"Zinkevich, M.: Online convex programming and generalized infinitesimal gradient ascent. In: Fawcett, T., Mishra, N. (eds.) Proceedings of the 20th International Conference on Machine Learning (ICML-03), pp. 928\u2013936 (2003). http:\/\/www.aaai.org\/Papers\/ICML\/2003\/ICML03-120.pdf"}],"container-title":["Lecture Notes in Computer Science","Intelligent Information and Database Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49390-8_64","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,7,12]],"date-time":"2024-07-12T13:00:09Z","timestamp":1720789209000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-662-49390-8_64"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662493892","9783662493908"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49390-8_64","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}