{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:54:41Z","timestamp":1760709281989,"version":"3.41.0"},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,3,22]],"date-time":"2017-03-22T00:00:00Z","timestamp":1490140800000},"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":["Knowl Inf Syst"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s10115-017-1045-1","type":"journal-article","created":{"date-parts":[[2017,3,23]],"date-time":"2017-03-23T00:41:02Z","timestamp":1490229662000},"page":"391-422","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Time-weighted counting for recently frequent pattern mining in data streams"],"prefix":"10.1007","volume":"53","author":[{"given":"Yongsub","family":"Lim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"U.","family":"Kang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,3,22]]},"reference":[{"key":"1045_CR1","doi-asserted-by":"crossref","unstructured":"Arasu A, Manku GS (2004) Approximate counts and quantiles over sliding windows. In: PODS","DOI":"10.1145\/1055558.1055598"},{"key":"1045_CR2","doi-asserted-by":"crossref","unstructured":"Borgelt C, Yang X, Nogales-Cadenas R, Carmona-Saez P, Pascual-Montano A (2011) Finding closed frequent item sets by intersecting transactions. In: EDBT","DOI":"10.1145\/1951365.1951410"},{"key":"1045_CR3","doi-asserted-by":"crossref","unstructured":"Boyer RS, Moore JS (1991) Mjrty: a fast majority vote algorithm. In: Automated reasoning: essays in honor of Woody Bledsoe","DOI":"10.1007\/978-94-011-3488-0_5"},{"key":"1045_CR4","doi-asserted-by":"crossref","unstructured":"Brijs T, Swinnen G, Vanhoof K, Wets G (1999) Using association rules for product assortment decisions: a case study. In: Knowledge discovery and data mining","DOI":"10.1145\/312129.312241"},{"key":"1045_CR5","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.is.2012.01.005","volume":"39","author":"T Calders","year":"2014","unstructured":"Calders T, Dexters N, Gillis JJM, Goethals B (2014) Mining frequent itemsets in a stream. Inf Syst 39:233\u2013255","journal-title":"Inf Syst"},{"key":"1045_CR6","doi-asserted-by":"crossref","unstructured":"Chang JH, Lee WS (2003) Finding recent frequent itemsets adaptively over online data streams. In: KDD","DOI":"10.1145\/956750.956807"},{"issue":"6","key":"1045_CR7","first-page":"1588","volume":"87\u2013D","author":"J\u00a0H Chang","year":"2004","unstructured":"Chang J\u00a0H, Lee W\u00a0S (2004) Decaying obsolete information in finding recent frequent itemsets over data streams. IEICE Trans 87\u2013D(6):1588\u20131592","journal-title":"IEICE Trans"},{"key":"1045_CR8","doi-asserted-by":"crossref","unstructured":"Charikar M, Chen K, Farach-Colton M (2002) Finding frequent items in data streams. In: ICALP","DOI":"10.1007\/3-540-45465-9_59"},{"key":"1045_CR9","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 (2014) Mining frequent items in data stream using time fading model. Inf Sci 257:54\u201369","journal-title":"Inf Sci"},{"issue":"1","key":"1045_CR10","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/s00778-009-0172-z","volume":"19","author":"G Cormode","year":"2010","unstructured":"Cormode G, Hadjieleftheriou M (2010) Methods for finding frequent items in data streams. VLDB J 19(1):3\u201320","journal-title":"VLDB J"},{"key":"1045_CR11","doi-asserted-by":"crossref","unstructured":"Cormode G, Muthukrishnan S (2004a) An improved data stream summary: the count-min sketch and its applications. In: LATIN","DOI":"10.1007\/978-3-540-24698-5_7"},{"key":"1045_CR12","doi-asserted-by":"crossref","unstructured":"Cormode G, Muthukrishnan S (2004b) What\u2019s new: finding significant differences in network data streams. In: INFOCOM","DOI":"10.1109\/TNET.2005.860096"},{"key":"1045_CR13","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1016\/j.datak.2013.05.007","volume":"87","author":"M Dallachiesa","year":"2013","unstructured":"Dallachiesa M, Palpanas T (2013) Identifying streaming frequent items in ad hoc time windows. Data Knowl Eng 87:66\u201390","journal-title":"Data Knowl Eng"},{"key":"1045_CR14","doi-asserted-by":"crossref","unstructured":"Demaine ED, Lpez-Ortiz A, Munro JI (2002) Frequency estimation of internet packet streams with limited space. In: ESA","DOI":"10.1007\/3-540-45749-6_33"},{"issue":"4","key":"1045_CR15","doi-asserted-by":"crossref","first-page":"255","DOI":"10.1007\/s00779-005-0046-3","volume":"10","author":"N Eagle","year":"2006","unstructured":"Eagle N, Pentland A (2006) Reality mining: sensing complex social systems. Pers Ubiquitous Comput 10(4):255\u2013268","journal-title":"Pers Ubiquitous Comput"},{"issue":"4","key":"1045_CR16","doi-asserted-by":"crossref","first-page":"362","DOI":"10.1016\/0196-6774(82)90031-1","volume":"3","author":"MJ Fischer","year":"1982","unstructured":"Fischer MJ, Salzberg SL (1982) Finding a majority among $$n$$ n votes: solution to problem 81\u20135 (Journal of Algorithms, June 1981). J Algorithms 3(4):362\u2013380","journal-title":"J Algorithms"},{"key":"1045_CR17","doi-asserted-by":"crossref","unstructured":"Gibbons PB, Matias Y (1998) New sampling-based summary statistics for improving approximate query answers. In: SIGMOD","DOI":"10.1145\/276304.276334"},{"key":"1045_CR18","doi-asserted-by":"crossref","unstructured":"Golab L, DeHaan D, Demaine ED, L\u00f3pez-Ortiz A, Munro JI (2003) Identifying frequent items in sliding windows over on-line packet streams. In: Internet measurement conference","DOI":"10.1145\/948205.948227"},{"key":"1045_CR19","doi-asserted-by":"crossref","unstructured":"Golab L, DeHaan D, L\u00f3pez-Ortiz A, Demaine ED (2004) Finding frequent items in sliding windows with multinomially-distributed item frequencies. In: SSDBM","DOI":"10.1109\/SSDM.2004.1311242"},{"key":"1045_CR20","doi-asserted-by":"crossref","unstructured":"Jin C, Qian W, Sha C, Yu JX, Zhou A (2003) Dynamically maintaining frequent items over a data stream. In: CIKM","DOI":"10.1145\/956863.956918"},{"key":"1045_CR21","unstructured":"Jin R, Agrawal G (2005) An algorithm for in-core frequent itemset mining on streaming data. In: ICDM"},{"key":"1045_CR22","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1145\/762471.762473","volume":"28","author":"RM Karp","year":"2003","unstructured":"Karp RM, Shenker S, Papadimitriou CH (2003) A simple algorithm for finding frequent elements in streams and bags. ACM Trans Database Syst 28:51\u201355","journal-title":"ACM Trans Database Syst"},{"key":"1045_CR23","unstructured":"Lee D, Lee W (2005) Finding maximal frequent itemsets over online data streams adaptively. In: ICDM"},{"key":"1045_CR24","doi-asserted-by":"crossref","unstructured":"Leskovec J, Backstrom L, Kleinberg J (2009) Meme-tracking and the dynamics of the news cycle. In: KDD","DOI":"10.1145\/1557019.1557077"},{"key":"1045_CR25","first-page":"361","volume":"5","author":"DD Lewis","year":"2004","unstructured":"Lewis DD, Yang Y, Rose TG, Li F (2004) Rcv1: a new benchmark collection for text categorization research. J Mach Learn Res 5:361\u2013397","journal-title":"J Mach Learn Res"},{"key":"1045_CR26","unstructured":"Li H, Lee S, Shan M (2005) Online mining (recently) maximal frequent itemsets over data streams. In: 15th international workshop on research issues in data engineering"},{"issue":"1","key":"1045_CR27","first-page":"25","volume":"7","author":"H Li","year":"2012","unstructured":"Li H, Zhang N, Chen Z (2012) A simple but effective maximal frequent itemset mining algorithm over streams. JSW 7(1):25\u201332","journal-title":"JSW"},{"key":"1045_CR28","doi-asserted-by":"crossref","unstructured":"Lim Y, Choi J, Kang U (2014) Fast, accurate, and space-efficient tracking of time-weighted frequent items from data streams. In: CIKM","DOI":"10.1145\/2661829.2662006"},{"key":"1045_CR29","doi-asserted-by":"crossref","unstructured":"Lim Y, Jung M, Kang U (2017) Memory-efficient and accurate sampling for counting local triangles in graph streams: from simple to multigraphs. ACM Trans Knowl Discov Data 11(4)","DOI":"10.1145\/3022186"},{"key":"1045_CR30","doi-asserted-by":"crossref","unstructured":"Lim Y, Kang U (2015) Mascot: memory-efficient and accurate sampling for counting local triangles in graph streams. In: KDD","DOI":"10.1145\/2783258.2783285"},{"key":"1045_CR31","doi-asserted-by":"crossref","unstructured":"Liu H, Lu Y, Han J, He J (2006) Error-adaptive and time-aware maintenance of frequency counts over data streams. In: WAIM","DOI":"10.1007\/11775300_41"},{"issue":"4","key":"1045_CR32","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 (2009) Frequent items in streaming data: an experimental evaluation of the state-of-the-art. Data Knowl Eng 68(4):415\u2013430","journal-title":"Data Knowl Eng"},{"key":"1045_CR33","doi-asserted-by":"crossref","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: VLDB","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"1045_CR34","doi-asserted-by":"crossref","unstructured":"McAuley JJ, Leskovec J (2013) From amateurs to connoisseurs: modeling the evolution of user expertise through online reviews. In: WWW","DOI":"10.1145\/2488388.2488466"},{"key":"1045_CR35","doi-asserted-by":"crossref","unstructured":"Metwally A, Agrawal D, Abbadi AE (2005) Efficient computation of frequent and top-k elements in data streams. In: ICDT","DOI":"10.1007\/978-3-540-30570-5_27"},{"issue":"2","key":"1045_CR36","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0167-6423(82)90012-0","volume":"2","author":"J Misra","year":"1982","unstructured":"Misra J, Gries D (1982) Finding repeated elements. Sci Comput Program 2(2):143\u2013152","journal-title":"Sci Comput Program"},{"issue":"1","key":"1045_CR37","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1145\/3147.3165","volume":"11","author":"JS Vitter","year":"1985","unstructured":"Vitter JS (1985) Random sampling with a reservoir. ACM Trans Math Softw 11(1):37\u201357","journal-title":"ACM Trans Math Softw"},{"key":"1045_CR38","doi-asserted-by":"crossref","unstructured":"Yamamoto Y, Iwanuma K, Fukuda S (2014) Resource-oriented approximation for frequent itemset mining from bursty data streams. In: SIGMOD","DOI":"10.1145\/2588555.2612171"},{"key":"1045_CR39","doi-asserted-by":"crossref","unstructured":"Zhang S, Chen L, Tu L (2009a) Frequent items mining on data stream based on time fading factor. In: AICI","DOI":"10.1109\/AICI.2009.369"},{"key":"1045_CR40","doi-asserted-by":"crossref","unstructured":"Zhang S, Chen L, Tu L (2009b) Frequent items mining on data stream using hash-table and heap. In: ICIS","DOI":"10.1109\/ICICISYS.2009.5357918"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-017-1045-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1045-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-017-1045-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:13:41Z","timestamp":1750176821000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-017-1045-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,3,22]]},"references-count":40,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["1045"],"URL":"https:\/\/doi.org\/10.1007\/s10115-017-1045-1","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2017,3,22]]}}}