{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:30:37Z","timestamp":1760707837135},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2007,6,20]],"date-time":"2007-06-20T00:00:00Z","timestamp":1182297600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Intell Inf Syst"],"published-print":{"date-parts":[[2008,12]]},"DOI":"10.1007\/s10844-007-0042-3","type":"journal-article","created":{"date-parts":[[2007,6,19]],"date-time":"2007-06-19T20:41:58Z","timestamp":1182285718000},"page":"191-215","source":"Crossref","is-referenced-by-count":33,"title":["Maintaining frequent closed itemsets over a sliding window"],"prefix":"10.1007","volume":"31","author":[{"given":"James","family":"Cheng","sequence":"first","affiliation":[]},{"given":"Yiping","family":"Ke","sequence":"additional","affiliation":[]},{"given":"Wilfred","family":"Ng","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,20]]},"reference":[{"key":"42_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., & Swami, A.\u00a0N. (1993). Mining association rules between sets of items in large databases. In SIGMOD, (pp. 207\u2013216).","DOI":"10.1145\/170036.170072"},{"key":"42_CR2","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In VLDB, (pp. 487\u2013499)."},{"key":"42_CR3","doi-asserted-by":"crossref","unstructured":"Chang, J.\u00a0H., & Lee, W.\u00a0S. (2003). Finding recent frequent itemsets adaptively over online data streams. In KDD, (pp. 487\u2013492).","DOI":"10.1145\/956750.956807"},{"issue":"4","key":"42_CR4","first-page":"753","volume":"20","author":"J. H. Chang","year":"2004","unstructured":"Chang, J.\u00a0H., & Lee, W.\u00a0S. (2004). A sliding window method for finding recently frequent itemsets over online data streams. Journal of Information Science and Engineering, 20(4), 753\u2013762.","journal-title":"Journal of Information Science and Engineering"},{"key":"42_CR5","doi-asserted-by":"crossref","unstructured":"Chen, Y., Dong, G., Han, J., Wah, B.\u00a0W., & Wang, J. (2002). Multi-dimensional regression analysis of time-series data streams. In VLDB, (pp. 323\u2013334).","DOI":"10.1016\/B978-155860869-6\/50036-6"},{"key":"42_CR6","unstructured":"Chi, Y., Wang, H., Yu, P.\u00a0S., & Muntz, R.\u00a0R. (2004). Moment: Maintaining closed frequent itemsets over a stream sliding window. In ICDM, (pp. 59\u201366)."},{"key":"42_CR7","unstructured":"FIMI Dataset Repository (2003). Frequent itemset mining dataset repository. http:\/\/fimi.cs.helsinki.fi\/data\/ ."},{"key":"42_CR8","doi-asserted-by":"crossref","unstructured":"Garofalakis, M.\u00a0N., Gehrke, J., & Rastogi, R. (2002). Querying and mining data streams: You only get one look a tutorial. In SIGMOD, (p. 63).","DOI":"10.1145\/564691.564794"},{"key":"42_CR9","volume-title":"Mining frequent patterns in data streams at multiple time granularities","author":"C. Giannella","year":"2004","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., & Yu, P.\u00a0S. (2004). Mining frequent patterns in data streams at multiple time granularities. Cambridge, MA: MIT Press."},{"key":"42_CR10","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., & Yin, Y. (2000). Mining frequent patterns without candidate generation. In SIGMOD, (pp. 1\u201312).","DOI":"10.1145\/342009.335372"},{"key":"42_CR11","unstructured":"IBM Quest (1996). Ibm quest data mining project. frequent itemset mining dataset repository. http:\/\/www.almaden.ibm.com\/software\/quest\/ ."},{"key":"42_CR12","doi-asserted-by":"crossref","unstructured":"Jiang, N. & Gruenwald, L. (2006). CFI-Stream: Mining closed frequent itemsets in data streams. In KDD, (pp. 592\u2013597).","DOI":"10.1145\/1150402.1150473"},{"key":"42_CR13","doi-asserted-by":"crossref","unstructured":"Kifer, D., Ben-David, S., & Gehrke, J. (2004). Detecting change in data streams. In VLDB, (pp. 180\u2013191).","DOI":"10.1016\/B978-012088469-8.50019-X"},{"key":"42_CR14","doi-asserted-by":"crossref","unstructured":"Lee, C.-H., Lin, C.-R., & Chen, M.-S. (2001). Sliding-window filtering: An efficient algorithm for incremental mining. In CIKM, (pp. 263\u2013270).","DOI":"10.1145\/502585.502630"},{"key":"42_CR15","unstructured":"Li, H., Lee, S., & Shan, M. (2004). Algorithm for mining frequent itemsets over the entire history of data streams. In Proc. of First International Workshop on Knowledge Discovery in Data Streams."},{"key":"42_CR16","doi-asserted-by":"crossref","unstructured":"Manku, G.\u00a0S. & Motwani, R. (2002). Approximate frequency counts over data streams. In VLDB, pages 346\u2013357.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"42_CR17","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In ICDT, (pp. 398\u2013416).","DOI":"10.1007\/3-540-49257-7_25"},{"key":"42_CR18","unstructured":"Pei, J., Han, J., & Mao, R. (2000). CLOSET: An efficient algorithm for mining frequent closed itemsets. In ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, (pp. 21\u201330)."},{"key":"42_CR19","doi-asserted-by":"crossref","unstructured":"Wang, J., Han, J., & Pei, J. (2003). CLOSET+: Searching for the best strategies for mining frequent closed itemsets. In KDD, (pp. 236\u2013245).","DOI":"10.1145\/956750.956779"},{"key":"42_CR20","unstructured":"Yu, J.\u00a0X., Chong, Z., Lu, H., & Zhou, A. (2004). False positive or false negative: Mining frequent itemsets from high speed transactional data streams. In VLDB, (pp. 204\u2013215)."},{"key":"42_CR21","doi-asserted-by":"crossref","unstructured":"Zaki, M.\u00a0J. (2000). Generating non-redundant association rules. In KDD, (pp. 34\u201343).","DOI":"10.1145\/347090.347101"},{"key":"42_CR22","doi-asserted-by":"crossref","unstructured":"Zaki, M.\u00a0J., & Hsiao, C.-J. (2002). Charm: An efficient algorithm for closed itemset mining. In SDM.","DOI":"10.1137\/1.9781611972726.27"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-007-0042-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-007-0042-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-007-0042-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T02:10:46Z","timestamp":1559268646000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-007-0042-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,20]]},"references-count":22,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,12]]}},"alternative-id":["42"],"URL":"https:\/\/doi.org\/10.1007\/s10844-007-0042-3","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,20]]}}}