Online decoding of markov models under latency constraints

ACM International Conference Proceeding Series

Volumn 148, Issue , 2006, Pages 657-664

  Narasimhan, Mukund ^a   Viola, Paul ^a   Shilman, Michael ^a  

^a MICROSOFT   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHAIN MARKOV MODELS; FIXED WINDOW; OPTIMAL METHOD;

CONSTRAINT THEORY; HIDDEN MARKOV MODELS; INFORMATION ANALYSIS; MATHEMATICAL MODELS; ONLINE SYSTEMS; VITERBI ALGORITHM;

DECODING;

EID: 34250702691     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1143844.1143927     Document Type: Conference Paper

References (17)

1. Berger, A., Pietra, S. D., & Pietra, V. D. (1996). A maximum entropy approach to natural language processing. Computational Linguistics, 22, 39-71.
2. Chan, P., & Stolfo, S. (1998). Toward scalable learning with non-uniform class and cost distributions: A case study in credit card fraud detection. Knowledge Discovery and Data Mining (pp. 164-168).
3. Cox, K., Eric, S., Willis, G., & Brachman, R. (1997). Visual data mining: Recognizing telephone callfraud. Data Mining and Knowledge Discovery (pp. 225-31).
4. Daumé III, H., & Marcu, D. (2005). Learning as search optimization: Approximate large margin methods for structured prediction. International Conference on Machine Learning (ICML). Bonn, Germany.
5. Dumouchel, W., & Schonlau, M. (1998). A fast computer intrusion detection algorithm based on hypothesis testing of command transition probabilities. Proceedings of the fourth international conference on Knowledge Discovery and Data Mining.
6. Eickeler, S., Kosmala, A., & Rigoll, G. (1998). Hidden markov model based continuous online gesture recognition. Int. Conference on Pattern Recognition (ICPR) (pp. 1206-1208). Brisbane.
7. Fawcett, T., & Provost, F. (1997). Adaptive fraud detection. Data Mining and Knowledge Discovery (pp. 291-316).
8. Kristjansson, T., Culotta, A., Viola, P., & McCallum, A. (2004). Interactive information extraction with constrained conditional random fields. Proceedings of the 19th AAAI.
9. Lafferty, J., McCallum, A., & Pereira, F. (2001). Conditional random fields: Probabilistic models for segmenting and labeling sequence data. Proceedings of the 18th ICML. San Francisco: Morgan Kaufmann.
10. Lane, T., & Brodley, C. (1997). Approaches to online learning and concept drift for user identification in computer security. Data Mining and Knowledge Discovery (pp. 259-263).
11. Lee, W., Stolfo, S., & Mok, K. (1998). Mining audit data to build intrusion detection models. International Conference on Knowledge Discovery and Data Mining.
12. Leek, T. (1997). Information extraction using hidden markov models. Masters thesis, UC San Diego.
13. McCallum, A., Freitag, D., & Pereira, F. (2000). Maximum entropy markov models for information extraction and segmentation. Proc. 17th International Conference on Machine Learning.
14. Pinto, D., McCallum, A., Wei, X., & Croft, W. (2003). Table extraction using conditional random fields. Proceedings of the 26th ACM SIGIR (pp. 235-242).
15. Rabiner, L. (1989). A tutorial on hidden markov models and selected applications in speech recognition. Proceedings of the IEEE, 77, 257-286.
16. Seward, A. (2003). Low-latency incremental speech transcription in the synface project. EUROSPEECH.
17. Taskar, B., Abeel, P., & Koller, D. (2002). Discriminative probabilistic models for relational data. Proceedings of the 18th Conference on Uncertainty in Artificial Intelligence.