找一条路比找一棵树更难
Finding a Path is Harder than Finding a Tree
摘要：
我认为从数据中学习最优路径图形模型的问题，并显示问题是NP-难的最大似然和最小描述长度的方法和贝叶斯方法。尽管这个问题是多项式可解问题的一个限制，找到最佳的树图形模型，这个硬度的结果。
英文摘要：
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.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
