Improved smoothing for probabilistic suffix trees seen as variable order Markov chains (2002)

Cached

Download Links

by Christopher Kermorvant , Pierre Dupont
Venue:IN EUROPEAN CONFERENCE ON MACHINE LEARNING (ECML
Citations:5 - 1 self

Document Versions

Improved smoothing for probabilistic suffix trees seen as variable order Markov chains –Christopher Kermorvant, Pierre Dupont — 2002 — IN EUROPEAN CONFERENCE ON MACHINE LEARNING (ECML