4903 search results - page 242 / 981 » The Set Covering Machine |
153
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
A hypermap is (hypervertex-) bipartite if its hypervertices can be 2-coloured in such a way that “neighbouring” hypervertices have different colours. It is bipartiteuniform i...
156
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We consider support vector machines for binary classification. As opposed to most approaches we use the number of support vectors (the "L0 norm") as a regularizing term ...
168
click to vote
ICML
2009
IEEE
16 years 1 months ago
2009
IEEE
The maximum margin clustering approach is a recently proposed extension of the concept of support vector machines to the clustering problem. Briefly stated, it aims at finding a...
172
click to vote
ICML
2006
IEEE
16 years 7 months ago
2006
IEEE
We show that several important Bayesian bounds studied in machine learning, both in the batch as well as the online setting, arise by an application of a simple compression lemma....
172
click to vote
IDA
2005
Springer
15 years 11 months ago
2005
Springer
Inducing a classification function from a set of examples in the form of labeled instances is a standard problem in supervised machine learning. In this paper, we are concerned w...