2090 search results - page 236 / 418 » Learning with attribute costs |
193
click to vote
NLPRS
2001
Springer
15 years 10 months ago
2001
Springer
We describe a new tagging model where the states of a hidden Markov model (HMM) estimated by unsupervised learning are incorporated as the features in a maximum entropy model. Our...
166
click to vote
IJCAI
1989
15 years 7 months ago
1989
A new decision tree learning algorithm called IDX is described. More general than existing algorithms, IDX addresses issues of decision tree quality largely overlooked in the arti...
155
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
A new procedure for learning cost-sensitive SVM classifiers is proposed. The SVM hinge loss is extended to the cost sensitive setting, and the cost-sensitive SVM is derived as the...
165
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider approximate policy evaluation for finite state and action Markov decision processes (MDP) in the off-policy learning context and with the simulation-based least square...
190
click to vote
ICML
2003
IEEE
16 years 7 months ago
2003
IEEE
Convex programming involves a convex set F Rn and a convex cost function c : F R. The goal of convex programming is to find a point in F which minimizes c. In online convex prog...