A nested heuristic for parameter tuning in support vector machines

DOI10.1016/j.cor.2013.10.002zbMath1349.62260OpenAlexW2088134541MaRDI QIDQ336941

Belén Martín-Barragán, Dolores Romero Morales, Emilio Carrizosa

Publication date: 10 November 2016

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://www.pure.ed.ac.uk/ws/files/14237525/A_nested_heuristic_for_parameter_tuning_in_Support_Vector.pdf

zbMATH Keywords

variable neighborhood searchsupport vector machinessupervised classificationparameter tuningmultiple kernel learningnested heuristic

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Approximation methods and heuristics in mathematical programming (90C59)

Related Items

Individual-level social influence identification in social media: a learning-simulation coordinated method ⋮ Global optimization issues in deep network regression: an overview ⋮ Efficient optimization of hyper-parameters for least squares support vector regression ⋮ Selection of time instants and intervals with support vector regression for multivariate functional data ⋮ Support vector machine with Dirichlet feature mapping ⋮ Comparing two SVM models through different metrics based on the confusion matrix ⋮ Functional-bandwidth kernel for support vector machine with functional data: an alternating optimization algorithm ⋮ Heuristic approaches for support vector machines with the ramp loss ⋮ Optimization approaches to supervised classification ⋮ Variable selection in classification for multivariate functional data ⋮ Global resolution of the support vector machine regression parameters selection problem with LPCC

Uses Software

• GLOB
• SHOGUN
• SVMlight
• LIBSVM

Cites Work

• Supervised classification and mathematical optimization
• A function to test methods applied to global minimization of potential energy of molecules
• Solving molecular distance geometry problems by global optimization algorithms
• Kernel methods in machine learning
• General variable neighborhood search for the continuous optimization
• Choosing the kernel parameters for support vector machines by the inter-cluster distance in the feature space
• Support vector machine classification with indefinite kernels
• Variable neighborhood search
• Solving spread spectrum radar polyphase code design problem by tabu search and variable neighbourhood search.
• Efficient algorithms for large scale global optimization: Lennard-Jones clusters
• Gaussian variable neighborhood search for continuous optimization
• Methods for the combination of kernel matrices within a support vector framework
• A continuous variable neighborhood search heuristic for finding the three-dimensional structure of a molecule
• 10.1162/15324430152733142
• Support Vector Machines with the Ramp Loss and the Hard Margin Loss
• Asymptotic Behaviors of Support Vector Machines with Gaussian Kernel
• Soft margins for AdaBoost
• Variable neighborhood search: Principles and applications
• Choosing multiple parameters for support vector machines
• Fast global optimization of difficult Lennard-Jones clusters
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item