4903 search results - page 76 / 981 » The Set Covering Machine |
139
click to vote
ANNPR
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Decomposition techniques are used to speed up training support vector machines but for linear programming support vector machines (LP-SVMs) direct implementation of decom...
111
Voted
ICML
2007
IEEE
16 years 3 months ago
2007
IEEE
We address feature selection problems for classification of small samples and high dimensionality. A practical example is microarray-based cancer classification problems, where sa...
175
Voted
DAM
2011
14 years 9 months ago
2011
We study various optimization problems in t-subtree graphs, the intersection graphs of tsubtrees, where a t-subtree is the union of t disjoint subtrees of some tree. This graph cl...
119
Voted
ICML
2003
IEEE
16 years 3 months ago
2003
IEEE
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
100
Voted
EDUTAINMENT
2009
Springer
15 years 9 months ago
2009
Springer
This paper addresses the issues of distributed interactions in a simulation based medial training environment, where a team of doctors, nurses and assistants are trained for handli...