3250 search results - page 329 / 650 » Parameterized Learning Complexity |
165
click to vote
ICML
2007
IEEE
16 years 5 months ago
2007
IEEE
A general framework is proposed for gradient boosting in supervised learning problems where the loss function is defined using a kernel over the output space. It extends boosting ...
130
click to vote
ICALT
2008
IEEE
15 years 11 months ago
2008
IEEE
Collaboration has long been considered an effective approach to learning. However, forming optimal groups can be a time consuming and complex task. Different approaches have been ...
139
click to vote
IJCNN
2007
IEEE
15 years 11 months ago
2007
IEEE
—The 0/1 loss is an important cost function for perceptrons. Nevertheless it cannot be easily minimized by most existing perceptron learning algorithms. In this paper, we propose...
142
click to vote
ISNN
2007
Springer
15 years 11 months ago
2007
Springer
Normal fuzzy CMAC neural network performs well because of its fast learning speed and local generalization capability for approximating nonlinear functions. However, it requires hu...
145
click to vote
GECCO
2005
Springer
15 years 10 months ago
2005
Springer
XCS is a stochastic algorithm, so it does not guarantee to produce the same results when run with the same input. When interpretability matters, obtaining a single, stable result ...