{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,16]],"date-time":"2025-10-16T06:29:47Z","timestamp":1760596187125,"version":"3.32.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2006,5,31]],"date-time":"2006-05-31T00:00:00Z","timestamp":1149033600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2006,9]]},"DOI":"10.1007\/s10618-006-0042-x","type":"journal-article","created":{"date-parts":[[2006,5,30]],"date-time":"2006-05-30T19:03:35Z","timestamp":1149015815000},"page":"193-217","source":"Crossref","is-referenced-by-count":57,"title":["Mining top-K frequent itemsets from data streams"],"prefix":"10.1007","volume":"13","author":[{"given":"Raymond Chi-Wing","family":"Wong","sequence":"first","affiliation":[]},{"given":"Ada Wai-Chee","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,31]]},"reference":[{"key":"42_CR1","unstructured":"Agrawal, R. IBM Synthetic Data Generator, http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html."},{"key":"42_CR2","doi-asserted-by":"crossref","unstructured":"Babcock, B., Datar, M., Motwani, R., and O\u00b4Callaghan, L. 2003. Maintaining variance and k-medians over data stream windows. In SIGMOD.","DOI":"10.1145\/773153.773176"},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Babcock, B., and Olston, C. 2003. Distributed top-K monitoring. In SIGMOD.","DOI":"10.1145\/872763.872764"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"Lee, C.-H., C.-R.L., and Chen, M.-S. 2001. Sliding-window Filtering: An Efficient algorithm for incremental mining. In Intl. Conf. on Information and Knowledge Management.","DOI":"10.1145\/502585.502630"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Chang, J.H. and Lee, W.S. 2003. Finding recent frequent itemsets adaptively over online data streams. In SIGKDD.","DOI":"10.1145\/956804.956807"},{"key":"42_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., and Farach-Colton, M. 2002. Finding frequent items in data streams. In 29th Intl. Colloquium on Automata, Language and Programming.","DOI":"10.1007\/3-540-45465-9_59"},{"key":"42_CR7","unstructured":"Cheung, Y.-L., and Fu, A.W.-C. 2002. An FP-tree approach for mining n-most interesting itemsets. In SPIE Conference on Data Mining."},{"key":"42_CR8","unstructured":"Cheung, Y.-L., and Fu, A.W.-C. 2004. Mining frequent itemsets without support threshold: with and without item constraints. In IEEE Trans. on Knowledge and Data Engineering."},{"key":"42_CR9","doi-asserted-by":"crossref","unstructured":"Datar, M., Gionis, A., Indyk, P., and Motwani, R. 2002. Maintaining stream statistics over sliding windows. In SIAM Journal on Computing.","DOI":"10.1137\/S0097539701398363"},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Demaine, E., Lopez-Ortiz, A., and Munro, J. 2002. Frequency estimation of internet packet streams with limited space. In Proc. of 10th Annual European Symposium on Algorithms.","DOI":"10.1007\/3-540-45749-6_33"},{"key":"42_CR11","unstructured":"Fu, A.W.-C., Kwong, F.W.-W., and Tang, J. 2000. Mining N-most interesting itemesets. In ISMIS."},{"key":"42_CR12","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., and Yu, P. 2003. Mining frequent patterns in data streams at multiple time granularities. In Next Generation Data Mining."},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Gibbons, P.B. and Matias, Y. 1998. New sampling-based summary statistics for improving approximate query answers. In SIGMOD.","DOI":"10.1145\/276304.276334"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Golab, L. and Ozsu, M.T. 2003. Processing sliding window multi-joins in continuous queries over data streams. In VLDB.","DOI":"10.1016\/B978-012722442-8\/50051-3"},{"key":"42_CR15","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., and Yin, Y. 2000. Mining frequent patterns without candidate generation. In SIGMOD.","DOI":"10.1145\/342009.335372"},{"key":"42_CR16","unstructured":"Han, J., Wang, J., Lu, Y., and Tzvetkov, P. 2002. Mining Top-K frequent closed patterns without minimum support. In ICDM."},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Hidber, C. 1999. Online association rule mining. In SIGMOD.","DOI":"10.1145\/304182.304195"},{"key":"42_CR18","doi-asserted-by":"crossref","unstructured":"Kohavi, R., Brodley, C., Frasca, B., Mason, L., and Zheng, Z. 2000. KDD-Cup 2000 Organizers Report: Peeling the Onion\u201d. In SIGKDD Exploration 2(2).","DOI":"10.1145\/380995.381033"},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Manku, G.S., and Motwani, R. 2002. Approximate frequency counts over data streams. In VLDB.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"42_CR20","doi-asserted-by":"crossref","unstructured":"Metwally, A., Agrawal, D., and Abbadi: A.E. 2005. Efficient computation of frequent and top- k elements in data streams. In ICDT.","DOI":"10.1007\/978-3-540-30570-5_27"},{"key":"42_CR21","unstructured":"Minnesota: 98. http:\/\/www.ipums.umn.edu\/usa\/samples.html. In Minnesota Population Center in Univ. of Minnesota IPUMS-98."},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Teng, W.-G., Chen, M.-S., and Yu, P.S. 2003. A regression-based temporal pattern mining scheme for data streams. In VLDB.","DOI":"10.1016\/B978-012722442-8\/50017-3"},{"key":"42_CR23","doi-asserted-by":"crossref","unstructured":"Vitter, J.S. 1985. Random sampling with a reservoir. In ACM Transactions on Mathematical Software (TOMS), 11(1).","DOI":"10.1145\/3147.3165"},{"key":"42_CR24","unstructured":"Wong, R.C.-W. and Fu, A.W.-C. 2005a. Mining top K-frequent patterns from data streams: A study. In Technical report, Computer Science and Engineering Department, Chinese University of Hong Kong."},{"key":"42_CR25","doi-asserted-by":"crossref","unstructured":"Wong, R.C.-W. and Fu, A.W.-C. 2005b. Mining top-K itemsets over a sliding window based on zipfian Distribution. In SIAM International Conference on Data Mining.","DOI":"10.1137\/1.9781611972757.52"},{"key":"42_CR26","doi-asserted-by":"crossref","unstructured":"Xu, J., Lin, X., and Zhou, X. 2004. Space efficient quantile summary for constrained sliding windows on a data stream. In The 5th Interntaional Conference on Web-Age Information Management.","DOI":"10.1007\/978-3-540-27772-9_5"},{"key":"42_CR27","doi-asserted-by":"crossref","unstructured":"Yu, J., Chong, Z., Lu, H., and Zhou, A. 2004. False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In VLDB.","DOI":"10.1016\/B978-012088469-8\/50021-8"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0042-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-006-0042-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-006-0042-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T03:45:40Z","timestamp":1736394340000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-006-0042-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,31]]},"references-count":27,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2006,9]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s10618-006-0042-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"type":"print","value":"1384-5810"},{"type":"electronic","value":"1573-756X"}],"subject":[],"published":{"date-parts":[[2006,5,31]]}}}