{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T08:46:09Z","timestamp":1758271569181},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2013,12,22]],"date-time":"2013-12-22T00:00:00Z","timestamp":1387670400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s10489-013-0487-8","type":"journal-article","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T20:07:48Z","timestamp":1387570068000},"page":"649-668","source":"Crossref","is-referenced-by-count":15,"title":["An efficient algorithm for incrementally mining frequent closed itemsets"],"prefix":"10.1007","volume":"40","author":[{"given":"Show-Jane","family":"Yen","sequence":"first","affiliation":[]},{"given":"Yue-Shi","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Chiu-Kuang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,12,22]]},"reference":[{"issue":"2","key":"487_CR1","doi-asserted-by":"crossref","first-page":"84","DOI":"10.1007\/s10489-007-0099-2","volume":"30","author":"M Adnan","year":"2009","unstructured":"Adnan M, Alhajj R (2009) DRFP-tree: disk resident frequent pattern tree. Appl Intell 30(2):84\u201397","journal-title":"Appl Intell"},{"key":"487_CR2","first-page":"487","volume-title":"Proc of international conference on very large data bases","author":"R Agrawal","year":"1994","unstructured":"Agrawal R, Srikant R (1994) Fast algorithm for mining association rules. In: Proc of international conference on very large data bases, pp 487\u2013499"},{"issue":"1","key":"487_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0092-4","volume":"16","author":"J Cheng","year":"2008","unstructured":"Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data streams. Knowl Inf Syst 16(1):1\u201327","journal-title":"Knowl Inf Syst"},{"key":"487_CR4","first-page":"59","volume-title":"Proc of 2004 IEEE international conference on data mining","author":"Y Chi","year":"2004","unstructured":"Chi Y, Wang H, Yu PS, Muntz RR (2004) Moment: maintaining closed itemsets over a stream sliding window. In: Proc of 2004 IEEE international conference on data mining, pp 59\u201366"},{"issue":"4","key":"487_CR5","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/j.knosys.2006.08.005","volume":"20","author":"J Donga","year":"2007","unstructured":"Donga J, Han M (2007) BitTableFI: an efficient mining frequent itemsets algorithm. Knowl-Based Syst 20(4):329\u2013335","journal-title":"Knowl-Based Syst"},{"key":"487_CR6","first-page":"91","volume-title":"Proceedings of next generation data mining","author":"C Giannella","year":"2003","unstructured":"Giannella C, Han J, Pei J (2003) Mining frequent patterns in data streams at multiple time granularities. In: Proceedings of next generation data mining. MIT Press, Cambridge, pp 91\u2013212"},{"key":"487_CR7","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Mao R, Pei J, Yin Y (2004) Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min Knowl Discov 8:53\u201387","journal-title":"Data Min Knowl Discov"},{"issue":"1","key":"487_CR8","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D, Yan X (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386","journal-title":"Data Min Knowl Discov"},{"key":"487_CR9","first-page":"382","volume-title":"Proc of CSSE 2008","author":"W Hou","year":"2008","unstructured":"Hou W, Yang B, Zhou Z, Wu C (2008) An adaptive frequent itemset mining algorithm for data stream with concept drifts. In: Proc of CSSE 2008, pp 382\u2013385"},{"key":"487_CR10","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1145\/1150402.1150473","volume-title":"Proc of 12th ACM SIGKDD international conference on knowledge discovery and data mining","author":"N Jiang","year":"2006","unstructured":"Jiang N, Gruenwald L (2006) CFI-stream: mining closed itemsets in data streams. In: Proc of 12th ACM SIGKDD international conference on knowledge discovery and data mining, pp 592\u2013597"},{"key":"487_CR11","first-page":"210","volume-title":"Proc of 5th IEEE international conference on data mining","author":"R Jin","year":"2005","unstructured":"Jin R, Agrawal G (2005) An algorithm for in-core frequent itemset mining on streaming data. In: Proc of 5th IEEE international conference on data mining, pp 210\u2013217"},{"key":"487_CR12","first-page":"417","volume-title":"Proceedings of the 12th international conference on database systems for advanced applications (DASFAA)","author":"JL Koh","year":"2004","unstructured":"Koh JL, Shieh SF (2004) An efficient approach for maintaining association rules based on adjusting FP-tree structures. In: Proceedings of the 12th international conference on database systems for advanced applications (DASFAA), pp 417\u2013424"},{"issue":"2","key":"487_CR13","doi-asserted-by":"crossref","first-page":"1466","DOI":"10.1016\/j.eswa.2007.11.061","volume":"36","author":"H-F Li","year":"2009","unstructured":"Li H-F, Lee S-Y (2009) Mining frequent itemsets over data streams using efficient window sliding techniques. Expert Syst Appl, Part 1 36(2):1466\u20131477","journal-title":"Expert Syst Appl, Part 1"},{"issue":"2","key":"487_CR14","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1023\/A:1021931008240","volume":"18","author":"B Liu","year":"2003","unstructured":"Liu B, Ma Y, Wong CK, Yu PS (2003) Scoring the data using association rules. Appl Intell 18(2):119\u2013135","journal-title":"Appl Intell"},{"key":"487_CR15","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/B978-155860869-6\/50038-X","volume-title":"Proc of 28th international conference on very large data bases","author":"GS Manku","year":"2002","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: Proc of 28th international conference on very large data bases, pp 346\u2013357"},{"key":"487_CR16","first-page":"398","volume-title":"Proc of 7th international conference on database theory","author":"N Pasquier","year":"1999","unstructured":"Pasquier N, Bastide Y, Taouil R, Lakhal L (1999) Discovering frequent closed itemsets for association rules. In: Proc of 7th international conference on database theory, pp 398\u2013416"},{"issue":"1","key":"487_CR17","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1007\/s10844-006-0002-3","volume":"28","author":"C Ra\u00efssi","year":"2007","unstructured":"Ra\u00efssi C, Poncelet P, Teisseire M (2007) Towards a new approach for mining frequent itemsets on data stream. J Intell Inf Syst 28(1):23\u201336","journal-title":"J Intell Inf Syst"},{"key":"487_CR18","first-page":"236","volume-title":"Proc of 9th ACM SIGKDD international conference on knowledge discovery and data mining","author":"J Wang","year":"2003","unstructured":"Wang J, Han J, Pei J (2003) CLOSET+: searching for the best strategies for mining frequent closed itemsets. In: Proc of 9th ACM SIGKDD international conference on knowledge discovery and data mining, pp 236\u2013245"},{"key":"487_CR19","volume-title":"Proc of IEEE international conference on industrial engineering and engineering management, December 2012","author":"SJ Yen","year":"2012","unstructured":"Yen SJ, Lee YS, Gu JY (2012) An efficient approach for updating the structure for mining frequent patterns. In: Proc of IEEE international conference on industrial engineering and engineering management, December 2012"},{"issue":"1","key":"487_CR20","first-page":"177","volume":"28","author":"SJ Yen","year":"2012","unstructured":"Yen SJ, Wang CK, Ouyang LY (2012) A search space algorithm for mining frequent patterns. J Inf Sci Eng 28(1):177\u2013191","journal-title":"J Inf Sci Eng"},{"key":"487_CR21","first-page":"99","volume-title":"Proc of SIAM international conference on data mining","author":"MJ Zaki","year":"2002","unstructured":"Zaki MJ, Hsiao CJ (2002) CHARM: an efficient algorithm for closed itemset mining. In: Proc of SIAM international conference on data mining, pp 99\u2013104"},{"issue":"1","key":"487_CR22","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1109\/TKDE.2006.10","volume":"18","author":"C Lucchese","year":"2006","unstructured":"Lucchese C, Orlando S, Perego R (2006) Fast and memory efficient mining of frequent closed itemsets. IEEE Trans Knowl Data Eng 18(1):21\u201336","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"487_CR23","unstructured":"IBM Almaden. Quest synthetic data generation code. http:\/\/www.almaden.ibm.com\/cs\/quest\/syndata.html"},{"key":"487_CR24","unstructured":"Microsoft Developer Network (MSDN). http:\/\/msdn.microsoft.com\/en-us\/library\/aa217032(v=sql.80).asp"},{"key":"487_CR25","unstructured":"Bache K, Lichman M (2013) UCI Machine Learning Repository [ http:\/\/archive.ics.uci.edu\/ml ]. Irvine, CA: University of California, School of Information and Computer Science"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0487-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-013-0487-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-013-0487-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T14:25:51Z","timestamp":1559139951000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-013-0487-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12,22]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["487"],"URL":"https:\/\/doi.org\/10.1007\/s10489-013-0487-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,12,22]]}}}