{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T16:58:46Z","timestamp":1759683526755},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2017,1,24]],"date-time":"2017-01-24T00:00:00Z","timestamp":1485216000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["World Wide Web"],"published-print":{"date-parts":[[2017,9]]},"DOI":"10.1007\/s11280-017-0433-5","type":"journal-article","created":{"date-parts":[[2017,1,24]],"date-time":"2017-01-24T10:44:19Z","timestamp":1485254659000},"page":"1111-1133","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Novel structures for counting frequent items in time decayed streams"],"prefix":"10.1007","volume":"20","author":[{"given":"Shanshan","family":"Wu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huaizhong","family":"Lin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Leong Hou","family":"U","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yunjun","family":"Gao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dongming","family":"Lu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,24]]},"reference":[{"issue":"1","key":"433_CR1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10115-009-0205-3","volume":"23","author":"LM Aouad","year":"2010","unstructured":"Aouad, L. M., Le-Khac, N. A., Kechadi, T. M.: Performance study of distributed apriori-like frequent itemsets mining. Knowl. Inf. Syst. 23(1), 55\u201372 (2010)","journal-title":"Knowl. Inf. Syst."},{"issue":"1","key":"433_CR2","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10115-009-0212-4","volume":"21","author":"M Boley","year":"2009","unstructured":"Boley, M., Grosskreutz, H.: Approximating the number of frequent sets in dense data. Knowl. Inf. Syst. 21(1), 65\u201389 (2009)","journal-title":"Knowl. Inf. Syst."},{"key":"433_CR3","doi-asserted-by":"crossref","unstructured":"Brijs, T., Swinnen, G., Vanhoof, K., Wets, G.: Using association rules for product assortment decisions: a case study. In: SIGKDD, pp. 254\u2013260. ACM (1999)","DOI":"10.1145\/312129.312241"},{"key":"433_CR4","unstructured":"Chakrabarti, A., Cormode, G., McGregor, A.: A near-optimal algorithm for computing the entropy of a stream. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 328\u2013335. Society for Industrial and Applied Mathematics (2007)"},{"key":"433_CR5","doi-asserted-by":"crossref","unstructured":"Chang, J. H., Lee, W. S.: Finding recent frequent itemsets adaptively over online data streams. In: SIGKDD, pp. 487\u2013492. ACM (2003)","DOI":"10.1145\/956750.956807"},{"key":"433_CR6","doi-asserted-by":"crossref","unstructured":"Charikar, M., Chen, K., Farach-Colton, M.: Finding frequent items in data streams. In: Automata, Languages and Programming, pp. 693\u2013703. Springer (2002)","DOI":"10.1007\/3-540-45465-9_59"},{"key":"433_CR7","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1016\/j.ins.2013.09.007","volume":"257","author":"L Chen","year":"2014","unstructured":"Chen, L., Mei, Q.: Mining frequent items in data stream using time fading model. Inform. Sci. 257, 54\u201369 (2014)","journal-title":"Inform. Sci."},{"key":"433_CR8","doi-asserted-by":"crossref","unstructured":"Chen, L., Zhang, S., Tu, L.: An algorithm for mining frequent items on data stream using fading factor. In: COMPSAC, vol. 2, pp. 172\u2013177. IEEE (2009)","DOI":"10.1109\/COMPSAC.2009.130"},{"issue":"1","key":"433_CR9","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.: A clustering algorithm for multiple data streams based on spectral component similarity. Inform. Sci. 183(1), 35\u201347 (2012)","journal-title":"Inform. Sci."},{"issue":"10","key":"433_CR10","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1145\/1562764.1562789","volume":"52","author":"G Cormode","year":"2009","unstructured":"Cormode, G., Hadjieleftheriou, M.: Finding the frequent items in streams of data. Commun. ACM 52(10), 97\u2013105 (2009)","journal-title":"Commun. ACM"},{"issue":"1","key":"433_CR11","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. Journal of Algorithms 55(1), 58\u201375 (2005)","journal-title":"Journal of Algorithms"},{"issue":"1","key":"433_CR12","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1145\/1061318.1061325","volume":"30","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: tracking most frequent items dynamically. ACM Trans. Database Syst. 30(1), 249\u2013278 (2005)","journal-title":"ACM Trans. Database Syst."},{"key":"433_CR13","doi-asserted-by":"crossref","unstructured":"Cormode, G., Shkapenyuk, V., Srivastava, D., Xu, B.: Forward decay: a practical time decay model for streaming systems. In: ICDE, pp. 138\u2013149. IEEE (2009)","DOI":"10.1109\/ICDE.2009.65"},{"issue":"12","key":"433_CR14","doi-asserted-by":"crossref","first-page":"701","DOI":"10.1145\/355588.365103","volume":"7","author":"RW Floyd","year":"1964","unstructured":"Floyd, R. W.: Algorithm 245: Treesort. Commun. ACM 7(12), 701 (1964)","journal-title":"Commun. ACM"},{"key":"433_CR15","doi-asserted-by":"crossref","unstructured":"Golab, L., DeHaan, D., Demaine, E. D., Lopez-Ortiz, A., Munro, J. I.: Identifying frequent items in sliding windows over on-line packet streams. In: SIGCOMM, pp. 173\u2013178. ACM (2003)","DOI":"10.1145\/948205.948227"},{"issue":"24","key":"433_CR16","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.: Finding top-k elements in data streams. Inform. Sci. 180(24), 4958\u20134974 (2010)","journal-title":"Inform. Sci."},{"key":"433_CR17","doi-asserted-by":"crossref","unstructured":"Jin, C., Qian, W., Sha, C., Yu, J. X., Zhou, A.: Dynamically maintaining frequent items over a data stream. In: CIKM, pp. 287\u2013294. ACM (2003)","DOI":"10.1145\/956863.956918"},{"issue":"1","key":"433_CR18","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.: A simple algorithm for finding frequent elements in streams and bags. ACM Trans. Database Syst. 28(1), 51\u201355 (2003)","journal-title":"ACM Trans. Database Syst."},{"issue":"3","key":"433_CR19","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1007\/s10115-010-0330-z","volume":"28","author":"HF Li","year":"2011","unstructured":"Li, H. F., Huang, H. Y., Lee, S. Y.: Fast and memory efficient mining of high-utility itemsets from data streams: with and without negative item profits. Knowl. Inf. Syst. 28(3), 495\u2013522 (2011)","journal-title":"Knowl. Inf. Syst."},{"key":"433_CR20","doi-asserted-by":"crossref","unstructured":"Lim, Y., Choi, J., Kang, U.: Fast, accurate, and space-efficient tracking of time-weighted frequent items from data streams. In: CIKM, pp. 1109\u20131118. ACM (2014)","DOI":"10.1145\/2661829.2662006"},{"issue":"4","key":"433_CR21","doi-asserted-by":"crossref","first-page":"497","DOI":"10.1007\/s11280-010-0094-0","volume":"13","author":"Z Lin","year":"2010","unstructured":"Lin, Z., Jiang, B., Pei, J., Jiang, D.: Mining discriminative items in multiple data streams. World Wide Web Journal 13(4), 497\u2013522 (2010)","journal-title":"World Wide Web Journal"},{"issue":"4","key":"433_CR22","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1016\/j.datak.2008.11.001","volume":"68","author":"N Manerikar","year":"2009","unstructured":"Manerikar, N., Palpanas, T.: Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl. Eng. 68(4), 415\u2013430 (2009)","journal-title":"Data Knowl. Eng."},{"key":"433_CR23","doi-asserted-by":"crossref","unstructured":"Manku, G. S., Motwani, R.: Approximate Frequency Counts over Data Streams. In: VLDB, pp. 346\u2013357. VLDB Endowment (2002)","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"433_CR24","doi-asserted-by":"crossref","unstructured":"Mei, Q. L., Chen, L.: An algorithm for mining frequent stream data items using hash function and fading factor. In: Applied Mechanics and Materials, vol. 130, pp. 2661\u20132665. Trans Tech Publ (2012)","DOI":"10.4028\/www.scientific.net\/AMM.130-134.2661"},{"issue":"3","key":"433_CR25","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1145\/1166074.1166084","volume":"31","author":"A Metwally","year":"2006","unstructured":"Metwally, A., Agrawal, D., Abbadi, A. E.: An integrated efficient solution for computing frequent and top-k elements in data streams. ACM Trans. Database Syst. 31(3), 1095\u20131133 (2006)","journal-title":"ACM Trans. Database Syst."},{"key":"433_CR26","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1016\/j.ins.2012.02.034","volume":"220","author":"A Shaker","year":"2013","unstructured":"Shaker, A., Senge, R., H\u00fcllermeier, E.: Evolving fuzzy pattern trees for binary classification on data streams. Inform. Sci. 220, 34\u201345 (2013)","journal-title":"Inform. Sci."},{"key":"433_CR27","doi-asserted-by":"crossref","unstructured":"Tantono, F. I., Manerikar, N., Palpanas, T.: Efficiently discovering recent frequent items in data streams. In: Scientific and Statistical Database Management, pp. 222\u2013239. Springer (2008)","DOI":"10.1007\/978-3-540-69497-7_16"},{"key":"433_CR28","doi-asserted-by":"crossref","unstructured":"Tong, Y., Zhang, X., Chen, L.: Tracking frequent items over distributed probabilistic data. World Wide Web Journal, 1\u201326 (2015)","DOI":"10.1007\/s11280-015-0341-5"},{"key":"433_CR29","doi-asserted-by":"crossref","unstructured":"Wei, Z., Liu, X., Li, F., Shang, S., Du, X., Wen, J.: Matrix sketching over sliding windows. In: SIGMOD, pp. 1465\u20131480 (2016)","DOI":"10.1145\/2882903.2915228"},{"issue":"10","key":"433_CR30","doi-asserted-by":"crossref","first-page":"1418","DOI":"10.1109\/TKDE.2008.233","volume":"21","author":"HJ Woo","year":"2009","unstructured":"Woo, H. J., Lee, W. S.: Estmax: Tracing maximal frequent item sets instantly over online transactional data streams. IEEE Trans. Knowl. Data Eng. 21(10), 1418\u20131431 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"433_CR31","doi-asserted-by":"crossref","unstructured":"Wu, S., Lin, H., U, L.H., Gao, Y., Lu, D.: Finding frequent items in time decayed data streams. In: Apweb, pp. 17\u201329 (2016)","DOI":"10.1007\/978-3-319-45817-5_2"},{"key":"433_CR32","doi-asserted-by":"crossref","unstructured":"Zhang, S., Chen, L., Tu, L.: Frequent items mining on data stream based on time fading factor. In: AICI, vol. 4, pp. 336\u2013340. IEEE (2009)","DOI":"10.1109\/AICI.2009.369"},{"key":"433_CR33","doi-asserted-by":"crossref","unstructured":"Zhang, S., Chen, L., Tu, L.: Frequent items mining on data stream using hash-table and heap. In: ICIS, vol. 1, pp. 141\u2013145. IEEE (2009)","DOI":"10.1109\/ICICISYS.2009.5357918"}],"container-title":["World Wide Web"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11280-017-0433-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-017-0433-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11280-017-0433-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T22:53:34Z","timestamp":1568760814000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11280-017-0433-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,24]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2017,9]]}},"alternative-id":["433"],"URL":"https:\/\/doi.org\/10.1007\/s11280-017-0433-5","relation":{},"ISSN":["1386-145X","1573-1413"],"issn-type":[{"value":"1386-145X","type":"print"},{"value":"1573-1413","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,24]]}}}