Abstract
In this work a polynomial-time reduction to the NP-complete subset sum problem is followed in order to prove the complexity of Multiple Kernel Support Vector Machine decision problem. The Lagrangian function of the standard Support Vector Machine in its dual form was considered to derive the proof. Results of this derivation allow researchers to properly justify the use of approximate methods, such as heuristics and metaheuristics, when working with multiple kernel learning algorithms.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Boolchandani, D., Sahula, V.: Exploring Efficient Kernel Functions for Support Vector Machines Based Feasibility Models for Analog Circuits. International Journal on Design, Analysis and Tools for Circuits and Systems, 1–8 (2011)
Diosan, L., Rogozan, A., Pecuchet, J.: Learning SVM with complex multiple kernels evolved by genetic programming. International Journal on Artificial Intelligence Tools 19, 647–677 (2010)
Essam, A.D., Hamza, T.: New empirical nonparametric kernels for support vector machines classification. Applied Soft Computing 13, 1759–1765 (2013)
Fan, R.-E., Chen, P.-H., Lin, C.-J.: Working Set Selection Using Second Order Information for Training Support Vector Machines. Journal of Machine Learning Research, 1889–1918 (2005)
Garey, M., Johnson, D.: Computers and Intractability a guide to the theory of NP-Completeness. Freeman and Company, New York (1979)
Gönen, M., Alpaydin, E.: Multiple Kernel Learning Algorithms. Journal of Machine Learning Research, 2211–2268 (2011)
Koch, P., Bischl, B., Flasch, O., Bartz-Beielstein, T., Weihs, C., Konen, W.: Tuning and Evolution of Least-Squares Support Vector Machines. Evolutionary Intelligence, 1–30 (2011)
Shawe-Taylor, J., Sun, S.: A review of optimization methodologies in support vector machines. Neurocomputing, 3609–3618 (2011)
Shigeo, A.: Support Vector Machines for Pattern Classification. Springer, New York (2010)
Simon, H.: On the complexity of working set selection. Theoretical Computer Science, 262–279 (2007)
Tsang, I., Kwok, J., Cheung, P.-M.: Core Vector Machines: Fast SVM Training on Very Large Data Sets. Journal of Machine Learning Research, 363–392 (2005)
Vapnik, V.: Statistical Learning Theory. John Wiley and Sons, New York (1998)
Vavasis, S.A.: Complexity issues in global optimization: a survey. In: Horst, R., Pardalos, P. (eds.) Handbook of Global Optimization, pp. 27–41. Springer (1995)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Padierna, L.C., Carpio, J.M., del Rosario Baltazar, M., Puga, H.J., Fraire, H.J. (2014). Multiple Kernel Support Vector Machine Problem Is NP-Complete. In: Gelbukh, A., Espinoza, F.C., Galicia-Haro, S.N. (eds) Nature-Inspired Computation and Machine Learning. MICAI 2014. Lecture Notes in Computer Science(), vol 8857. Springer, Cham. https://doi.org/10.1007/978-3-319-13650-9_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-13650-9_14
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13649-3
Online ISBN: 978-3-319-13650-9
eBook Packages: Computer ScienceComputer Science (R0)