{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,20]],"date-time":"2025-10-20T10:07:01Z","timestamp":1760954821667},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2006,3,15]],"date-time":"2006-03-15T00:00:00Z","timestamp":1142380800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"},{"start":{"date-parts":[[2006,3,15]],"date-time":"2006-03-15T00:00:00Z","timestamp":1142380800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc\/2.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2006,10]]},"DOI":"10.1007\/s10115-006-0003-0","type":"journal-article","created":{"date-parts":[[2006,3,14]],"date-time":"2006-03-14T16:58:25Z","timestamp":1142355505000},"page":"265-294","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":131,"title":["Catch the moment: maintaining closed frequent itemsets over a data stream sliding window"],"prefix":"10.1007","volume":"10","author":[{"given":"Yun","family":"Chi","sequence":"first","affiliation":[]},{"given":"Haixun","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Philip S.","family":"Yu","sequence":"additional","affiliation":[]},{"given":"Richard R.","family":"Muntz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,3,15]]},"reference":[{"issue":"3","key":"3_CR1","doi-asserted-by":"publisher","first-page":"350","DOI":"10.1006\/jpdc.2000.1693","volume":"61","author":"RC Agarwal","year":"2001","unstructured":"Agarwal RC, Aggarwal CC, Prasad VVV (2001) A tree projection algorithm for generation of frequent item sets. J Parallel Distrib Comput 61(3):350\u2013371","journal-title":"J Parallel Distrib Comput"},{"key":"3_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large databases (VLDB'94)"},{"key":"3_CR3","unstructured":"Asai T, Arimura H, Abe K, Kawasoe S, Arikawa S (2002) Online algorithms for mining semi-structured data stream. In: Proceedings of the 2002 international conference on data mining (ICDM'02)"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Bayardo Jr RJ (1998) Efficiently mining long patterns from databases. In: Proceedings of the ACM SIGMOD","DOI":"10.1145\/276304.276313"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Chang JH, Lee WS (2003) Finding recent frequent itemsets adaptively over online data streams. In: Proceedings of the 2003 international conference knowledge discovery and data mining (SIGKDD'03)","DOI":"10.1145\/956750.956807"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Charikar M, Chen K, Farach-Colton M (2002) Finding frequent items in data streams. In: Proceedings of the 29th international colloquium on automata, languages and programming","DOI":"10.1007\/3-540-45465-9_59"},{"key":"3_CR7","unstructured":"Cheung DW, Han J, Ng V, Wong CY (1996) Maintenance of discovered association rules in large databases: An incremental updating technique. In: Proceedings of the twelfth international conference on data engineering"},{"key":"3_CR8","doi-asserted-by":"crossref","unstructured":"Cheung DW, Lee SD, Kao B (1997) A general incremental technique for maintaining discovered association rules, In: Proceedings of the fifth international conference on database systems for advanced applications (DASFAA)","DOI":"10.1142\/9789812819536_0020"},{"key":"3_CR9","unstructured":"Giannella C, Han J, Robertson E, Liu C (2003) Mining frequent itemsets over arbitrary time intervals in data streams. Technical Report tr587, Indiana University"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Gouda K, Zaki MJ (2001) Efficiently mining maximal frequent itemsets. In: Proceedings of the 2001 IEEE international conference on data mining","DOI":"10.1145\/775047.775058"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD international conference on management of data","DOI":"10.1145\/342009.335372"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Hidber C (1999) Online association rule mining. In: Proceedings of the ACM SIGMOD international conference on management of data","DOI":"10.1145\/304182.304195"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Manku G, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of the 28th international conference on very large data bases","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"issue":"3","key":"3_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila H, Toivonen H (1997) Levelwise search and borders of theories in knowledge discovery. Data Mining Knowledge Discov 1(3):241\u2013258","journal-title":"Data Mining Knowledge Discov"},{"issue":"6","key":"3_CR15","doi-asserted-by":"publisher","first-page":"2439","DOI":"10.1109\/TSMCB.2004.836887","volume":"34","author":"ME Otey","year":"2004","unstructured":"Otey ME, Parthasarathy S, Wang C, Veloso A, Meira W Jr (2004) Parallel and distributed methods for incremental frequent itemset mining. IEEE Trans Syst Man Cybern, Part B 34(6):2439\u20132450","journal-title":"IEEE Trans Syst Man Cybern, Part B"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Teng W-G, Chen M-S, Yu PS (2003) A regression-based temporal pattern mining scheme for data streams. In: Proceedings of 29th international conference on very large data bases (VLDB'03)","DOI":"10.1016\/B978-012722442-8\/50017-3"},{"key":"3_CR17","unstructured":"Thomas S, Bodagala S, Alsabti K, Ranka S (1997) An efficient algorithm for the incremental updation of association rules in large databases. In: Proceedings of the 1997 international conference knowledge discovery and data mining (SIGKDD'97), pp 263\u2013266"},{"key":"3_CR18","doi-asserted-by":"crossref","unstructured":"Veloso A, Meira Jr W, de Carvalho M, P\u00f4ssas B, Parthasarathy S, Zaki MJ (2002) Mining frequent itemsets in evolving databases. In: Proceedings of the SDM","DOI":"10.1137\/1.9781611972726.29"},{"key":"3_CR19","doi-asserted-by":"crossref","unstructured":"Vitter JS (1985) Random sampling with a reservoir. ACM Trans Math Softw 11(1)","DOI":"10.1145\/3147.3165"},{"key":"3_CR20","doi-asserted-by":"crossref","unstructured":"Wang J, Han J, Pei J (2003) Closet+: searching for the best strategies for mining frequent closed itemsets. In: Proceedings of the 2003 international conference knowledge discovery and data mining (SIGKDD'03)","DOI":"10.1145\/956750.956779"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Zaki MJ, Hsiao C (2002) Charm: an efficient algorithm for closed itemset mining. In: Proceedings of the 2nd SIAM international conference on data mining","DOI":"10.1137\/1.9781611972726.27"},{"key":"3_CR22","doi-asserted-by":"crossref","unstructured":"Zheng Z, Kohavi R, Mason L (2001) Real world performance of association rule algorithms. In: Proceedings of the 2001 international conference on knowledge discovery and data mining (SIGKDD'01)","DOI":"10.1145\/502512.502572"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-006-0003-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-006-0003-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s10115-006-0003-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-006-0003-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,6]],"date-time":"2023-05-06T19:08:39Z","timestamp":1683400119000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-006-0003-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,3,15]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2006,10]]}},"alternative-id":["3"],"URL":"https:\/\/doi.org\/10.1007\/s10115-006-0003-0","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,3,15]]},"assertion":[{"value":"6 August 2004","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 September 2005","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 September 2005","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2006","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}