1393 search results - page 30 / 279 » Machine Learning by Function Decomposition |
AUSAI
2004
Springer
15 years 5 months ago
2004
Springer
How to assess the performance of machine learning algorithms is a problem of increasing interest and urgency as the data mining application of myriad algorithms grows. The standard...
ICML
2007
IEEE
16 years 18 days ago
2007
IEEE
Beam search is used to maintain tractability in large search spaces at the expense of completeness and optimality. We study supervised learning of linear ranking functions for con...
CEC
2007
IEEE
15 years 3 months ago
2007
IEEE
XCS with Computed Action, briefly XCSCA, is a recent extension of XCS to tackle problems involving a large number of discrete actions. In XCSCA the classifier action is computed wi...
ML
2006
ACM
14 years 11 months ago
2006
ACM
Backpropagation, similar to most learning algorithms that can form complex decision surfaces, is prone to overfitting. This work presents classification-based objective functions, ...
121
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
Sparse coding, which is the decomposition of a vector using only a few basis elements, is widely used in machine learning and image processing. The basis set, also called dictiona...