{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T01:09:08Z","timestamp":1760404148039},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319240688"},{"type":"electronic","value":"9783319240695"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-24069-5_28","type":"book-chapter","created":{"date-parts":[[2015,9,9]],"date-time":"2015-09-09T05:51:11Z","timestamp":1441777871000},"page":"295-304","source":"Crossref","is-referenced-by-count":5,"title":["DC Programming and DCA for Dictionary Learning"],"prefix":"10.1007","author":[{"given":"Xuan Thanh","family":"Vo","sequence":"first","affiliation":[]},{"given":"Hoai","family":"An Le Thi","sequence":"additional","affiliation":[]},{"given":"Tao Pham","family":"Dinh","sequence":"additional","affiliation":[]},{"given":"Thi Bich Thuy","family":"Nguyen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,24]]},"reference":[{"issue":"11","key":"28_CR1","doi-asserted-by":"publisher","first-page":"4311","DOI":"10.1109\/TSP.2006.881199","volume":"54","author":"M Aharon","year":"2006","unstructured":"Aharon, M., Elad, M., Bruckstein, A.: K-SVD: An algorithm for designing of overcomplete dictionaries for sparse representation. IEEE Transactions on Signal Processing 54(11), 4311\u20134322 (2006)","journal-title":"IEEE Transactions on Signal Processing"},{"key":"28_CR2","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1137\/S1064827596304010","volume":"20","author":"S Chen","year":"1999","unstructured":"Chen, S., Donoho, D., Saunders, M.: Atomic decomposition by basis pursuit. SIAM Journal on Scientific Computing 20, 33\u201361 (1999)","journal-title":"SIAM Journal on Scientific Computing"},{"issue":"12","key":"28_CR3","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1109\/TIP.2006.881969","volume":"54","author":"M Elad","year":"2006","unstructured":"Elad, M., Aharon, M.: Image denoising via sparse and redundant representations over learned dictionaries. IEEE Trans. Image Process. 54(12), 3736\u20133745 (2006)","journal-title":"IEEE Trans. Image Process."},{"issue":"456","key":"28_CR4","doi-asserted-by":"publisher","first-page":"1348","DOI":"10.1198\/016214501753382273","volume":"96","author":"J Fan","year":"2001","unstructured":"Fan, J., Li, R.: Variable selection via nonconcave penalized likelihood and its oracle properties. J. Am. Stat. Assoc. 96(456), 1348\u20131360 (2001)","journal-title":"J. Am. Stat. Assoc."},{"key":"28_CR5","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10479-004-5022-1","volume":"133","author":"L Thi","year":"2005","unstructured":"Thi, L.: H.A. and Pham Dinh, T.: The DC (difference of convex functions) Programming and DCA revisited with DC models of real world nonconvex optimization problems. Annals of Operations Research 133, 23\u201346 (2005)","journal-title":"Annals of Operations Research"},{"unstructured":"Le Thi, H.A., Pham Dinh, T., Le, H.M., Vo, X.T.: DC approximation approaches for sparse optimization. Eur. J. Oper. Res. 244(1), 26\u201346 (2015)","key":"28_CR6"},{"key":"28_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-540-88192-6_8","volume-title":"Advanced Data Mining and Applications","author":"HA Thi Le","year":"2008","unstructured":"Le Thi, H.A., Nguyen, V.V., Ouchani, S.: Gene selection for cancer classification using DCA. In: Tang, C., Ling, C.X., Zhou, X., Cercone, N.J., Li, X. (eds.) ADMA 2008. LNCS (LNAI), vol. 5139, pp. 62\u201372. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","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 Analysis and Classification 2(3), 259\u2013278 (2008)","key":"28_CR8","DOI":"10.1007\/s11634-008-0030-7"},{"key":"28_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/978-3-642-36543-0_40","volume-title":"Intelligent Information and Database Systems","author":"HA Thi Le","year":"2013","unstructured":"Le Thi, H.A., Nguyen Thi, B.T., Le, H.M.: Sparse signal recovery by difference of convex functions algorithms. In: Selamat, A., Nguyen, N.T., Haron, H. (eds.) ACIIDS 2013, Part II. LNCS, vol. 7803, pp. 387\u2013397. Springer, Heidelberg (2013)"},{"issue":"4","key":"28_CR10","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(4), 62\u201376 (2015)","journal-title":"Neurocomputing"},{"doi-asserted-by":"crossref","unstructured":"Le Thi, H.A., Nguyen, M.C., Pham Dinh, T.: A DC programming approach for finding Communities in networks. Neural Computation 26(12), 2827\u20132854 (2014)","key":"28_CR11","DOI":"10.1162\/NECO_a_00673"},{"key":"28_CR12","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1016\/j.neunet.2014.06.011","volume":"59","author":"HA Thi Le","year":"2014","unstructured":"Le Thi, H.A., Vo, X.T., Pham Dinh, T.: Feature Selection for linear SVMs under Uncertain Data: Robust optimization based on Difference of Convex functions Algorithms. Neural Networks 59, 36\u201350 (2014)","journal-title":"Neural Networks"},{"issue":"12","key":"28_CR13","doi-asserted-by":"publisher","first-page":"3397","DOI":"10.1109\/78.258082","volume":"41","author":"S Mallat","year":"1993","unstructured":"Mallat, S., Zhang, Z.: Matching pursuits with time-frequency dictionaries. IEEE Trans. Signal Process. 41(12), 3397\u20133415 (1993)","journal-title":"IEEE Trans. Signal Process."},{"key":"28_CR14","volume-title":"A wavelet tour of signal processing","author":"S Mallat","year":"1999","unstructured":"Mallat, S.: A wavelet tour of signal processing, 2nd edn. Academic Press, New York (1999)","edition":"2"},{"key":"28_CR15","first-page":"19","volume":"11","author":"J Mairal","year":"2010","unstructured":"Mairal, J., Bach, F., Ponce, J., Sapiro, G.: Online learning for matrix factorization and sparse coding. Journal of Machine Learning Research 11, 19\u201360 (2010)","journal-title":"Journal of Machine Learning Research"},{"key":"28_CR16","doi-asserted-by":"publisher","first-page":"3311","DOI":"10.1016\/S0042-6989(97)00169-7","volume":"37","author":"BA Olshausen","year":"1997","unstructured":"Olshausen, B.A., Field, D.J.: Sparse coding with an overcomplete basis set: A strategy employed by V1? Vision Research 37, 3311\u20133325 (1997)","journal-title":"Vision Research"},{"issue":"4","key":"28_CR17","doi-asserted-by":"publisher","first-page":"830","DOI":"10.1080\/10556788.2011.652630","volume":"28","author":"CS Ong","year":"2013","unstructured":"Ong, C.S., Le Thi, H.A.: Learning sparse classifiers with difference of convex functions algorithms. Optimization Methods and Software 28(4), 830\u2013854 (2013)","journal-title":"Optimization Methods and Software"},{"unstructured":"Pati, Y.C., Rezaiifar, R., Krishnaprasad, P.S.: Orthogonal Matching Pursuit: recursive function approximation with application to wavelet decomposition. In: Asilomar Conf. on Signals, Systems and Comput., pp. 40\u201341 (1993)","key":"28_CR18"},{"issue":"2","key":"28_CR19","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/j.sigpro.2007.08.015","volume":"88","author":"D Peleg","year":"2008","unstructured":"Peleg, D., Meir, R.: A bilinear formulation for vector sparsity optimization. Signal Processing 88(2), 375\u2013389 (2008)","journal-title":"Signal Processing"},{"unstructured":"Pham Dinh, T., Le Thi, H.A.: Convex analysis approach to DC programming: Theory, algorithms and applications. Acta Math. Vietnamica 22(1), 289\u2013357 (1997)","key":"28_CR20"},{"unstructured":"Pham Dinh, T., Le Thi, H.A.: Dc optimization algorithms for solving the trust region subproblem. SIAM. J Optimization 8, 476\u2013505 (1998)","key":"28_CR21"},{"issue":"4","key":"28_CR22","doi-asserted-by":"publisher","first-page":"2121","DOI":"10.1109\/TSP.2010.2040671","volume":"58","author":"K Skretting","year":"2010","unstructured":"Skretting, K., Engan, K.: Recursive least squares dictionary learning algorithm. IEEE Transactions on Signal Processing 58(4), 2121\u20132130 (2010)","journal-title":"IEEE Transactions on Signal Processing"},{"issue":"1","key":"28_CR23","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. Journal of the Royal Statistical Society, Series B 58(1), 267\u2013288 (1996)","journal-title":"Journal of the Royal Statistical Society, Series B"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-24069-5_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,11]],"date-time":"2024-06-11T00:52:36Z","timestamp":1718067156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-24069-5_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319240688","9783319240695"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-24069-5_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}