Mélanges sous-quadratiques d'arbres de Markov pour l'estimation de la densité de probabilité

Explore this paper's citation graph

Summary

Mixtures of tree structured posed heuristics whose complexity is sub-quadratic outperform other random linear methods and approache the quadratic baseline method when the number of mixture components grows.

Type
preprint
Published
2010-05-01
Cited by
1
References
10
Access
Open access

Keywords

Mathematics, Humanities, Philosophy

References

Cited by

Related papers