Sciweavers

683 search results - page 73 / 137
» Generalization Bounds for Learning Kernels
Sort
View
COLT
2004
Springer
14 years 3 months ago
Regularization and Semi-supervised Learning on Large Graphs
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...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
ICML
2004
IEEE
14 years 10 months ago
Large margin hierarchical classification
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...
Ofer Dekel, Joseph Keshet, Yoram Singer
ICVS
2003
Springer
14 years 3 months ago
The Imalab Method for Vision Systems
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 ...
Augustin Lux
JMLR
2002
83views more  JMLR 2002»
13 years 9 months ago
On Online Learning of Decision Lists
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...
Ziv Nevo, Ran El-Yaniv
SIAMCOMP
2000
109views more  SIAMCOMP 2000»
13 years 9 months ago
Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
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...
Endre Boros, Vladimir Gurvich, Leonid Khachiyan, K...