1683 search results - page 16 / 337 » Learning with Mixtures of Trees |
SETN
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. This paper elaborates on an efficient approach for clustering discrete data by incrementally building multinomial mixture models through likelihood maximization using the...
UAI
1998
13 years 9 months ago
1998
We describe computationally efficient methods for learning mixtures in which each component is a directed acyclic graphical model (mixtures of DAGs or MDAGs). We argue that simple...
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of learning mixtures of arbitrary symmetric distributions. We formulate sufficient separation conditions and present a learning algorithm with provable gua...
ICML
2003
IEEE
14 years 8 months ago
2003
IEEE
We present a new approach to estimating mixture models based on a new inference principle we have proposed: the latent maximum entropy principle (LME). LME is different both from ...
FLAIRS
2007
13 years 10 months ago
2007
Problem solvers, both human and machine, have at their disposal many heuristics that may support effective search. The efficacy of these heuristics, however, varies with the probl...