{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:58:15Z","timestamp":1725602295924},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642238772"},{"type":"electronic","value":"9783642238789"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-23878-9_24","type":"book-chapter","created":{"date-parts":[[2011,8,24]],"date-time":"2011-08-24T07:54:01Z","timestamp":1314172441000},"page":"194-203","source":"Crossref","is-referenced-by-count":7,"title":["Extensions for Continuous Pattern Mining"],"prefix":"10.1007","author":[{"given":"Marcin","family":"Gorawski","sequence":"first","affiliation":[]},{"given":"Pawel","family":"Jureczek","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1109\/ICDE.2001.914830","volume-title":"Proc. of the 17th Int. Conf. on Data Engineering","author":"J. Pei","year":"2001","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In: Proc. of the 17th Int. Conf. on Data Engineering, pp. 215\u2013224. IEEE CS, Heidelberg (2001)"},{"key":"24_CR2","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\u00a042, 31\u201360 (2001)","journal-title":"Machine Learning"},{"key":"24_CR3","first-page":"429","volume-title":"Proc. of the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining","author":"J. Ayres","year":"2002","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential PAttern mining using a bitmap representation. In: Proc. of the 8th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, pp. 429\u2013435. ACM, Edmonton (2002)"},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1109\/ICDM.2001.989514","volume-title":"Proc. of the 2001 IEEE Int. Conf. on Data Mining","author":"K. Gouda","year":"2001","unstructured":"Gouda, K., Zaki, M.J.: Efficiently Mining Maximal Frequent Itemsets. In: Proc. of the 2001 IEEE Int. Conf. on Data Mining, pp. 163\u2013170. IEEE CS, San Jose (2001)"},{"key":"24_CR5","unstructured":"Grahne, G., Zhu, J.: High performance mining of maximal frequent itemsets. In: Proc. of the Sixth SIAM Int. Workshop on High Performance Data Mining, pp. 135\u2013143 (2003)"},{"key":"24_CR6","unstructured":"Pei, J., Han, J., Mao, R.: CLOSET: An Efficient Algorithm for Mining Frequent Closed Itemsets. In: ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, pp. 21\u201330 (2000)"},{"key":"24_CR7","volume-title":"Proc. of the Second SIAM Int. Conf. on Data Mining","author":"M.J. Zaki","year":"2002","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: An Efficient Algorithm for Closed Itemset Mining. In: Proc. of the Second SIAM Int. Conf. on Data Mining. SIAM, Arlington (2002)"},{"key":"24_CR8","volume-title":"Proc. of the Third SIAM Int. Conf. on Data Mining","author":"X. Yan","year":"2003","unstructured":"Yan, X., Han, J., Afshar, R.: CloSpan: Mining Closed Sequential Patterns in Large Databases. In: Proc. of the Third SIAM Int. Conf. on Data Mining. SIAM, San Francisco (2003)"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1109\/ICDE.2004.1319986","volume-title":"Proc. of the 20th Int. Conf. on Data Engineering","author":"J. Wang","year":"2004","unstructured":"Wang, J., Han, J.: BIDE: Efficient Mining of Frequent Closed Sequences. In: Proc. of the 20th Int. Conf. on Data Engineering, pp. 79\u201390. IEEE CS, Boston (2004)"},{"key":"24_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"396","DOI":"10.1007\/3-540-45571-X_47","volume-title":"Knowledge Discovery and Data Mining. Current Issues and New Applications","author":"J. Pei","year":"2000","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Zhu, H.: Mining Access Patterns Efficiently from Web Logs. In: Terano, T., Chen, A.L.P. (eds.) PAKDD 2000. LNCS, vol.\u00a01805, pp. 396\u2013407. Springer, Heidelberg (2000)"},{"key":"24_CR11","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1016\/j.infsof.2005.12.014","volume":"48","author":"V.S. Tseng","year":"2006","unstructured":"Tseng, V.S., Lin, K.W.: Efficient mining and prediction of user behavior patterns in mobile web systems. Information and Software Technology\u00a048, 357\u2013369 (2006)","journal-title":"Information and Software Technology"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Gorawski, M., Jureczek, P., Gorawski, M.: Exploration of continuous sequential patterns using the CPGrowth algorithm. In: The 7-th Int. Conf. on Multimedia and Network Information Systems, pp. 165\u2013172 (2010)","DOI":"10.1007\/978-3-642-14989-4_16"},{"key":"24_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/10704656_12","volume-title":"The World Wide Web and Databases","author":"M. Spiliopoulou","year":"1999","unstructured":"Spiliopoulou, M., Faulstich, L.C.: WUM: A Tool for Web Utilization Analysis. In: Atzeni, P., Mendelzon, A.O., Mecca, G. (eds.) WebDB 1998. LNCS, vol.\u00a01590, pp. 184\u2013203. Springer, Heidelberg (1999)"},{"key":"24_CR14","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of the 2000 ACM SIGMOD Int. Conf. on Management of Data, pp. 1\u201312, Dallas (2000)","DOI":"10.1145\/342009.335372"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Brinkhoff, T.A.: A Framework for Generating Network-Based Moving Objects. Geoinformatica, 153\u2013180 (2002)","DOI":"10.1023\/A:1015231126594"}],"container-title":["Lecture Notes in Computer Science","Intelligent Data Engineering and Automated Learning - IDEAL 2011"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-23878-9_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,1]],"date-time":"2019-04-01T01:12:43Z","timestamp":1554081163000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-23878-9_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642238772","9783642238789"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-23878-9_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}