C. Meek (2001) "Finding a Path is Harder than Finding a Tree", Volume 15, pages 383-389

PDF | PostScript | doi:10.1613/jair.914

I consider the problem of learning an optimal path graphical model from data and show the problem to be NP-hard for the maximum likelihood and minimum description length approaches and a Bayesian approach. This hardness result holds despite the fact that the problem is a restriction of the polynomially solvable problem of finding the optimal tree graphical model.

Click here to return to Volume 15 contents list