Now showing items 1-2 of 2
Journey to the center of the linear ordering problem
A number of local search based algorithms have been designed to escape from the local optima, such as, iterated local search or variable neighborhood search. The neighborhood chosen for the local search as well as the ...
in-depth analysis of SVM kernel learning and its components
The performance of support vector machines in non-linearly-separable classification problems strongly relies on the kernel function. Towards an automatic machine learning approach for this technique, many research outputs ...