"Hidden Markov decision trees."
ftp://psyche.mit.edu/pub/jordan/hmdt.ps.Z
Their detailed description is in
"A statistical approach to decision tree modeling"
ftp://psyche.mit.edu/pub/jordan/colt94.ps.Z
-- ste
On Wed, 23 Sep 1998, Michael Mayo wrote:
> Here's a question for you all...
>
> If I have a decision tree with probabilities attached to each and
> every outcome arc and leaf nodes representing conclusions, are there
> any algorithms for inducing a bayesian network?
>
> Has anyone done any work on this? Would it be possible to induce a
> bayesian network with a single conclusion node where each value
> corresponds to a leaf node in the DT?
>
> MIke
_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/
_/ _/
_/ Stefano Monti, Intelligent Systems Program, University of Pittsburgh _/
_/ _/
_/ 901M CL, Pittsburgh, PA - 15260 _/
_/ http://www.isp.pitt.edu/~smonti phone: (412) 624-8563 _/
_/ smonti@isp.pitt.edu fax: (412) 624-6089 _/
_/ _/
_/ Non c'è nulla di meno filosofico che volere savia e filosofica tutta _/
_/ la vita." -- Giacomo Leopardi _/
_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/_/