1667 search results - page 169 / 334 » Extended clause learning |
146
click to vote
ML
2002
ACM
15 years 4 months ago
2002
ACM
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
156
Voted
ML
2010
ACM
15 years 3 months ago
2010
ACM
Abstract A dynamic programming algorithm for constructing optimal dyadic decision trees was recently introduced, analyzed, and shown to be very effective for low dimensional data ...
151
Voted
ICMLA
2009
15 years 2 months ago
2009
In structured prediction problems, outputs are not confined to binary labels; they are often complex objects such as sequences, trees, or alignments. Support Vector Machine (SVM) ...
146
Voted
ICMLA
2009
15 years 2 months ago
2009
components of a system by susceptibility to failure. In this extended abstract, we present an ongoing project to rank the underground primary feeders of Consolidated Edison Company...
130
click to vote
JMLR
2010
14 years 12 months ago
2010
In this paper, we introduce an assumption which makes it possible to extend the learning ability of discriminative model to unsupervised setting. We propose an informationtheoreti...