{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:08Z","timestamp":1750306928974,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,3,18]],"date-time":"2013-03-18T00:00:00Z","timestamp":1363564800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"INRIA"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2013,3,18]]},"DOI":"10.1145\/2480362.2480419","type":"proceedings-article","created":{"date-parts":[[2013,5,1]],"date-time":"2013-05-01T19:47:45Z","timestamp":1367437665000},"page":"267-274","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Mining frequent itemsets over tuple-evolving data streams"],"prefix":"10.1145","author":[{"given":"Chongsheng","family":"Zhang","sequence":"first","affiliation":[{"name":"Henan University, Kaifeng, China"}]},{"given":"Mirjana","family":"Mazuran","sequence":"additional","affiliation":[{"name":"Politecnico di Milano, Milano, Italy"}]},{"given":"Hamid","family":"Mousavi","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles"}]},{"given":"Yuan","family":"Hao","sequence":"additional","affiliation":[{"name":"University of Science and Technology Beijing, China"}]},{"given":"Carlo","family":"Zaniolo","sequence":"additional","affiliation":[{"name":"UCLA, Los Angeles"}]},{"given":"Florent","family":"Masseglia","sequence":"additional","affiliation":[{"name":"Zenith team, INRIA, Montpellier, France"}]}],"member":"320","published-online":{"date-parts":[[2013,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"487","volume-title":"VLDB","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal and R. Srikant . Fast algorithms for mining association rules . In VLDB , pages 487 -- 499 , 1994 . R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In VLDB, pages 487--499, 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543615"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1132956.1132958"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/956863.956967"},{"key":"e_1_3_2_1_5_1","first-page":"59","volume-title":"IEEE ICDM","author":"Chi Y.","year":"2004","unstructured":"Y. Chi , H. Wang , P. S. Yu , and R. R. Muntz . Moment: Maintaining closed frequent itemsets over a stream sliding window . In IEEE ICDM , pages 59 -- 66 , 2004 . Y. Chi, H. Wang, P. S. Yu, and R. R. Muntz. Moment: Maintaining closed frequent itemsets over a stream sliding window. In IEEE ICDM, pages 59--66, 2004."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF03325089"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1066157.1066232"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1645953.1646064"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/342009.335372"},{"key":"e_1_3_2_1_11_1","series-title":"Lecture Notes in Computer Science","first-page":"77","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"Kosters W.","year":"2003","unstructured":"W. Kosters , W. Pijls , and V. Popova . Complexity analysis of depth first and fp-growth implementations of apriori . In Machine Learning and Data Mining in Pattern Recognition , volume 2734 of Lecture Notes in Computer Science , pages 77 -- 119 . Springer , 2003 . W. Kosters, W. Pijls, and V. Popova. Complexity analysis of depth first and fp-growth implementations of apriori. In Machine Learning and Data Mining in Pattern Recognition, volume 2734 of Lecture Notes in Computer Science, pages 77--119. Springer, 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1058150.1058158"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-011-0229-7"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2008.4497426"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2006.130"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767879"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.91"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIME.2012.16"}],"event":{"name":"SAC '13: SAC '13","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Coimbra Portugal","acronym":"SAC '13"},"container-title":["Proceedings of the 28th Annual ACM Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480419","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2480362.2480419","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:32Z","timestamp":1750235732000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2480362.2480419"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3,18]]},"references-count":18,"alternative-id":["10.1145\/2480362.2480419","10.1145\/2480362"],"URL":"https:\/\/doi.org\/10.1145\/2480362.2480419","relation":{},"subject":[],"published":{"date-parts":[[2013,3,18]]},"assertion":[{"value":"2013-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}