{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T18:23:48Z","timestamp":1725387828851},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2009,5,19]],"date-time":"2009-05-19T00:00:00Z","timestamp":1242691200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2010,5]]},"DOI":"10.1007\/s10115-009-0211-5","type":"journal-article","created":{"date-parts":[[2009,5,18]],"date-time":"2009-05-18T15:49:45Z","timestamp":1242661785000},"page":"225-242","source":"Crossref","is-referenced-by-count":15,"title":["TOPSIL-Miner: an efficient algorithm for mining top-K significant itemsets over data streams"],"prefix":"10.1007","volume":"23","author":[{"given":"Bei","family":"Yang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Houkuan","family":"Huang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,5,19]]},"reference":[{"key":"211_CR1","unstructured":"Agrawal R, SriKant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on very large databases, pp 487\u2013499"},{"key":"211_CR2","unstructured":"Babcock B, Babu S, Datar M et\u00a0al (2002) Models and issues in data streams. In: Proceedings of the 21st ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems, pp 1\u201316"},{"key":"211_CR3","doi-asserted-by":"crossref","unstructured":"Babcock B, Olston C (2003) Distributed top-K monitoring. In: Proceedings of the 2003 ACM SIGMOD international conference on management of data, pp 28\u201339","DOI":"10.1145\/872757.872764"},{"issue":"2","key":"211_CR4","first-page":"753","volume":"20","author":"JH Chang","year":"2004","unstructured":"Chang JH, Lee WS (2004) A sliding window method for finding recently frequent itemsets over online data streams. J Inform Sci Eng 20(2): 753\u2013762","journal-title":"J Inform Sci Eng"},{"issue":"8","key":"211_CR5","doi-asserted-by":"crossref","first-page":"849","DOI":"10.1016\/j.is.2005.04.001","volume":"31","author":"JH Chang","year":"2006","unstructured":"Chang JH, Lee WS (2006) Finding recently frequent itemsets adaptively over online transactional data streams. Inform Syst 31(8): 849\u2013869","journal-title":"Inform Syst"},{"issue":"9","key":"211_CR6","doi-asserted-by":"crossref","first-page":"1052","DOI":"10.1109\/TKDE.2004.44","volume":"16","author":"YL Cheung","year":"2004","unstructured":"Cheung YL, Fu AWC (2004) Mining frequent itemsets without support threshold: with and without item constraints. IEEE Trans Knowl Data Eng 16(9): 1052\u20131069","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"211_CR7","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10115-006-0003-0","volume":"10","author":"Y Chi","year":"2006","unstructured":"Chi Y, Wang H, Yu PS, Muntz RR (2006) Catch the moment: maintaining closed frequent itemsets over a data stream sliding window. Knowl Inform Syst 10(3): 265\u2013294","journal-title":"Knowl Inform Syst"},{"key":"211_CR8","doi-asserted-by":"crossref","first-page":"245","DOI":"10.1007\/s10115-007-0106-2","volume":"16","author":"XH Dang","year":"2008","unstructured":"Dang XH, Ng WK, Ong KL (2008) Online mining of frequent sets in data streams with error guarantee. Knowl Inform Syst 16: 245\u2013258","journal-title":"Knowl Inform Syst"},{"key":"211_CR9","unstructured":"Fu AWC, Kwong RWW, Tang J (2000) Mining N-most interesting itemsets. In: Proceedings of the international symposium on methodologies for intelligent systems, pp 59\u201367"},{"key":"211_CR10","doi-asserted-by":"crossref","unstructured":"Gibbons PB, Matias Y (1999) Synopsis data structures for massive data sets. In: Proceedings of the 10th annual ACM-SIAM symposium on discrete algorithms, pp 909\u2013910","DOI":"10.1090\/dimacs\/050\/02"},{"key":"211_CR11","doi-asserted-by":"crossref","unstructured":"Golab L, Dehaan D, Demaine E (2003) Identifying frequent items in sliding windows over on-line packet streams. In: Proceedings of ACM SIGCOMM internet measurement conference, pp 173\u2013178","DOI":"10.1145\/948205.948227"},{"key":"211_CR12","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of ACM SIGMOD international conference on management of data, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"issue":"4","key":"211_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/1391729.1391730","volume":"40","author":"IF Ilyas","year":"2008","unstructured":"Ilyas IF, Beskales G, Soliman MA (2008) A survey of top-k query processing techniques in relational database systems. ACM Comput Surv 40(4): 1\u201358 (Article 11)","journal-title":"ACM Comput Surv"},{"issue":"2","key":"211_CR14","first-page":"769","volume":"185","author":"LF Jia","year":"2007","unstructured":"Jia LF, Wang Z, Lu N et\u00a0al (2007) RFIMiner: a regression-based algorithm for recently frequent patterns in multiple time granularity data streams. Appl Math Comput. 185(2): 769\u2013783","journal-title":"Appl Math Comput."},{"key":"211_CR15","doi-asserted-by":"crossref","unstructured":"Jiang N, Gruenwald L (2006) CFI-Stream: mining closed frequent itemsets in data streams. In: Proceedings of the international conference on knowledge discovery and data mining, pp 592\u2013597","DOI":"10.1145\/1150402.1150473"},{"issue":"3","key":"211_CR16","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"CKS Leung","year":"2007","unstructured":"Leung CKS, Khan QI, Li Z et\u00a0al (2007) CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowl Inform Syst. 11(3): 287\u2013311","journal-title":"Knowl Inform Syst."},{"issue":"1","key":"211_CR17","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","volume":"17","author":"HF Li","year":"2008","unstructured":"Li HF, Shan MK, Lee SY (2008) DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Knowl Inform Syst. 17(1): 79\u201397","journal-title":"Knowl Inform Syst."},{"key":"211_CR18","doi-asserted-by":"crossref","unstructured":"Lin C, Chiu D, Wu Y et\u00a0al (2005) Mining frequent itemsets from data streams with a time-sensitive sliding window. In: Proceedings of the 5th international conference on data mining, pp 68\u201379","DOI":"10.1137\/1.9781611972757.7"},{"issue":"10","key":"211_CR19","doi-asserted-by":"crossref","first-page":"1738","DOI":"10.1360\/crad20061010","volume":"43","author":"X Liu","year":"2006","unstructured":"Liu X, Xu H, Dong Y (2006) Mining frequent closed catterns from a sliding window over data streams. J Comput Res Dev 43(10): 1738\u20131743 (in Chinese)","journal-title":"J Comput Res Dev"},{"key":"211_CR20","unstructured":"Metwally A, Agrawal D, Abbadi AE (2005) Efficient computation of frequent and top-k elements in data streams. In: Proceedings of the 10th international conference on databases theory, pp 398\u2013412"},{"issue":"4","key":"211_CR21","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1007\/s10115-004-0175-4","volume":"7","author":"P Tzvetkov","year":"2005","unstructured":"Tzvetkov P, Yan X, Han J (2005) Tsp: Mining top-k closed sequential patterns. Knowl Inform Syst. 7(4): 438\u2013457","journal-title":"Knowl Inform Syst."},{"issue":"5","key":"211_CR22","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J Wang","year":"2005","unstructured":"Wang J, Han J, Lu Y et\u00a0al (2005) TFP: an efficient algorithm for mining top-K frequent closed itemsets. IEEE Trans Knowl Data Eng. 17(5): 652\u2013664","journal-title":"IEEE Trans Knowl Data Eng."},{"issue":"2","key":"211_CR23","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/s10618-006-0042-x","volume":"13","author":"RCW Wong","year":"2006","unstructured":"Wong RCW, FU AWC (2006) Mining top-K frequent itemsets from data streams. Data Mining Knowl Discov. 13(2): 193\u2013217","journal-title":"Data Mining Knowl Discov."},{"key":"211_CR24","doi-asserted-by":"crossref","unstructured":"Zhu Y, Dennis S (2002) StatStream: statistical monitoring of thousands of data streams in real time. In: Proceedings of the international conference on very large data bases, pp 358\u2013369","DOI":"10.1016\/B978-155860869-6\/50039-1"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0211-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-009-0211-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-009-0211-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T10:10:19Z","timestamp":1559124619000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-009-0211-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,5,19]]},"references-count":24,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2010,5]]}},"alternative-id":["211"],"URL":"https:\/\/doi.org\/10.1007\/s10115-009-0211-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,5,19]]}}}