{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:15:32Z","timestamp":1767183332572,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031160134"},{"type":"electronic","value":"9783031160141"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-16014-1_27","type":"book-chapter","created":{"date-parts":[[2022,9,20]],"date-time":"2022-09-20T23:03:09Z","timestamp":1663714989000},"page":"334-347","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Block Coordinate DCA Approach for\u00a0Large-Scale Kernel SVM"],"prefix":"10.1007","author":[{"given":"Van Tuan","family":"Pham","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hoang Phuc Hau","family":"Luu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2239-2100","authenticated-orcid":false,"given":"Hoai An","family":"Le Thi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,9,21]]},"reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I.M., Vapnik, V.N.: A training algorithm for optimal margin classifiers. In: Proceedings of COLT 1992, pp. 144\u2013152 (1992)","DOI":"10.1145\/130385.130401"},{"issue":"3","key":"27_CR2","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. (TIST) 2(3), 1\u201327 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol. (TIST)"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Chou, H.Y., Lin, P.Y., Lin, C.J.: Dual coordinate-descent methods for linear one-class SVM and SVDD. In: Proceedings SIAM International Conference Data Mining, pp. 181\u2013189. SIAM (2020)","DOI":"10.1137\/1.9781611976236.21"},{"issue":"3","key":"27_CR4","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/BF00994018","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., Vapnik, V.: Support-vector networks. Mach. Learn. 20(3), 273\u2013297 (1995)","journal-title":"Mach. Learn."},{"key":"27_CR5","doi-asserted-by":"crossref","unstructured":"Hsieh, C.J., Chang, K.W., Lin, C.J., Keerthi, S.S., Sundararajan, S.: A dual coordinate descent method for large-scale linear SVM. In: Proceedings of the 25th International Conference on Machine Learning, pp. 408\u2013415 (2008)","DOI":"10.1145\/1390156.1390208"},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.neucom.2014.11.051","volume":"153","author":"HM Le","year":"2015","unstructured":"Le, H.M., Le Thi, H.A., Nguyen, M.C.: Sparse semi-supervised support vector machines by dc programming and DCA. Neurocomputing 153, 62\u201376 (2015)","journal-title":"Neurocomputing"},{"issue":"3","key":"27_CR7","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1007\/s11634-008-0030-7","volume":"2","author":"HA Le Thi","year":"2008","unstructured":"Le Thi, H.A., Le, H.M., Nguyen, V.V., Pham Dinh, T.: A dc programming approach for feature selection in support vector machines learning. Adv. Data Anal. Classif. 2(3), 259\u2013278 (2008). https:\/\/doi.org\/10.1007\/s11634-008-0030-7","journal-title":"Adv. Data Anal. Classif."},{"issue":"1","key":"27_CR8","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/s10994-014-5455-y","volume":"101","author":"HA Le Thi","year":"2015","unstructured":"Le Thi, H.A., Le, H.M., Pham Dinh, T.: Feature selection in machine learning: an exact penalty approach using a difference of convex function algorithm. Mach. Learn. 101(1), 163\u2013186 (2015)","journal-title":"Mach. Learn."},{"issue":"1","key":"27_CR9","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), 23\u201346 (2005)","journal-title":"Ann. Oper. Res."},{"issue":"1","key":"27_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10107-018-1235-y","volume":"169","author":"HA Le Thi","year":"2018","unstructured":"Le Thi, H.A., Pham Dinh, T.: DC programming and DCA: thirty years of developments. Math. Program. 169(1), 5\u201368 (2018)","journal-title":"Math. Program."},{"key":"27_CR11","unstructured":"Lee, C.P., Roth, D.: Distributed box-constrained quadratic optimization for dual linear SVM. In: ICML, pp. 987\u2013996. PMLR (2015)"},{"issue":"3","key":"27_CR12","doi-asserted-by":"publisher","first-page":"1246","DOI":"10.1093\/imanum\/dry040","volume":"39","author":"CP Lee","year":"2019","unstructured":"Lee, C.P., Wright, S.J.: Random permutations fix a worst case for cyclic coordinate descent. IMA J. Numer. Anal. 39(3), 1246\u20131275 (2019)","journal-title":"IMA J. Numer. Anal."},{"key":"27_CR13","doi-asserted-by":"publisher","unstructured":"Lu, Z., Xiao, L.: On the complexity analysis of randomized block-coordinate descent methods. Math. Program. 152, 615\u2013642 (2014). https:\/\/doi.org\/10.1007\/s10107-014-0800-2","DOI":"10.1007\/s10107-014-0800-2"},{"key":"27_CR14","unstructured":"Nutini, J., Laradji, I., Schmidt, M.: Let\u2019s make block coordinate descent go fast: faster greedy rules, message-passing, active-set complexity, and superlinear convergence. arXiv preprint arXiv:1712.08859 (2017)"},{"issue":"1","key":"27_CR15","first-page":"289","volume":"22","author":"T Pham Dinh","year":"1997","unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: theory, algorithms and applications. Acta Math. Vietnam 22(1), 289\u2013355 (1997)","journal-title":"Acta Math. Vietnam"},{"issue":"2","key":"27_CR16","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.: A DC optimization algorithm for solving the trust-region subproblem. SIAM J. Optim. 8(2), 476\u2013505 (1998)","journal-title":"SIAM J. Optim."},{"key":"27_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-54455-2_1","volume-title":"Transactions on Computational Intelligence XIII","author":"T Pham Dinh","year":"2014","unstructured":"Pham Dinh, T., Le Thi, H.A.: Recent advances in DC programming and DCA. In: Nguyen, N.T., Le-Thi, H.A. (eds.) Transactions on Computational Intelligence XIII. LNCS, vol. 8342, pp. 1\u201337. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54455-2_1"},{"key":"27_CR18","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/j.neunet.2019.05.011","volume":"118","author":"DN Phan","year":"2019","unstructured":"Phan, D.N., Le Thi, H.A.: Group variable selection via lp,0 regularization and application to optimal scoring. Neural Netw. 118, 220\u2013234 (2019)","journal-title":"Neural Netw."},{"issue":"2","key":"27_CR19","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":"27_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-44581-1_27","volume-title":"Computational Learning Theory","author":"B Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Herbrich, R., Smola, A.J.: A generalized representer theorem. In: Helmbold, D., Williamson, B. (eds.) COLT 2001. LNCS (LNAI), vol. 2111, pp. 416\u2013426. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44581-1_27"},{"key":"27_CR21","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz, S., Ben-David, S.: Understanding machine learning: from theory to algorithms. Cambridge University Press (2014)","DOI":"10.1017\/CBO9781107298019"},{"key":"27_CR22","doi-asserted-by":"publisher","unstructured":"Vapnik, V.: The Nature of Statistical Learning Theory. Springer Science & Business Media. Springer, New York (1999).https:\/\/doi.org\/10.1007\/978-1-4757-3264-1","DOI":"10.1007\/978-1-4757-3264-1"},{"issue":"1","key":"27_CR23","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/s10994-013-5373-4","volume":"92","author":"Z Zhao","year":"2013","unstructured":"Zhao, Z., Zhang, R., Cox, J., Duling, D., Sarle, W.: Massively parallel feature selection: an approach based on variance preservation. Mach. Learn. 92(1), 195\u2013220 (2013). https:\/\/doi.org\/10.1007\/s10994-013-5373-4","journal-title":"Mach. Learn."},{"key":"27_CR24","doi-asserted-by":"publisher","unstructured":"Zhou, S., Zhou, W.: Unified SVM algorithm based on LS-DC loss. Mach. Learn. 1\u201328 (2021). https:\/\/doi.org\/10.1007\/s10994-021-05996-7","DOI":"10.1007\/s10994-021-05996-7"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-16014-1_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,9]],"date-time":"2023-03-09T12:08:13Z","timestamp":1678363693000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-16014-1_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031160134","9783031160141"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-16014-1_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"21 September 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}