{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:28:53Z","timestamp":1760707733552},"publisher-location":"New York, NY, USA","reference-count":13,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,8,20]]},"DOI":"10.1145\/1150402.1150473","type":"proceedings-article","created":{"date-parts":[[2006,10,18]],"date-time":"2006-10-18T22:04:00Z","timestamp":1161209040000},"page":"592-597","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":75,"title":["CFI-Stream"],"prefix":"10.1145","author":[{"given":"Nan","family":"Jiang","sequence":"first","affiliation":[{"name":"University of Oklahoma, Norman, OK"}]},{"given":"Le","family":"Gruenwald","sequence":"additional","affiliation":[{"name":"University of Oklahoma, Norman, OK"}]}],"member":"320","published-online":{"date-parts":[[2006,8,20]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"on Very Large Databases","author":"Agrawal R.","year":"1994","unstructured":"R. Agrawal , R. Srikant ; Fast algorithms for mining association rules; Int'l Conf. on Very Large Databases ; September 1994 . R. Agrawal, R. Srikant; Fast algorithms for mining association rules; Int'l Conf. on Very Large Databases; September 1994."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956807"},{"key":"e_1_3_2_1_3_1","unstructured":"J. H. Chang W. S. Lee; A sliding window method for finding recently frequent itemsets over online data streams; Journal of Information Science and Engineering; July 2004.  J. H. Chang W. S. Lee; A sliding window method for finding recently frequent itemsets over online data streams; Journal of Information Science and Engineering; July 2004."},{"key":"e_1_3_2_1_4_1","volume-title":"Muntz","author":"Chi H.","year":"2004","unstructured":"Y. Chi , H. Wang , P. S. Yu , R. R. Muntz ; Moment : Maintaining closed frequent itemsets over a stream sliding window; Int'l Conf. on Data Mining ; November 2004 . Y. Chi, H. Wang , P. S. Yu , R. R. Muntz; Moment: Maintaining closed frequent itemsets over a stream sliding window; Int'l Conf. on Data Mining; November 2004."},{"key":"e_1_3_2_1_5_1","volume-title":"AAAI\/MIT","author":"Giannella J.","year":"2003","unstructured":"C. Giannella , J. Han , J. Pei , X. Yan , P. S. Yu ; Mining frequent patterns in data streams at multiple time granularities; Data Mining : Next Generation Challenges and Future Directions , AAAI\/MIT ; 2003 . C. Giannella, J. Han, J. Pei, X. Yan, P. S. Yu; Mining frequent patterns in data streams at multiple time granularities; Data Mining: Next Generation Challenges and Future Directions, AAAI\/MIT; 2003."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/380752.380841"},{"key":"e_1_3_2_1_7_1","unstructured":"H. Li S. Lee and M. Shan; An efficient algorithm for mining frequent itemsets over the entire history of data streams; Int'l Workshop on Knowledge Discovery in Data Streams; Sept. 2004.  H. Li S. Lee and M. Shan; An efficient algorithm for mining frequent itemsets over the entire history of data streams; Int'l Workshop on Knowledge Discovery in Data Streams; Sept. 2004."},{"key":"e_1_3_2_1_8_1","volume-title":"on Data Mining","author":"Lin D.","year":"2005","unstructured":"C. Lin , D. Chiu , Y. Wu , A. L. P. Chen ; Mining frequent itemsets from data streams with a time-sensitive sliding window; SIAM Int'l Conf . on Data Mining ; April 2005 . C. Lin, D. Chiu, Y. Wu, A. L. P. Chen; Mining frequent itemsets from data streams with a time-sensitive sliding window; SIAM Int'l Conf. on Data Mining; April 2005."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2006.10"},{"key":"e_1_3_2_1_10_1","volume-title":"on Very Large Databases","author":"Manku R.","year":"2002","unstructured":"G. S. Manku , R. Motwani ; Approximate frequency counts over data streams; Int'l Conf. on Very Large Databases ; 2002 . G. S. Manku, R. Motwani; Approximate frequency counts over data streams; Int'l Conf. on Very Large Databases; 2002."},{"key":"e_1_3_2_1_11_1","volume-title":"Mao","author":"Pei J.","year":"2000","unstructured":"J. Pei , J. Han , and R. Mao ; Closet : An efficient algorithm for mining frequent closed itemsets; ACM SIGMOD International Workshop on Data Mining and Knowledge Discovery , May 2000 . J. Pei, J. Han, and R. Mao; Closet: An efficient algorithm for mining frequent closed itemsets; ACM SIGMOD International Workshop on Data Mining and Knowledge Discovery, May 2000."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956779"},{"key":"e_1_3_2_1_13_1","volume-title":"Hsiao","author":"Zaki C. J.","year":"2002","unstructured":"M. J. Zaki and C. J. Hsiao ; Charm : An efficient algorithm for closed itemsets mining. SIAM Int 'l Conf. on Data Mining; April 2002 . M. J. Zaki and C. J. Hsiao; Charm: An efficient algorithm for closed itemsets mining. SIAM Int'l Conf. on Data Mining; April 2002."}],"event":{"name":"KDD06: The 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","ACM Association for Computing Machinery"],"location":"Philadelphia PA USA","acronym":"KDD06"},"container-title":["Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1150402.1150473","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,8]],"date-time":"2023-01-08T09:27:56Z","timestamp":1673170076000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1150402.1150473"}},"subtitle":["mining closed frequent itemsets in data streams"],"short-title":[],"issued":{"date-parts":[[2006,8,20]]},"references-count":13,"alternative-id":["10.1145\/1150402.1150473","10.1145\/1150402"],"URL":"https:\/\/doi.org\/10.1145\/1150402.1150473","relation":{},"subject":[],"published":{"date-parts":[[2006,8,20]]},"assertion":[{"value":"2006-08-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}