VOGUE: A novel variable order-gap state machine for modeling sequences

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

Volumn 4213 LNAI, Issue , 2006, Pages 42-54

  Bouqata, Bouchra ^a   Carothers, Christopher D ^a   Szymanski, Boleslaw K ^a   Zaki, Mohammed J ^a  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SIMULATION; DATA REDUCTION; DATA STRUCTURES; MARKOV PROCESSES; PROTEINS; SENSITIVITY ANALYSIS;

DATA MODELING; PROTEIN CLASSIFICATION; SEQUENCE MINING METHOD (VGS); STATE MACHINES;

DATA MINING;

EID: 33750341634     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11871637_9     Document Type: Conference Paper

References (12)

1. C. Antunes and A. L. Oliveira. Generalization of pattern-growth methods for sequential pattern mining with gap constraints. Machine Learning and Data Mining in Pattern Recognition, Springer LNCS Vol. 2734, pages 239-251, 2003.
2. M. Botta, U. Galassi and A. Giordana. Learning Complex and Sparse Events in Long Sequences. European Conference on Artificial Intelligence, 2004.
3. M. Deshpande and G. Karypis. Selective markov models for predicting web-page accesses. In SIAM International Conference on Data Mining, April 2001.
4. S. R. Eddy. Profile hidden markov models. Bioinformatics, 14:755-763, 1998.
5. P.F. Evangelista, M.J. Embrechts, P. Bonissone, and B. K. Szymanski. Fuzzy ROC curves for unsupervised nonparametric ensemble techniques. IJCNN, 2005.
6. S. Laxman, et al. Discovering frequent episodes and learning hidden markov models: A formal connection. IEEE TKDE, 17(11):1505-1517, Nov 2005.
7. A. Nanopoulos, D. Katsaros, and Y. Manolopoulos. A data mining algorithm for generalized web prefetching. IEEE TKDE, 15(5):1155-1169, 2003.
8. J. Pitkow and P. Pirolli. Mining longest repeating subsequence to predict WWW surfing. In 2nd USENIX Symp. on Internet Technologies and Systems, 1999.
9. L. Saul and M. Jordan. Mixed memory markov models: Decomposing complex stochastic processes as mix of simpler ones. Machine Learning, 37(1):75-87, 1999.
10. L.C. Schwardt and J.A. du Preez. Efficient mixed-order hidden markov model inference. In Int'l Conf. on Spoken Language Processing, oct 2000.
11. M. J. Zaki. Sequences mining in categorical domains: Incorporating constraints. In 9th Int'l Conf. on Information and Knowledge Management, November 2000.
12. M. J. Zaki. SPADE: An efficient algorithm for mining frequent sequences. Machine Learning Journal, 42(1/2):31-60, Jan/Feb 2001.