683 search results - page 73 / 137 » Generalization Bounds for Learning Kernels |
118
click to vote
COLT
2004
Springer
15 years 9 months ago
2004
Springer
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
125
click to vote
ICML
2004
IEEE
16 years 4 months ago
2004
IEEE
We present an algorithmic framework for supervised classification learning where the set of labels is organized in a predefined hierarchical structure. This structure is encoded b...
140
click to vote
ICVS
2003
Springer
15 years 9 months ago
2003
Springer
We propose a method to construct computer vision systems using a workbench composed of a multi-faceted toolbox and a general purpose kernel. The toolbox is composed of an open set ...
128
click to vote
JMLR
2002
15 years 3 months ago
2002
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
137
click to vote
SIAMCOMP
2000
15 years 3 months ago
2000
Abstract. We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and parti...