3643 search results - page 439 / 729 » Learning Submodular Functions |
158
click to vote
STOC
2003
ACM
16 years 7 months ago
2003
ACM
Boosting algorithms are procedures that "boost" low-accuracy weak learning algorithms to achieve arbitrarily high accuracy. Over the past decade boosting has been widely...
185
click to vote
ALT
2004
Springer
16 years 3 months ago
2004
Springer
A revision algorithm is a learning algorithm that identifies the target concept, starting from an initial concept. Such an algorithm is considered efficient if its complexity (in ...
177
click to vote
GECCO
2007
Springer
16 years 26 days ago
2007
Springer
Genetic Programming uses trees to represent chromosomes. The user defines the representation space by defining the set of functions and terminals to label the nodes in the trees. ...
185
click to vote
ICPR
2010
IEEE
16 years 11 days ago
2010
IEEE
—Randomized learning methods (i.e., Forests or Ferns) have shown excellent capabilities for various computer vision applications. However, it was shown that the tree structure in...
212
click to vote
ISCIS
2005
Springer
16 years 6 days ago
2005
Springer
Support Vector Machines (SVMs) have been applied to solve the classification of volatile organic compounds (VOC) data in some recent studies. SVMs provide good generalization perfo...