{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T12:10:48Z","timestamp":1770552648987,"version":"3.49.0"},"reference-count":68,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,12,22]],"date-time":"2015-12-22T00:00:00Z","timestamp":1450742400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2016,4]]},"DOI":"10.1007\/s10994-015-5540-x","type":"journal-article","created":{"date-parts":[[2015,12,22]],"date-time":"2015-12-22T12:28:33Z","timestamp":1450787313000},"page":"103-136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["Tikhonov, Ivanov and Morozov regularization for support vector machine learning"],"prefix":"10.1007","volume":"103","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8445-395X","authenticated-orcid":false,"given":"Luca","family":"Oneto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandro","family":"Ridella","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Davide","family":"Anguita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,12,22]]},"reference":[{"key":"5540_CR1","doi-asserted-by":"crossref","unstructured":"Anguita, D., Ghio, A., Greco, N., Oneto, L., & Ridella, S. (2010). Model selection for support vector machines: Advantages and disadvantages of the machine learning theory. In International joint conference on neural networks (pp. 1\u20138).","DOI":"10.1109\/IJCNN.2010.5596450"},{"key":"5540_CR2","unstructured":"Anguita, D., Ghio, A., Oneto, L., & Ridella, S. (2011). The impact of unlabeled patterns in rademacher complexity theory for kernel classifiers. In: Advances in neural information processing systems, (pp. 585\u2013593)."},{"key":"5540_CR3","doi-asserted-by":"crossref","unstructured":"Anguita, D., Ghio, A., Oneto, L., & Ridella, S. (2011). In-sample model selection for support vector machines. In International joint conference on neural networks (pp. 1154\u20131161).","DOI":"10.1109\/IJCNN.2011.6033354"},{"issue":"9","key":"5540_CR4","doi-asserted-by":"crossref","first-page":"1390","DOI":"10.1109\/TNNLS.2012.2202401","volume":"23","author":"D Anguita","year":"2012","unstructured":"Anguita, D., Ghio, A., Oneto, L., & Ridella, S. (2012). In-sample and out-of-sample model selection and error estimation for support vector machines. IEEE Transactions on Neural Networks and Learning Systems, 23(9), 1390\u20131406.","journal-title":"IEEE Transactions on Neural Networks and Learning Systems"},{"key":"5540_CR5","doi-asserted-by":"crossref","DOI":"10.1137\/1.9780898718539","volume-title":"Discrete mathematics of neural networks: Selected topics","author":"M Anthony","year":"2001","unstructured":"Anthony, M. (2001). Discrete mathematics of neural networks: Selected topics. Philadelphia: Society for Industrial Mathematics."},{"key":"5540_CR6","volume-title":"Theory of reproducing kernels","author":"N Aronszajn","year":"1951","unstructured":"Aronszajn, N. (1951). Theory of reproducing kernels. Cambridge: Harvard University."},{"key":"5540_CR7","unstructured":"Bach, F. R., Thibaux, R., & Jordan, M. I. (2005). Computing regularization paths for learning multiple kernels. In Advances in neural information processing systems."},{"issue":"4","key":"5540_CR8","doi-asserted-by":"crossref","first-page":"1497","DOI":"10.1214\/009053605000000282","volume":"33","author":"P Bartlett","year":"2005","unstructured":"Bartlett, P., Bousquet, O., & Mendelson, S. (2005). Local rademacher complexities. Annals of Statistics, 33(4), 1497\u20131537.","journal-title":"Annals of Statistics"},{"issue":"473","key":"5540_CR9","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1198\/016214505000000907","volume":"101","author":"P Bartlett","year":"2006","unstructured":"Bartlett, P., Jordan, M., & McAuliffe, J. (2006). Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101(473), 138\u2013156.","journal-title":"Journal of the American Statistical Association"},{"issue":"2","key":"5540_CR10","doi-asserted-by":"crossref","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"PL Bartlett","year":"1998","unstructured":"Bartlett, P. L. (1998). The sample complexity of pattern classification with neural networks: The size of the weights is more important than the size of the network. IEEE Transactions on Information Theory, 44(2), 525\u2013536.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5540_CR11","first-page":"463","volume":"3","author":"PL Bartlett","year":"2003","unstructured":"Bartlett, P. L., & Mendelson, S. (2003). Rademacher and Gaussian complexities: Risk bounds and structural results. The Journal of Machine Learning Research, 3, 463\u2013482.","journal-title":"The Journal of Machine Learning Research"},{"key":"5540_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9467-7","volume-title":"Convex analysis and monotone operator theory in Hilbert spaces","author":"HH Bauschke","year":"2011","unstructured":"Bauschke, H. H., & Combettes, P. L. (2011). Convex analysis and monotone operator theory in Hilbert spaces. New York: Springer."},{"key":"5540_CR13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-9096-9","volume-title":"Reproducing kernel Hilbert spaces in probability and statistics","author":"A Berlinet","year":"2004","unstructured":"Berlinet, A., & Thomas-Agnan, C. (2004). Reproducing kernel Hilbert spaces in probability and statistics. New York: Springer."},{"issue":"1","key":"5540_CR14","doi-asserted-by":"crossref","first-page":"108","DOI":"10.1162\/neco.1995.7.1.108","volume":"7","author":"C Bishop","year":"1995","unstructured":"Bishop, C. (1995). Training with noise is equivalent to Tikhonov regularization. Neural Computation, 7(1), 108\u2013116.","journal-title":"Neural Computation"},{"key":"5540_CR15","doi-asserted-by":"crossref","unstructured":"Bousquet, O., Boucheron, S., & Lugosi, G. (2004). Introduction to statistical learning theory. In Advanced lectures on machine learning (pp. 169\u2013207).","DOI":"10.1007\/978-3-540-28650-9_8"},{"key":"5540_CR16","first-page":"499","volume":"2","author":"O Bousquet","year":"2002","unstructured":"Bousquet, O., & Elisseeff, A. (2002). Stability and generalization. The Journal of Machine Learning Research, 2, 499\u2013526.","journal-title":"The Journal of Machine Learning Research"},{"key":"5540_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., & Vandenberghe, L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"issue":"1\u20133","key":"5540_CR18","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1013912006537","volume":"48","author":"M Collins","year":"2002","unstructured":"Collins, M., Schapire, R., & Singer, Y. (2002). Logistic regression, AdaBoost and Bregman distances. Machine Learning, 48(1\u20133), 253\u2013285.","journal-title":"Machine Learning"},{"key":"5540_CR19","unstructured":"Cortes, C., Kloft, M., & Mohri, M. (2013). Learning kernels using local Rademacher complexity. In Advances in neural information processing systems."},{"issue":"3","key":"5540_CR20","first-page":"273","volume":"20","author":"C Cortes","year":"1995","unstructured":"Cortes, C., & Vapnik, V. (1995). Support-vector networks. Machine Learning, 20(3), 273\u2013297.","journal-title":"Machine Learning"},{"key":"5540_CR21","unstructured":"Dinuzzo, F., & Sch\u00f6lkopf, B. (2012). The representer theorem for hilbert spaces: A necessary and sufficient condition. Arxiv preprint arXiv:1205.1928 ."},{"key":"5540_CR22","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/S0925-2312(02)00601-X","volume":"51","author":"K Duan","year":"2003","unstructured":"Duan, K., Keerthi, S., & Poo, A. (2003). Evaluation of simple performance measures for tuning SVM hyperparameters. Neurocomputing, 51, 41\u201359.","journal-title":"Neurocomputing"},{"key":"5540_CR23","first-page":"55","volume":"6","author":"A Elisseeff","year":"2005","unstructured":"Elisseeff, A., Evgeniou, T., & Pontil, M. (2005). Stability of randomized learning algorithms. Journal of Machine Learning Research, 6, 55\u201379.","journal-title":"Journal of Machine Learning Research"},{"issue":"1","key":"5540_CR24","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1023\/B:MACH.0000019805.88351.60","volume":"55","author":"T Evgeniou","year":"2004","unstructured":"Evgeniou, T., Pontil, M., & Elisseeff, A. (2004). Leave one out error, stability, and generalization of voting combinations of classifiers. Machine Learning, 55(1), 71\u201397.","journal-title":"Machine Learning"},{"key":"5540_CR25","first-page":"1889","volume":"6","author":"R Fan","year":"2005","unstructured":"Fan, R., Chen, P., & Lin, C. (2005). Working set selection using second order information for training support vector machines. Journal of Machine Learning Research, 6, 1889\u20131918.","journal-title":"Journal of Machine Learning Research"},{"key":"5540_CR26","doi-asserted-by":"crossref","unstructured":"Feldman, V., Guruswami, V., Raghavendra, P., & Wu, Y. (2009). Agnostic learning of monomials by halfspaces is hard. In Annual IEEE symposium on foundations of computer science (pp. 385\u2013394).","DOI":"10.1109\/FOCS.2009.26"},{"key":"5540_CR27","volume-title":"Numerical recipes in C","author":"B Flannery","year":"1992","unstructured":"Flannery, B., Press, W., Teukolsky, S., & Vetterling, W. (1992). Numerical recipes in C. New York: Press Syndicate of the University of Cambridge."},{"issue":"1","key":"5540_CR28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.18637\/jss.v033.i01","volume":"33","author":"J Friedman","year":"2010","unstructured":"Friedman, J., Hastie, T., & Tibshirani, R. (2010). Regularization paths for generalized linear models via coordinate descent. Journal of Statistical Software, 33(1), 1.","journal-title":"Journal of Statistical Software"},{"issue":"1","key":"5540_CR29","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1007\/BF01584320","volume":"13","author":"AA Goldstein","year":"1977","unstructured":"Goldstein, A. A. (1977). Optimization of Lipschitz continuous functions. Mathematical Programming, 13(1), 14\u201322.","journal-title":"Mathematical Programming"},{"key":"5540_CR30","unstructured":"Gunter, L., & Zhu, J. (2005). Computing the solution path for the regularized support vector regression. In Neural information processing systems (pp. 481\u2013488)."},{"key":"5540_CR31","first-page":"61","volume":"11","author":"I Guyon","year":"2010","unstructured":"Guyon, I., Saffari, A., Dror, G., & Cawley, G. (2010). Model selection: Beyond the Bayesian\/frequentist divide. The Journal of Machine Learning Research, 11, 61\u201387.","journal-title":"The Journal of Machine Learning Research"},{"issue":"3","key":"5540_CR32","doi-asserted-by":"crossref","first-page":"231","DOI":"10.4064\/sm-70-3-231-283","volume":"70","author":"U Haagerup","year":"1981","unstructured":"Haagerup, U. (1981). The best constants in the Khintchine inequality. Studia Mathematica, 70(3), 231\u2013283.","journal-title":"Studia Mathematica"},{"key":"5540_CR33","first-page":"1391","volume":"5","author":"T Hastie","year":"2004","unstructured":"Hastie, T., Rosset, S., Tibshirani, R., & Zhu, J. (2004). The entire regularization path for the support vector machine. The Journal of Machine Learning Research, 5, 1391\u20131415.","journal-title":"The Journal of Machine Learning Research"},{"key":"5540_CR34","unstructured":"Intel: Intel Visual Fortran Composer XE. (2012). http:\/\/software.intel.com\/en-us\/articles\/intel-compilers\/ . Accessed: 18\/07\/2012."},{"key":"5540_CR35","volume-title":"The theory of approximate methods and their application to the numerical solution of singular integral equations","author":"V Ivanov","year":"1976","unstructured":"Ivanov, V. (1976). The theory of approximate methods and their application to the numerical solution of singular integral equations. New York: Springer."},{"issue":"1","key":"5540_CR36","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1023\/A:1012431217818","volume":"46","author":"S Keerthi","year":"2002","unstructured":"Keerthi, S., & Gilbert, E. (2002). Convergence of a generalized SMO algorithm for SVM classifier design. Machine Learning, 46(1), 351\u2013360.","journal-title":"Machine Learning"},{"issue":"7","key":"5540_CR37","doi-asserted-by":"crossref","first-page":"1667","DOI":"10.1162\/089976603321891855","volume":"15","author":"S Keerthi","year":"2003","unstructured":"Keerthi, S., & Lin, C. (2003). Asymptotic behaviors of support vector machines with Gaussian kernel. Neural Computation, 15(7), 1667\u20131689.","journal-title":"Neural Computation"},{"issue":"3","key":"5540_CR38","doi-asserted-by":"crossref","first-page":"637","DOI":"10.1162\/089976601300014493","volume":"13","author":"S Keerthi","year":"2001","unstructured":"Keerthi, S., Shevade, S., Bhattacharyya, C., & Murthy, K. (2001). Improvements to Platt\u2019s SMO algorithm for SVM classifier design. Neural Computation, 13(3), 637\u2013649.","journal-title":"Neural Computation"},{"issue":"5","key":"5540_CR39","doi-asserted-by":"crossref","first-page":"1902","DOI":"10.1109\/18.930926","volume":"47","author":"V Koltchinskii","year":"2001","unstructured":"Koltchinskii, V. (2001). Rademacher penalties and structural risk minimization. IEEE Transactions on Information Theory, 47(5), 1902\u20131914.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"5540_CR40","doi-asserted-by":"crossref","first-page":"2593","DOI":"10.1214\/009053606000001019","volume":"34","author":"V Koltchinskii","year":"2006","unstructured":"Koltchinskii, V. (2006). Local rademacher complexities and oracle inequalities in risk minimization. The Annals of Statistics, 34(6), 2593\u20132656.","journal-title":"The Annals of Statistics"},{"key":"5540_CR41","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1287\/opre.14.4.699","volume":"14","author":"E Lawler","year":"1966","unstructured":"Lawler, E., & Wood, D. (1966). Branch-and-bound methods: A survey. Operations Research, 14, 699\u2013719.","journal-title":"Operations Research"},{"issue":"5","key":"5540_CR42","doi-asserted-by":"crossref","first-page":"1974","DOI":"10.1109\/18.705577","volume":"44","author":"W Lee","year":"1998","unstructured":"Lee, W., Bartlett, P., & Williamson, R. (1998). The importance of convexity in learning with squared loss. IEEE Transactions on Information Theory, 44(5), 1974\u20131980.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"5540_CR43","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1007\/BF02090479","volume":"10","author":"L Martein","year":"1987","unstructured":"Martein, L., & Schaible, S. (1987). On solving a linear program with one quadratic constraint. Decisions in Economics and Finance, 10(1), 75\u201390.","journal-title":"Decisions in Economics and Finance"},{"issue":"1","key":"5540_CR44","first-page":"148","volume":"141","author":"C McDiarmid","year":"1989","unstructured":"McDiarmid, C. (1989). On the method of bounded differences. Surveys in Combinatorics, 141(1), 148\u2013188.","journal-title":"Surveys in Combinatorics"},{"key":"5540_CR45","first-page":"759","volume":"4","author":"S Mendelson","year":"2003","unstructured":"Mendelson, S. (2003). On the performance of kernel classes. The Journal of Machine Learning Research, 4, 759\u2013771.","journal-title":"The Journal of Machine Learning Research"},{"key":"5540_CR46","unstructured":"Milenova, B., Yarmus, J., & Campos, M. (2005). SVM in oracle database 10g: Removing the barriers to widespread adoption of support vector machines. In International conference on very large data bases (pp. 1152\u20131163)."},{"key":"5540_CR47","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5280-1","volume-title":"Methods for solving incorrectly posed problems","author":"V Morozov","year":"1984","unstructured":"Morozov, V., Nashed, Z., & Aries, A. (1984). Methods for solving incorrectly posed problems. New York: Springer."},{"issue":"11","key":"5540_CR48","doi-asserted-by":"crossref","first-page":"1863","DOI":"10.1109\/TPAMI.2006.217","volume":"28","author":"S Munder","year":"2006","unstructured":"Munder, S., & Gavrila, D. (2006). An experimental study on pedestrian classification. IEEE Transactions on Pattern Analysis and Machine Intelligence, 28(11), 1863\u20131868.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5540_CR49","doi-asserted-by":"crossref","unstructured":"Oneto, L., Ghio, A., Ridella, S., & Anguita, D. (2014). Fully empirical and data-dependent stability-based bounds. IEEE Transactions on Cybernetics. doi: 10.1109\/TCYB.2014.2361857 .","DOI":"10.1109\/TCYB.2014.2361857"},{"issue":"4","key":"5540_CR50","doi-asserted-by":"crossref","first-page":"659","DOI":"10.1111\/j.1467-9868.2007.00607.x","volume":"69","author":"MY Park","year":"2007","unstructured":"Park, M. Y., & Hastie, T. (2007). L1-regularization path algorithm for generalized linear models. Journal of the Royal Statistical Society: Series B (Statistical Methodology), 69(4), 659\u2013677.","journal-title":"Journal of the Royal Statistical Society: Series B (Statistical Methodology)"},{"key":"5540_CR51","doi-asserted-by":"crossref","unstructured":"Pelckmans, K., Suykens, J., & De\u00a0Moor, B. (2004) Morozov, Ivanov and Tikhonov regularization based ls-SVMs. In Neural information processing systems (pp. 1216\u20131222).","DOI":"10.1007\/978-3-540-30499-9_189"},{"key":"5540_CR52","first-page":"1","volume":"208","author":"J Platt","year":"1998","unstructured":"Platt, J. (1998). Sequential minimal optimization: A fast algorithm for training support vector machines. Advances in Kernel Methods\u2014Support Vector Learning, 208, 1\u201321.","journal-title":"Advances in Kernel Methods\u2014Support Vector Learning"},{"key":"5540_CR53","unstructured":"Platt, J. (1999). Using analytic QP and sparseness to speed training of support vector machines. In Advances in neural information processing systems (pp. 557\u2013563)."},{"key":"5540_CR54","doi-asserted-by":"crossref","unstructured":"Poggio, T., Mukherjee, S., Rifkin, R., Rakhlin, A., & Verri, A. (2002). b. In Uncertainty in geometric computations.","DOI":"10.1007\/978-1-4615-0813-7_11"},{"issue":"6981","key":"5540_CR55","doi-asserted-by":"crossref","first-page":"419","DOI":"10.1038\/nature02341","volume":"428","author":"T Poggio","year":"2004","unstructured":"Poggio, T., Rifkin, R., Mukherjee, S., & Niyogi, P. (2004). General conditions for predictivity in learning theory. Nature, 428(6981), 419\u2013422.","journal-title":"Nature"},{"issue":"4","key":"5540_CR56","doi-asserted-by":"crossref","first-page":"955","DOI":"10.1162\/089976698300017575","volume":"10","author":"M Pontil","year":"1998","unstructured":"Pontil, M., & Verri, A. (1998). Properties of support vector machines. Neural Computation, 10(4), 955\u2013974.","journal-title":"Neural Computation"},{"key":"5540_CR57","unstructured":"Sch\u00f6lkopf, B. (2001). The kernel trick for distances. In Neural information processing systems (pp. 301\u2013307)."},{"key":"5540_CR58","doi-asserted-by":"crossref","unstructured":"Sch\u00f6lkopf, B., Herbrich, R., & Smola, A. (2001). A generalized representer theorem. In Computational learning theory (pp. 416\u2013426).","DOI":"10.1007\/3-540-44581-1_27"},{"issue":"5","key":"5540_CR59","doi-asserted-by":"crossref","first-page":"1926","DOI":"10.1109\/18.705570","volume":"44","author":"J Shawe-Taylor","year":"1998","unstructured":"Shawe-Taylor, J., Bartlett, P. L., Williamson, R. C., & Anthony, M. (1998). Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5), 1926\u20131940.","journal-title":"IEEE Transactions on Information Theory"},{"key":"5540_CR60","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel methods for pattern analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., & Cristianini, N. (2004). Kernel methods for pattern analysis. Cambridge: Cambridge University Press."},{"issue":"17","key":"5540_CR61","doi-asserted-by":"crossref","first-page":"3609","DOI":"10.1016\/j.neucom.2011.06.026","volume":"74","author":"J Shawe-Taylor","year":"2011","unstructured":"Shawe-Taylor, J., & Sun, S. (2011). A review of optimization methodologies in support vector machines. Neurocomputing, 74(17), 3609\u20133618.","journal-title":"Neurocomputing"},{"issue":"3","key":"5540_CR62","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1018628609742","volume":"9","author":"J Suykens","year":"1999","unstructured":"Suykens, J., & Vandewalle, J. (1999). Least squares support vector machine classifiers. Neural processing letters, 9(3), 293\u2013300.","journal-title":"Neural processing letters"},{"key":"5540_CR63","volume-title":"Solutions of ill-posed problems","author":"A Tikhonov","year":"1977","unstructured":"Tikhonov, A., Arsenin, V., & John, F. (1977). Solutions of ill-posed problems. Washington, DC: Winston."},{"issue":"6981","key":"5540_CR64","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1038\/428378a","volume":"428","author":"C Tomasi","year":"2004","unstructured":"Tomasi, C. (2004). Learning theory: Past performance and future results. Nature, 428(6981), 378\u2013378.","journal-title":"Nature"},{"key":"5540_CR65","volume-title":"Statistical learning theory","author":"V Vapnik","year":"1998","unstructured":"Vapnik, V. (1998). Statistical learning theory. New York: Wiley."},{"key":"5540_CR66","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3264-1","volume-title":"The nature of statistical learning theory","author":"V Vapnik","year":"2000","unstructured":"Vapnik, V. (2000). The nature of statistical learning theory. New York: Springer."},{"issue":"3","key":"5540_CR67","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1134\/S105466181003003X","volume":"20","author":"K Vorontsov","year":"2010","unstructured":"Vorontsov, K. (2010). Exact combinatorial bounds on the probability of overfitting for empirical risk minimization. Pattern Recognition and Image Analysis, 20(3), 269\u2013285.","journal-title":"Pattern Recognition and Image Analysis"},{"issue":"4","key":"5540_CR68","doi-asserted-by":"crossref","first-page":"915","DOI":"10.1162\/08997660360581958","volume":"15","author":"A Yuille","year":"2003","unstructured":"Yuille, A., & Rangarajan, A. (2003). The concave\u2013convex procedure. Neural Computation, 15(4), 915\u2013936.","journal-title":"Neural Computation"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5540-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-015-5540-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-015-5540-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,2]],"date-time":"2019-09-02T17:30:18Z","timestamp":1567445418000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-015-5540-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,12,22]]},"references-count":68,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,4]]}},"alternative-id":["5540"],"URL":"https:\/\/doi.org\/10.1007\/s10994-015-5540-x","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,12,22]]}}}