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

Documents Related by Co-Citation

56 On prediction using variable order Markov models – - 2004
160 A universal data compression system – - 1983
172 The Power of Amnesia: Learning Probabilistic Automata with Variable Memory Length – - 1996
169 On structuring probabilistic dependences in stochastic language modeling – - 1994
2146 The PageRank Citation Ranking: Bringing Order to the Web – - 1999
666 Estimation of probabilities from sparse data for the language model component of a speech recognizer – - 1987
857 An Empirical Study of Smoothing Techniques for Language Modeling – - 1998
274 Improved backing-off for m-gram language modeling – - 1995
76 The Power of Amnesia – - 1994
58 Variations on Probabilistic Suffix Trees: Statistical Modeling and Prediction of Protein Families – - 2001
134 Mismatch string kernels for discriminative protein classification – - 2004
974 SCOP, Structural Classification of Proteins Database: Applications to Evaluation of the Effectiveness of Sequence Alignment Methods and Statistics of Protein Structural Data – - 1998
4288 A tutorial on hidden Markov models and selected applications in speech recognition – - 1989
1495 Fundamentals of Speech Recognition – - 1993
286 Universal coding, information, prediction, and estimation – - 1984
618 Text Compression – - 1990
130 Trofimov, “The performance of universal encoding – - 1981
8609 Elements of information theory – - 1991
40 Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space – - 2000