{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T00:58:49Z","timestamp":1770512329938,"version":"3.49.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319180311","type":"print"},{"value":"9783319180328","type":"electronic"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18032-8_49","type":"book-chapter","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T05:41:54Z","timestamp":1431063714000},"page":"625-636","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":48,"title":["CPT+: Decreasing the Time\/Space Complexity of the Compact Prediction Tree"],"prefix":"10.1007","author":[{"given":"Ted","family":"Gueniche","sequence":"first","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Rajeev","family":"Raman","sequence":"additional","affiliation":[]},{"given":"Vincent S.","family":"Tseng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,9]]},"reference":[{"key":"49_CR1","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1613\/jair.1491","volume":"22","author":"R Begleiter","year":"2004","unstructured":"Begleiter, R., El-yaniv, R., Yona, G.: On prediction using variable order markov models. Journal of Artificial Intelligence Research 22, 385\u2013421 (2004)","journal-title":"Journal of Artificial Intelligence Research"},{"issue":"4","key":"49_CR2","first-page":"413","volume":"24","author":"J Cleary","year":"1984","unstructured":"Cleary, J., Witten, I.: Data compression using adaptive coding and partial string matching. IEEE Trans. on Inform. Theory 24(4), 413\u2013421 (1984)","journal-title":"IEEE Trans. on Inform. Theory"},{"issue":"2","key":"49_CR3","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1145\/990301.990304","volume":"4","author":"M Deshpande","year":"2004","unstructured":"Deshpande, M., Karypis, G.: Selective markov models for predicting web page accesses. ACM Transactions on Internet Technology 4(2), 163\u2013184 (2004). https:\/\/www.developers.google.com\/prediction, Accessed: 2014\u201302-15","journal-title":"ACM Transactions on Internet Technology"},{"issue":"1","key":"49_CR4","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MIS.2007.15","volume":"22","author":"K Gopalratnam","year":"2007","unstructured":"Gopalratnam, K., Cook, D.J.: Online sequential prediction via incremental parsing: The active lezi algorithm. IEEE Intelligent Systems 22(1), 52\u201358 (2007)","journal-title":"IEEE Intelligent Systems"},{"key":"49_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1007\/978-3-642-53917-6_16","volume-title":"Advanced Data Mining and Applications","author":"T Gueniche","year":"2013","unstructured":"Gueniche, T., Fournier-Viger, P., Tseng, V.S.: Compact prediction tree: a lossless model for accurate sequence prediction. In: Motoda, H., Wu, Z., Cao, L., Zaiane, O., Yao, M., Wang, W. (eds.) ADMA 2013, Part II. LNCS, vol. 8347, pp. 177\u2013188. Springer, Heidelberg (2013)"},{"key":"49_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1007\/978-3-642-35527-1_36","volume-title":"Advanced Data Mining and Applications","author":"P Fournier-Viger","year":"2012","unstructured":"Fournier-Viger, P., Gueniche, T., Tseng, V.S.: Using partially-ordered sequential rules to generate more accurate sequence prediction. In: Zhou, S., Zhang, S., Karypis, G. (eds.) ADMA 2012. LNCS, vol. 7713, pp. 431\u2013442. Springer, Heidelberg (2012)"},{"issue":"1","key":"49_CR7","first-page":"43","volume":"15","author":"P Laird","year":"1994","unstructured":"Laird, P., Saul, R.: Discrete sequence prediction and its applications. Machine Learning 15(1), 43\u201368 (1994)","journal-title":"Machine Learning"},{"key":"49_CR8","first-page":"358","volume":"16","author":"VN Padmanabhan","year":"1998","unstructured":"Padmanabhan, V.N., Mogul, J.C.: Using Prefetching to Improve World Wide Web Latency. Computer Communications 16, 358\u2013368 (1998)","journal-title":"Computer Communications"},{"issue":"11","key":"49_CR9","doi-asserted-by":"publisher","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","volume":"16","author":"J Pei","year":"2004","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Wang, J., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: Mining sequential patterns by pattern-growth: the PrefixSpan approach. IEEE Trans. Known. Data Engin. 16(11), 1424\u20131440 (2004)","journal-title":"IEEE Trans. Known. Data Engin."},{"key":"49_CR10","doi-asserted-by":"crossref","unstructured":"Pitkow, J., Pirolli, P.: Mining longest repeating subsequence to predict world wide web surng. In: Proc. 2nd USENIX Symposium on Internet Technologies and Systems, Boulder, CO, pp. 13\u201325 (1999)","DOI":"10.1023\/A:1019288403823"},{"issue":"4","key":"49_CR11","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/MIS.2001.1463065","volume":"16","author":"R Sun","year":"2001","unstructured":"Sun, R., Giles, C.L.: Sequence Learning: From Recognition and Prediction to Sequential Decision Making. IEEE Intelligent Systems 16(4), 67\u201370 (2001)","journal-title":"IEEE Intelligent Systems"},{"issue":"5","key":"49_CR12","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Transactions on Information Theory 24(5), 530\u2013536 (1978)","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18032-8_49","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,16]],"date-time":"2023-02-16T21:46:38Z","timestamp":1676583998000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-18032-8_49"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319180311","9783319180328"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18032-8_49","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}