{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T20:28:46Z","timestamp":1794342526526,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540453741","type":"print"},{"value":"9783540460480","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11871637_9","type":"book-chapter","created":{"date-parts":[[2006,9,19]],"date-time":"2006-09-19T07:09:53Z","timestamp":1158649793000},"page":"42-54","source":"Crossref","is-referenced-by-count":10,"title":["VOGUE: A Novel Variable Order-Gap State Machine for Modeling Sequences"],"prefix":"10.1007","author":[{"given":"Bouchra","family":"Bouqata","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Christopher D.","family":"Carothers","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Boleslaw K.","family":"Szymanski","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammed J.","family":"Zaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/3-540-45065-3_21","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"C. Antunes","year":"2003","unstructured":"Antunes, C., Oliveira, A.L.: Generalization of pattern-growth methods for sequential pattern mining with gap constraints. In: Perner, P., Rosenfeld, A. (eds.) MLDM 2003. LNCS, vol.\u00a02734, pp. 239\u2013251. Springer, Heidelberg (2003)"},{"key":"9_CR2","unstructured":"Botta, M., Galassi, U., Giordana, A.: Learning Complex and Sparse Events in Long Sequences. In: European Conference on Artificial Intelligence (2004)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Deshpande, M., Karypis, G.: Selective markov models for predicting web-page accesses. In: SIAM International Conference on Data Mining (April 2001)","DOI":"10.1137\/1.9781611972719.4"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1093\/bioinformatics\/14.9.755","volume":"14","author":"S.R. Eddy","year":"1998","unstructured":"Eddy, S.R.: Profile hidden markov models. Bioinformatics\u00a014, 755\u2013763 (1998)","journal-title":"Bioinformatics"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Evangelista, P.F., Embrechts, M.J., Bonissone, P., Szymanski, B.K.: Fuzzy ROC curves for unsupervised nonparametric ensemble techniques. IJCNN (2005)","DOI":"10.1109\/IJCNN.2005.1556410"},{"issue":"11","key":"9_CR6","first-page":"1505","volume":"17","author":"S. Laxman","year":"2005","unstructured":"Laxman, S., et al.: Discovering frequent episodes and learning hidden markov models: A formal connection. IEEE TKDE\u00a017(11), 1505\u20131517 (2005)","journal-title":"IEEE TKDE"},{"issue":"5","key":"9_CR7","first-page":"1155","volume":"15","author":"A. Nanopoulos","year":"2003","unstructured":"Nanopoulos, A., Katsaros, D., Manolopoulos, Y.: A data mining algorithm for generalized web prefetching. IEEE TKDE\u00a015(5), 1155\u20131169 (2003)","journal-title":"IEEE TKDE"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"Pitkow, J., Pirolli, P.: Mining longest repeating subsequence to predict WWW surfing. In: 2nd USENIX Symp. on Internet Technologies and Systems (1999)","DOI":"10.1023\/A:1019288403823"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1023\/A:1007649326333","volume":"37","author":"L. Saul","year":"1999","unstructured":"Saul, L., Jordan, M.: Mixed memory markov models: Decomposing complex stochastic processes as mix of simpler ones. Machine Learning\u00a037(1), 75\u201387 (1999)","journal-title":"Machine Learning"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"Schwardt, L.C., du Preez, J.A.: Efficient mixed-order hidden markov model inference. In: Int\u2019l Conf. on Spoken Language Processing (October 2000)","DOI":"10.21437\/ICSLP.2000-253"},{"key":"9_CR11","doi-asserted-by":"crossref","unstructured":"Zaki, M.J.: Sequences mining in categorical domains: Incorporating constraints. In: 9th Int\u2019l Conf. on Information and Knowledge Management (November 2000)","DOI":"10.1145\/354756.354849"},{"issue":"1\/2","key":"9_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"M.J. Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: An efficient algorithm for mining frequent sequences. Machine Learning Journal\u00a042(1\/2), 31\u201360 (2001)","journal-title":"Machine Learning Journal"}],"container-title":["Lecture Notes in Computer Science","Knowledge Discovery in Databases: PKDD 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11871637_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,8]],"date-time":"2023-05-08T18:13:55Z","timestamp":1683569635000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11871637_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540453741","9783540460480"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/11871637_9","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11871637","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}