384 search results - page 24 / 77 » Learning Markov Network Structure with Decision Trees |
AAAI
1996
1996
Computing Optimal Policies for Partially Observable Decision Processes Using Compact Representations
13 years 10 months ago
: Partially-observable Markov decision processes provide a very general model for decision-theoretic planning problems, allowing the trade-offs between various courses of actions t...
ICML
2004
IEEE
14 years 9 months ago
2004
IEEE
We introduce a framework, which we call Divide-by-2 (DB2), for extending support vector machines (SVM) to multi-class problems. DB2 offers an alternative to the standard one-again...
ICPR
2002
IEEE
14 years 10 months ago
2002
IEEE
This paper introduces an approach for handling complex labelling problems driven by local constraints. The purpose is illustrated by two applications: detection of the road networ...
JIIS
2000
13 years 8 months ago
2000
Abstract. A paper document processing system is an information system component which transforms information on printed or handwritten documents into a computer-revisable form. In ...
JMLR
2008
13 years 8 months ago
2008
Log-linear and maximum-margin models are two commonly-used methods in supervised machine learning, and are frequently used in structured prediction problems. Efficient learning of...