Finding a Path is Harder than Finding a Tree

Details Finding a Path is Harder than Finding a Tree Finding a Path is Harder than Finding a Tree

2011-06-09

arxiv.org/abs/1106.1799v1

Journal Of Artificial Intelligence Research, Volume 15, pages 383-389, 2001

Computer Science

Artificial Intelligence

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Finding a Path is Harder than Finding a Tree does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Finding a Path is Harder than Finding a Tree, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finding a Path is Harder than Finding a Tree will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-580266