{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,12]],"date-time":"2026-11-12T16:37:43Z","timestamp":1794501463030,"version":"4.9.1"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319215419","type":"print"},{"value":"9783319215426","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-21542-6_16","type":"book-chapter","created":{"date-parts":[[2015,7,11]],"date-time":"2015-07-11T06:59:32Z","timestamp":1436597972000},"page":"241-257","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Probabilistic Event Pattern Discovery"],"prefix":"10.1007","author":[{"given":"Ahmad","family":"Hasan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kia","family":"Teymourian","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Adrian","family":"Paschke","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2015,7,12]]},"reference":[{"key":"16_CR1","unstructured":"Agrawal, R., Srikant, R.: Mining sequential patterns. In: Proceedings of the Eleventh International Conference on Data Engineering, ICDE 1995, pp. 3\u201314. IEEE Computer Society, Washington, DC, USA (1995). http:\/\/dl.acm.org\/citation.cfm?id=645480.655281"},{"key":"16_CR2","unstructured":"Chakravarthy, S., Krishnaprasad, V., Anwar, E., Kim, S.K.: Composite events for active databases: semantics, contexts and detection. In: VLDB 1994. pp. 606\u2013617. Morgan Kaufmann Publishers Inc., San Francisco (1994). http:\/\/dl.acm.org\/citation.cfm?id=645920.672994"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Chang, J.H., Lee, W.S.: Finding recent frequent itemsets adaptively over online data streams. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD 2003, pp. 487\u2013492. ACM, New York (2003). http:\/\/doi.acm.org\/10.1145\/956750.956807","DOI":"10.1145\/956750.956807"},{"key":"16_CR4","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ins.2013.09.007","volume":"257","author":"L Chen","year":"2014","unstructured":"Chen, L., Mei, Q.: Mining frequent items in data stream using time fading model. Information Sciences 257, 54\u201369 (2014). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0020025513006403","journal-title":"Information Sciences"},{"key":"16_CR5","unstructured":"Chi, Y., Wang, H., Yu, P.S., Muntz, R.R.: Moment: maintaining closed frequent itemsets over a stream sliding window. In: In ICDM, pp. 59\u201366 (2004)"},{"key":"16_CR6","first-page":"191","volume":"212","author":"C Giannella","year":"2003","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.: Mining frequent patterns in data streams at multiple time granularities. Next Generation Data Mining 212, 191\u2013212 (2003)","journal-title":"Next Generation Data Mining"},{"key":"16_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-642-37453-1_5","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"A Gomariz","year":"2013","unstructured":"Gomariz, A., Campos, M., Marin, R., Goethals, B.: ClaSP: an efficient algorithm for mining frequent closed sequences. In: Pei, J., Tseng, V.S., Cao, L., Motoda, H., Xu, G. (eds.) PAKDD 2013, Part I. LNCS, vol. 7818, pp. 50\u201361. Springer, Heidelberg (2013)"},{"key":"16_CR8","unstructured":"Luckham, D., Schulte, W.R.: Event processing glossary \u2013 version 2.0 (2011)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Manku, G.S., Motwani, R.: Approximate frequency counts over data streams. In: Proceedings of VLDB 2002, pp. 346\u2013357 (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Margara, A., Cugola, G., Tamburrelli, G.: Learning from the past: automated rule generation for complex event processing. In: Proceedings of the 8th ACM International Conference on Distributed Event-Based Systems, DEBS 2014, pp. 47\u201358. ACM, New York (2014). http:\/\/doi.acm.org\/10.1145\/2611286.2611289","DOI":"10.1145\/2611286.2611289"},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"Mitsa, T.: Temporal Data Mining, 1st edn. Chapman & Hall\/CRC (2010)","DOI":"10.1201\/9781420089776"},{"key":"16_CR12","unstructured":"Pei, J., Han, J., Mortazavi-asl, B., Pinto, H., Chen, Q., Dayal, U., chun Hsu, M.: Prefixspan: mining sequential patterns efficiently by prefix-projected pattern growth. In: ICDE 2001, p. 215. IEEE Computer Society, Washington, DC (2001). http:\/\/dl.acm.org\/citation.cfm?id=876881.879716"},{"key":"16_CR13","volume-title":"Information Retrieval","author":"CJV Rijsbergen","year":"1979","unstructured":"Rijsbergen, C.J.V.: Information Retrieval, 2nd edn. Butterworth-Heinemann, Newton (1979)","edition":"2"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Yan, X., Han, J., Afshar, R.: Clospan: mining closed sequential patterns in large datasets. In. In SDM, pp. 166\u2013177 (2003)","DOI":"10.1137\/1.9781611972733.15"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Yu, J.X., Chong, Z., Lu, H., Zhou, A.: False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: VLDB 2004, pp. 204\u2013215. VLDB Endowment (2004). http:\/\/dl.acm.org\/citation.cfm?id=1316689.1316709","DOI":"10.1016\/B978-012088469-8\/50021-8"},{"issue":"1\u20132","key":"16_CR16","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1023\/A:1007652502315","volume":"42","author":"MJ Zaki","year":"2001","unstructured":"Zaki, M.J.: Spade: An efficient algorithm for mining frequent sequences. Mach. Learn. 42(1\u20132), 31\u201360 (2001). http:\/\/dx.doi.org\/10.1023\/A:1007652502315","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Rule Technologies: Foundations, Tools, and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21542-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T04:49:26Z","timestamp":1676954966000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21542-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319215419","9783319215426"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21542-6_16","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/978-3-319-21542-6","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"12 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}