{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T06:46:24Z","timestamp":1746859584274},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540705031"},{"type":"electronic","value":"9783540705048"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-70504-8_2","type":"book-chapter","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T12:07:43Z","timestamp":1218542863000},"page":"2-14","source":"Crossref","is-referenced-by-count":8,"title":["Efficient Mining of Frequent Itemsets from Data Streams"],"prefix":"10.1007","author":[{"given":"Carson Kai-Sang","family":"Leung","sequence":"first","affiliation":[]},{"given":"Dale A.","family":"Brajczuk","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., et al.: Mining association rules between sets of items in large databases. In: Proc. ACM SIGMOD, pp. 207\u2013216 (2003)","DOI":"10.1145\/170036.170072"},{"key":"2_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. VLDB, pp. 487\u2013499 (1994)"},{"key":"2_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/978-3-540-73390-4_26","volume-title":"Data Management. Data, Data Everywhere","author":"S. Bashir","year":"2007","unstructured":"Bashir, S., Baig, A.R.: Max-FTP: mining maximal fault-tolerant frequent patterns from databases. In: Cooper, R., Kennedy, J. (eds.) BNCOD 2007. LNCS, vol.\u00a04587, pp. 235\u2013246. Springer, Heidelberg (2007)"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Bucila, C., et al.: DualMiner: a dual-pruning algorithm for itemsets with constraints. In: Proc. ACM KDD, pp. 42\u201351 (2002)","DOI":"10.1145\/775047.775054"},{"key":"2_CR5","unstructured":"Chi, Y., et al.: Moment: maintaining closed frequent itemsets over a stream sliding window. In: Proc. IEEE ICDM, pp. 59\u201366 (2004)"},{"key":"2_CR6","unstructured":"El-Hajj, M., Za\u00efane, O.R.: COFI-tree mining: a new approach to pattern growth with reduced candidacy generation. In: Proc. FIMI (2003)"},{"key":"2_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-540-45228-7_37","volume-title":"Data Warehousing and Knowledge Discovery","author":"M. El-Hajj","year":"2003","unstructured":"El-Hajj, M., Za\u00efane, O.R.: Non-recursive generation of frequent k-itemsets from frequent pattern tree representations. In: Kambayashi, Y., Mohania, M., W\u00f6\u00df, W. (eds.) DaWaK 2003. LNCS, vol.\u00a02737, pp. 371\u2013380. Springer, Heidelberg (2003)"},{"issue":"2","key":"2_CR8","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1145\/1083784.1083789","volume":"34","author":"M.M. Gaber","year":"2005","unstructured":"Gaber, M.M., et al.: Mining data streams: a review. ACM SIGMOD Record\u00a034(2), 18\u201326 (2005)","journal-title":"ACM SIGMOD Record"},{"key":"2_CR9","unstructured":"Giannella, C., et al.: Mining frequent patterns in data streams at multiple time granularities. In: Data Mining: Next Generation Challenges and Future Directions, ch.\u00a06. AAAI\/MIT Press (2004)"},{"key":"2_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/11788911_13","volume-title":"Flexible and Efficient Information Handling","author":"Y. Guo","year":"2006","unstructured":"Guo, Y., et al.: A FP-tree based method for inverse frequent set mining. In: Bell, D.A., Hong, J. (eds.) BNCOD 2006. LNCS, vol.\u00a04042, pp. 152\u2013163. Springer, Heidelberg (2006)"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Han, J., et al.: Mining frequent patterns without candidate generation. In: Proc. ACM SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"key":"2_CR12","unstructured":"Jin, R., Agrawal, G.: An algorithm for in-core frequent itemset mining on streaming data. In: Proc. IEEE ICDM, pp. 210\u2013217 (2005)"},{"issue":"4","key":"2_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1145\/958942.958944","volume":"28","author":"L.V.S. Lakshmanan","year":"2003","unstructured":"Lakshmanan, L.V.S., Leung, C.K.-S., Ng, R.T.: Efficient dynamic mining of constrained frequent sets. ACM TODS\u00a028(4), 337\u2013389 (2003)","journal-title":"ACM TODS"},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., et al.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., et al. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 653\u2013661 (2008)","DOI":"10.1007\/978-3-540-68125-0_61"},{"issue":"3","key":"2_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"C.K.-S. Leung","year":"2007","unstructured":"Leung, C.K.-S., et al.: CanTree: a canonical-order tree for incremental frequent-pattern mining. KAIS\u00a011(3), 287\u2013311 (2007)","journal-title":"KAIS"},{"issue":"1","key":"2_CR16","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1145\/568574.568581","volume":"4","author":"C.K.-S. Leung","year":"2002","unstructured":"Leung, C.K.-S., et al.: Exploiting succinct constraints using FP-trees. ACM SIGKDD Explorations\u00a04(1), 40\u201349 (2002)","journal-title":"ACM SIGKDD Explorations"},{"key":"2_CR17","series-title":"LNCS (LNAI)","first-page":"644","volume-title":"PAKDD 2008","author":"C.K.-S. Leung","year":"2008","unstructured":"Leung, C.K.-S., et al.: FIsViz: a frequent itemset visualizer. In: Washio, T., et al. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 644\u2013652. Springer, Heidelberg (2008)"},{"key":"2_CR18","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Khan, Q.I.: DSTree: a tree structure for the mining of frequent sets from data streams. In: Proc. IEEE ICDM, pp. 928\u2013932 (2006)","DOI":"10.1109\/ICDM.2006.62"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Khan, Q.I.: Efficient mining of constrained frequent patterns from streams. In: Proc. IDEAS, pp. 61\u201368 (2006)","DOI":"10.1109\/IDEAS.2006.20"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Ng, R.T., et al.: Exploratory mining and pruning optimizations of constrained associations rules. In: Proc. ACM SIGMOD, pp. 13\u201324 (1998)","DOI":"10.1145\/276304.276307"},{"key":"2_CR21","unstructured":"Pei, J., et al.: Mining frequent itemsets with convertible constraints. In: Proc. IEEE ICDE, pp. 433\u2013442 (2001)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Yu, J.X., et al.: False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: Proc. VLDB, pp. 204\u2013215 (2004)","DOI":"10.1016\/B978-012088469-8\/50021-8"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Hsiao, C.-J.: CHARM: an efficient algorithm for closed itemset mining. In: Proc. SDM, pp. 457\u2013473 (2002)","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Lecture Notes in Computer Science","Sharing Data, Information and Knowledge"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-70504-8_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,19]],"date-time":"2020-11-19T00:06:46Z","timestamp":1605744406000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-70504-8_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540705031","9783540705048"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-70504-8_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}