Sciweavers

1419 search results - page 270 / 284
» Approximation Methods for Supervised Learning
Sort
View
JMLR
2008
209views more  JMLR 2008»
13 years 8 months ago
Bayesian Inference and Optimal Design for the Sparse Linear Model
The linear model with sparsity-favouring prior on the coefficients has important applications in many different domains. In machine learning, most methods to date search for maxim...
Matthias W. Seeger
NCA
2006
IEEE
13 years 8 months ago
Evolutionary training of hardware realizable multilayer perceptrons
The use of multilayer perceptrons (MLP) with threshold functions (binary step function activations) greatly reduces the complexity of the hardware implementation of neural networks...
Vassilis P. Plagianakos, George D. Magoulas, Micha...
IJCV
2007
115views more  IJCV 2007»
13 years 8 months ago
Discovering Shape Classes using Tree Edit-Distance and Pairwise Clustering
This paper describes work aimed at the unsupervised learning of shape-classes from shock trees. We commence by considering how to compute the edit distance between weighted trees. ...
Andrea Torsello, Antonio Robles-Kelly, Edwin R. Ha...
TEC
2008
135views more  TEC 2008»
13 years 8 months ago
Evolving Output Codes for Multiclass Problems
In this paper, we propose an evolutionary approach to the design of output codes for multiclass pattern recognition problems. This approach has the advantage of taking into account...
Nicolás García-Pedrajas, Colin Fyfe
JAIR
2010
145views more  JAIR 2010»
13 years 7 months ago
Planning with Noisy Probabilistic Relational Rules
Noisy probabilistic relational rules are a promising world model representation for several reasons. They are compact and generalize over world instantiations. They are usually in...
Tobias Lang, Marc Toussaint