Sciweavers

102 search results - page 15 / 21
» Suboptimal Solution Path Algorithm for Support Vector Machin...
Sort
View
GPEM
2008
128views more  GPEM 2008»
13 years 7 months ago
Coevolutionary bid-based genetic programming for problem decomposition in classification
In this work a cooperative, bid-based, model for problem decomposition is proposed with application to discrete action domains such as classification. This represents a significan...
Peter Lichodzijewski, Malcolm I. Heywood
COMPGEOM
2009
ACM
14 years 2 months ago
Coresets for polytope distance
Following recent work of Clarkson, we translate the coreset framework to the problems of finding the point closest to the origin inside a polytope, finding the shortest distance...
Bernd Gärtner, Martin Jaggi
ICAISC
2004
Springer
14 years 27 days ago
Relevance LVQ versus SVM
Abstract. The support vector machine (SVM) constitutes one of the most successful current learning algorithms with excellent classification accuracy in large real-life problems an...
Barbara Hammer, Marc Strickert, Thomas Villmann
FUIN
2011
358views Cryptology» more  FUIN 2011»
12 years 11 months ago
Unsupervised and Supervised Learning Approaches Together for Microarray Analysis
In this article, a novel concept is introduced by using both unsupervised and supervised learning. For unsupervised learning, the problem of fuzzy clustering in microarray data as ...
Indrajit Saha, Ujjwal Maulik, Sanghamitra Bandyopa...
JMLR
2006
89views more  JMLR 2006»
13 years 7 months ago
Maximum-Gain Working Set Selection for SVMs
Support vector machines are trained by solving constrained quadratic optimization problems. This is usually done with an iterative decomposition algorithm operating on a small wor...
Tobias Glasmachers, Christian Igel