Sciweavers

1199 search results - page 12 / 240
» Robust inference of trees
Sort
View
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 10 months ago
Why neighbor-joining works
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
Radu Mihaescu, Dan Levy, Lior Pachter
NAACL
2010
13 years 7 months ago
Unsupervised Syntactic Alignment with Inversion Transduction Grammars
Syntactic machine translation systems currently use word alignments to infer syntactic correspondences between the source and target languages. Instead, we propose an unsupervised...
Adam Pauls, Dan Klein, David Chiang, Kevin Knight
JCB
2006
67views more  JCB 2006»
13 years 10 months ago
The Identifiability of Tree Topology for Phylogenetic Models, Including Covarion and Mixture Models
For a model of molecular evolution to be useful for phylogenetic inference, the topology of evolutionary trees must be identifiable. That is, from a joint distribution the model p...
Elizabeth S. Allman, John A. Rhodes
ALT
2007
Springer
14 years 7 months ago
Learning Rational Stochastic Tree Languages
Abstract. We consider the problem of learning stochastic tree languages, i.e. probability distributions over a set of trees T(F), from a sample of trees independently drawn accordi...
François Denis, Amaury Habrard
ECML
2006
Springer
14 years 1 months ago
Toward Robust Real-World Inference: A New Perspective on Explanation-Based Learning
Abstract. Over the last twenty years AI has undergone a sea change. The oncedominant paradigm of logical inference over symbolic knowledge representations has largely been supplant...
Gerald DeJong