Sciweavers

2190 search results - page 82 / 438
» Learning with the Set Covering Machine
Sort
View
ECML
2006
Springer
14 years 23 days ago
Why Is Rule Learning Optimistic and How to Correct It
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
Martin Mozina, Janez Demsar, Jure Zabkar, Ivan Bra...
JMLR
2010
169views more  JMLR 2010»
13 years 3 months ago
Factored 3-Way Restricted Boltzmann Machines For Modeling Natural Images
Deep belief nets have been successful in modeling handwritten characters, but it has proved more difficult to apply them to real images. The problem lies in the restricted Boltzma...
Marc'Aurelio Ranzato, Alex Krizhevsky, Geoffrey E....
NIPS
2007
13 years 10 months ago
Random Features for Large-Scale Kernel Machines
To accelerate the training of kernel machines, we propose to map the input data to a randomized low-dimensional feature space and then apply existing fast linear methods. The feat...
Ali Rahimi, Benjamin Recht
ICML
2005
IEEE
14 years 10 months ago
Beyond the point cloud: from transductive to semi-supervised learning
Due to its occurrence in engineering domains and implications for natural learning, the problem of utilizing unlabeled data is attracting increasing attention in machine learning....
Vikas Sindhwani, Partha Niyogi, Mikhail Belkin
ICML
2010
IEEE
13 years 10 months ago
Budgeted Nonparametric Learning from Data Streams
We consider the problem of extracting informative exemplars from a data stream. Examples of this problem include exemplarbased clustering and nonparametric inference such as Gauss...
Ryan Gomes, Andreas Krause