Sciweavers

1017 search results - page 111 / 204
» Constructive and collaborative learning of algorithms
Sort
View
COLT
2007
Springer
14 years 3 months ago
Occam's Hammer
Abstract. We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or mo...
Gilles Blanchard, François Fleuret
NIME
2004
Springer
122views Music» more  NIME 2004»
14 years 2 months ago
Digital Instruments and Players: Part I - Efficiency and Apprenticeship
When envisaging new digital instruments, designers do not have to limit themselves to their sonic capabilities (which can be absolutely any), not even to their algorithmic power; ...
Sergi Jordà
IJAR
2008
119views more  IJAR 2008»
13 years 9 months ago
Adapting Bayes network structures to non-stationary domains
When an incremental structural learning method gradually modifies a Bayesian network (BN) structure to fit observations, as they are read from a database, we call the process stru...
Søren Holbech Nielsen, Thomas D. Nielsen
ALT
2007
Springer
14 years 3 months ago
On Universal Transfer Learning
In transfer learning the aim is to solve new learning tasks using fewer examples by using information gained from solving related tasks. Existing transfer learning methods have be...
M. M. Hassan Mahmud
KDD
2002
ACM
157views Data Mining» more  KDD 2002»
14 years 9 months ago
Exploiting unlabeled data in ensemble methods
An adaptive semi-supervised ensemble method, ASSEMBLE, is proposed that constructs classification ensembles based on both labeled and unlabeled data. ASSEMBLE alternates between a...
Kristin P. Bennett, Ayhan Demiriz, Richard Maclin