{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T21:44:52Z","timestamp":1767649492100},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2013,7,18]],"date-time":"2013-07-18T00:00:00Z","timestamp":1374105600000},"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":[[2014,2]]},"DOI":"10.1007\/s10844-013-0265-4","type":"journal-article","created":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T06:09:43Z","timestamp":1374041383000},"page":"111-131","source":"Crossref","is-referenced-by-count":23,"title":["Mining top-k frequent patterns over data streams sliding window"],"prefix":"10.1007","volume":"42","author":[{"given":"Hui","family":"Chen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,18]]},"reference":[{"key":"265_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, C.C. (2009). On high dimensional projected clustering of uncertain data streams. In Proceedings of the IEEE 25th International Conference on Data Engineering, ICDE\u201909 (pp.\u00a01152\u20131154). IEEE Press.","DOI":"10.1109\/ICDE.2009.188"},{"key":"265_CR2","unstructured":"Agrawal, R., & Srikant, R. (1994). Fast algorithms for mining association rules in large databases. In Proceedings of the 20th international conference on Very Large Data Bases, VLDB (pp.\u00a0487\u2013499)."},{"key":"265_CR3","doi-asserted-by":"crossref","unstructured":"Babcock, B., Babu, S., Datar, M., Motwani, R., Widom, J. (2002). Models and issues in data stream systems. In Proceedings of the 21st ACM SIGMOD-SIGACT-SIGART symposium on principles of database systems (pp.\u00a01\u201316). ACM Press.","DOI":"10.1145\/543613.543615"},{"issue":"8","key":"265_CR4","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.is.2005.04.001","volume":"31","author":"JH Chang","year":"2006","unstructured":"Chang, J.H. & Lee, W.S. (2006). Finding recently frequent itemsets adaptively over online transactional data streams. Information Systems, 31(8), 849\u2013869.","journal-title":"Information Systems"},{"key":"265_CR5","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/j.ins.2012.05.007","volume":"215","author":"H Chen","year":"2012","unstructured":"Chen, H., Shu, L.C., Xia, J., Deng, Q. (2012a). Mining frequent patterns in a varying-size sliding window of online transactional data streams. Information Sciences, 215, 15\u201336.","journal-title":"Information Sciences"},{"issue":"1","key":"265_CR6","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.ins.2011.09.004","volume":"183","author":"L Chen","year":"2012","unstructured":"Chen, L., Zou, L.-J., Tu, L. (2012b). A clustering algorithm for multiple data streams based on spectral component similarity. Information Sciences, 183(1), 35\u201347.","journal-title":"Information Sciences"},{"issue":"9","key":"265_CR7","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1109\/TKDE.2004.44","volume":"16","author":"Y-L Cheung","year":"2004","unstructured":"Cheung, Y.-L. & Fu, A.W.-C. (2004). Mining frequent itemsets without support threshold: with and without item constraints. IEEE Transactions on Knowledge and Data Engineering, 16(9), 1052\u20131069.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"265_CR8","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10618-006-0042-x","volume":"13","author":"AW-C Fu","year":"2006","unstructured":"Fu, A.W.-C. & Wong, R.C.-W. (2006). Mining top-k frequent itemsets from data streams. Data Mining and Knowledge Discovery, 13(2), 193\u2013217.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"265_CR9","unstructured":"Giannella, C., Han, J., Pei, J., Yan, X., Yu, P.S. (2003). Mining frequent patterns in data streams at multiple time granularities. Next generations on data mining (pp.\u00a0191\u2013212)."},{"key":"265_CR10","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 of management of data (pp.\u00a01\u201312). ACM Press.","DOI":"10.1145\/342009.335372"},{"key":"265_CR11","unstructured":"Han, J., Wang, J., Lu, Y., Tzvetkov, P. (2002). Mining top-k frequent closed patterns without minimum support. In Proceedings of the 2002 IEEE International Conference on Data Mining (ICDM\u201902) (pp.\u00a0211\u2013218). IEEE Press."},{"issue":"5","key":"265_CR12","doi-asserted-by":"crossref","first-page":"624","DOI":"10.1109\/TKDE.2008.181","volume":"21","author":"S Hashemi","year":"2009","unstructured":"Hashemi, S., Yang, Y., Mirzamomen, Z., Kangavari, M. (2009). Adapted one-versus-all decision trees for data stream classification. IEEE Transaction on Knowledge and Data Engineering, 21(5), 624\u2013637.","journal-title":"IEEE Transaction on Knowledge and Data Engineering"},{"issue":"24","key":"265_CR13","doi-asserted-by":"crossref","first-page":"4958","DOI":"10.1016\/j.ins.2010.08.024","volume":"180","author":"N Homem","year":"2010","unstructured":"Homem, N. & Carvalho, J.P. (2010). Finding top-k elements in data streams. Information Sciences, 180(24), 4958\u20134974.","journal-title":"Information Sciences"},{"issue":"1","key":"265_CR14","first-page":"532","volume":"2180","author":"K-F Jea","year":"2010","unstructured":"Jea, K.-F. & Li, C.-W. (2010). A sliding-window based adaptive approximating method to discover recent frequent itemsets from data streams. Lecture Notes in Engineering and Computer Science, 2180(1), 532\u2013539.","journal-title":"Lecture Notes in Engineering and Computer Science"},{"issue":"1","key":"265_CR15","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp, R.M., Shenker, S., Papadimitriou, C.H. (2003). A simple algorithm for finding frequent elements in streams and bags. ACM Transactions on Database Systems (TODS), 28(1), 51\u201355.","journal-title":"ACM Transactions on Database Systems (TODS)"},{"issue":"2","key":"265_CR16","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1007\/s10115-010-0342-8","volume":"29","author":"P Kranen","year":"2011","unstructured":"Kranen, P., Assent, I., Balduaf, C., Seidl, T. (2011). The clustree: indexing micro-clusters for anytime stream mining. Knowledge and Information Systems, 29(2), 249\u2013272.","journal-title":"Knowledge and Information Systems"},{"key":"265_CR17","unstructured":"Lam, H.T. & Calders, T. (2010). Mining top-k frequent items in a data stream with flexible sliding windows. In Proceedings of 16th ACM SIGKDD international conference on knowledge discovery and data mining (pp.\u00a0283\u2013292). ACM Press."},{"issue":"2","key":"265_CR18","first-page":"8:1","volume":"36","author":"Y-N Law","year":"2011","unstructured":"Law, Y.-N., Wang, H., Zaniolo, C. (2011). Rational languages and data models for continuous queries on sequence and data streams. ACM Transactions on Database Systems, 36(2), 8:1\u20138:32.","journal-title":"ACM Transactions on Database Systems"},{"key":"265_CR19","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S. & Khan, Q.I. (2006). Dstree: a tree structure for the mining of frequent sets from data streams. In Proceedings of the 6th International Conference on Data Mining (ICDM\u201906) (pp.\u00a0928\u2013932). IEEE Press.","DOI":"10.1109\/ICDM.2006.62"},{"key":"265_CR20","doi-asserted-by":"crossref","first-page":"4382","DOI":"10.1016\/j.eswa.2008.05.025","volume":"36","author":"H-F Li","year":"2009","unstructured":"Li, H.-F. (2009). A sliding window method for finding top-k path traversal patterns over streaming web click-sequences. Expert Systems with Applications, 36, 4382\u20134386.","journal-title":"Expert Systems with Applications"},{"issue":"1","key":"265_CR21","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","volume":"17","author":"H-F Li","year":"2008","unstructured":"Li, H.-F., Shan, M.-K., Lee, S.-Y. (2008). Dsm-fi: an efficient algorithm for mining frequent itemsets in data streams. Knowledge and Information Systems, 17(1), 79\u201397.","journal-title":"Knowledge and Information Systems"},{"key":"265_CR22","doi-asserted-by":"crossref","unstructured":"Manku, G.S. & Motwani, R. (2002). Approximate frequency counts over data streams. In Proceedings of the 28th VLDB conference (pp.\u00a0346\u2013357). VLDB.","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"265_CR23","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E. (2005). Efficient computation of frequent and top-k elements in data streams. In Proceedings of the 10th international conference on database theory (pp.\u00a0398\u2013412). Springer Press."},{"key":"265_CR24","doi-asserted-by":"crossref","unstructured":"Mozafari, B. & Hetal\u00a0Thakkar, C.Z. (2008). Verifying and mining frequent patterns from large windows over data streams. In Proceedings of the IEEE 24th International Conference on Data Engineering, ICDE\u201908, (pp.\u00a0179\u2013188). IEEE Press.","DOI":"10.1109\/ICDE.2008.4497426"},{"key":"265_CR25","doi-asserted-by":"crossref","unstructured":"Mozafari, B., Thakkar, H., Zaniolo, C. (2008). Verifying and mining frequent patterns from large windows over data streams. In Proceedings of IEEE 24th international conference of data engineering (pp.\u00a0179\u2013188). IEEE Press.","DOI":"10.1109\/ICDE.2008.4497426"},{"issue":"12","key":"265_CR26","doi-asserted-by":"crossref","first-page":"2375","DOI":"10.1016\/j.ins.2010.03.001","volume":"180","author":"NH Park","year":"2010","unstructured":"Park, N.H., Oh, S.H., Lee, W.S. (2010). Anomaly intrusion detection by clustering transactional audit streams in a host computer. Information Sciences, 180(12), 2375\u20132389.","journal-title":"Information Sciences"},{"issue":"22","key":"265_CR27","doi-asserted-by":"crossref","first-page":"3843","DOI":"10.1016\/j.ins.2009.07.012","volume":"179","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K. (2009). Sliding window-based frequent pattern mining over data streams. Information Sciences, 179(22), 3843\u20133865.","journal-title":"Information Sciences"},{"key":"265_CR28","doi-asserted-by":"crossref","first-page":"6968","DOI":"10.1016\/j.eswa.2010.03.023","volume":"37","author":"PSM Tsai","year":"2010","unstructured":"Tsai, P.S.M. (2010). Mining top-k frequent closed itemsets over data streams using the sliding window model. Expert Systems with Applications, 37, 6968\u20136973.","journal-title":"Expert Systems with Applications"},{"key":"265_CR29","doi-asserted-by":"crossref","unstructured":"Wong, R.C.-W. & Fu, A.W.-C. (2005). Mining top-k itemsets over sliding window based zipfian distribution. In Proceedings of the 2005 SIAM international conference on data mining. SIAM Press.","DOI":"10.1137\/1.9781611972757.52"},{"key":"265_CR30","doi-asserted-by":"crossref","first-page":"1986","DOI":"10.1016\/j.ins.2005.11.003","volume":"176","author":"JX Yu","year":"2006","unstructured":"Yu, J.X., Chong, Z., Lu, H., Zhangd, Z., Zhou, A. (2006). A false negative approach to mining frequent itemsets from high speed transactional data streams. Information Sciences, 176, 1986\u20132015.","journal-title":"Information Sciences"}],"container-title":["Journal of Intelligent Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0265-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10844-013-0265-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10844-013-0265-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,18]],"date-time":"2019-07-18T14:21:58Z","timestamp":1563459718000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10844-013-0265-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,18]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,2]]}},"alternative-id":["265"],"URL":"https:\/\/doi.org\/10.1007\/s10844-013-0265-4","relation":{},"ISSN":["0925-9902","1573-7675"],"issn-type":[{"value":"0925-9902","type":"print"},{"value":"1573-7675","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,18]]}}}