876 search results - page 76 / 176 » On a theory of learning with similarity functions |
ILP
2004
Springer
15 years 5 months ago
2004
Springer
Random forest induction is a bagging method that randomly samples the feature set at each node in a decision tree. In propositional learning, the method has been shown to work well...
ITICSE
2005
ACM
15 years 5 months ago
2005
ACM
Traditional teaching methods have acknowledged limitations. Lectures may be used to transmit information efficiently, but often fail to motivate students to engage with the subjec...
ALT
2004
Springer
15 years 8 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
JMLR
2002
14 years 11 months ago
2002
A fundamental open problem in computational learning theory is whether there is an attribute efficient learning algorithm for the concept class of decision lists (Rivest, 1987; Bl...
79
Voted
JMLR
2010
14 years 6 months ago
2010
Many real world applications employ multivariate performance measures and each example can belong to multiple classes. The currently most popular approaches train an SVM for each ...