Variational upper bounds for probabilistic phylogenetic models

作者: Ydo Wexler , Dan Geiger

DOI: 10.1007/978-3-540-71681-5_16

关键词: Applied mathematicsMathematicsIndependence (probability theory)Face (geometry)Probabilistic logicPhylogenetic treeUpper and lower boundsCombinatoricsBayesian networkRange (mathematics)Computation

摘要: Probabilistic phylogenetic models which relax the site independence evolution assumption often face problem of infeasible likelihood computations, for example task selecting suitable parameters model. We present a new approximation method, applicable wide range probabilistic models, guarantees to upper bound true data, and apply it models. The method is complementary known variational methods that lower likelihood, uses similar optimize bounds from above below. applied our aligned DNA sequences various lengths human in region CFTR gene homologous eight mammals, found be appreciably close whenever could computed. When computing exact was not feasible, we demonstrated proximity bounds, implying tight likelihood.

参考文章(20)
Michael I Jordan, Zoubin Ghahramani, Tommi S Jaakkola, Lawrence K Saul, None, An introduction to variational methods for graphical models Machine Learning. ,vol. 37, pp. 105- 161 ,(1999) , 10.1023/A:1007665907178
Zoubin Ghahramani, Michael Jordan, None, Factorial Hidden Markov Models neural information processing systems. ,vol. 29, pp. 472- 478 ,(1995) , 10.1023/A:1007425814087
John M. Winn, Christopher M. Bishop, Structured Variational Distributions in VIBES. international conference on artificial intelligence and statistics. ,(2003)
Finn B. Jensen, Thomas Graven-Nielsen, Bayesian networks and decision graphs ,(2001)
Gregory F. Cooper, The computational complexity of probabilistic inference using bayesian belief networks Artificial Intelligence. ,vol. 42, pp. 393- 405 ,(1990) , 10.1016/0004-3702(90)90060-D
Rina Dechter, Bucket elimination: A unifying framework for reasoning Artificial Intelligence. ,vol. 113, pp. 41- 85 ,(1999) , 10.1016/S0004-3702(99)00059-4
Paul Dagum, Michael Luby, Approximating probabilistic inference in Bayesian belief networks is NP-hard Artificial Intelligence. ,vol. 60, pp. 141- 153 ,(1993) , 10.1016/0004-3702(93)90036-B
Joseph Felsenstein, Evolutionary trees from DNA sequences: A maximum likelihood approach Journal of Molecular Evolution. ,vol. 17, pp. 368- 376 ,(1981) , 10.1007/BF01734359
Lawrence Saul, Michael Jordan, None, Exploiting Tractable Substructures in Intractable Networks neural information processing systems. pp. 486- 492 ,(1995)
D. Geiger, C. Meek, Y. Wexler, A variational inference procedure allowing internal structure for overlapping clusters and deterministic constraints Journal of Artificial Intelligence Research. ,vol. 27, pp. 1- 23 ,(2006) , 10.1613/JAIR.2028