Very predictive ngrams for space-limited probabilistic models

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2810, Issue , 2003, Pages 134-142

  Cohen, Paul R ^a   Sutton, Charles A ^a  

^a University of Massachusetts Amherst   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

FIXED-ORDER; GREEDY ALGORITHMS; MARKOV MODEL; N-GRAMS; PREDICTIVE RULES; PROBABILISTIC MODELS; SEQUENTIAL PREDICTION; VARIABLE LENGTH;

MARKOV PROCESSES;

EID: 35248815655     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45231-7_13     Document Type: Article

References (6)

1. Alberto Apostolico and Gill Bejerano. Optimal amnesic probabilistic automata or how to learn and classify proteins in linear time and space. In RECOMB, pages 25-32, 2000.
2. G. Bejerano and G. Yona. Variations on probabilistic suffix trees: statistical modeling and the prediction of protein families. Bioinformatics, 17(1):23-43, 2001.
3. Richard O. Duda, Peter E. Hart, and David G. Stork. Pattern Classification. Wiley, 2nd edition, 2001.
4. Philip Laird and Ronald Saul. Discrete sequence prediction and its applications. Machine Learning, 15:43-68, 1994.
5. Lawrence Rabiner. A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE, 77(2):257-285, 1989.
6. Dana Ron, Yoram Singer, and Naftali Tishby. The power of amnesia: Learning probabilistic automata with variable memory length. Machine Learning, 25(2-3):117-149, 1996.