{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:38:32Z","timestamp":1762177112670,"version":"3.37.3"},"reference-count":48,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T00:00:00Z","timestamp":1535932800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Korean MSIT","award":["2015\u20130\u201300938"],"award-info":[{"award-number":["2015\u20130\u201300938"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2019,2]]},"DOI":"10.1007\/s10489-018-1280-5","type":"journal-article","created":{"date-parts":[[2018,9,3]],"date-time":"2018-09-03T03:02:47Z","timestamp":1535943767000},"page":"478-495","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":23,"title":["SPPC: a new tree structure for mining erasable patterns in data streams"],"prefix":"10.1007","volume":"49","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0909-4974","authenticated-orcid":false,"given":"Tuong","family":"Le","sequence":"first","affiliation":[]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Mi Young","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Sung Wook","family":"Baik","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,9,3]]},"reference":[{"issue":"3","key":"1280_CR1","first-page":"113","volume":"5","author":"V Agarwal","year":"2015","unstructured":"Agarwal V, Bharadwaj KK (2015) Predicting the dynamics of social circles in ego networks using pattern analysis and GA K-means clustering. WIREs: Data Min Knowl Discov 5(3):113\u2013141","journal-title":"WIREs: Data Min Knowl Discov"},{"key":"1280_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imielinski T, Swami AN (1993) Mining association rules between sets of items in large databases. In: ACM SIGMOD\u201993, pp 207\u2013216","DOI":"10.1145\/170035.170072"},{"issue":"5","key":"1280_CR3","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.eswa.2013.09.024","volume":"41","author":"P Alpar","year":"2014","unstructured":"Alpar P, Winkelstr\u00e4ter S (2014) Assessment of data quality in accounting data with association rules. Exp Syst Appl 41(5):2259\u20132268","journal-title":"Exp Syst Appl"},{"issue":"8","key":"1280_CR4","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1016\/j.is.2005.04.001","volume":"31","author":"J Chang","year":"2006","unstructured":"Chang J, Lee W (2006) Finding recently frequent itemsets adaptively over online transactional data streams. Inf Syst 31(8):849\u2013869","journal-title":"Inf Syst"},{"issue":"10","key":"1280_CR5","doi-asserted-by":"publisher","first-page":"1418","DOI":"10.1109\/TKDE.2008.233","volume":"21","author":"J Chang","year":"2009","unstructured":"Chang J, Lee W (2009) estMax: tracing maximal frequent itemsets instantly over online transactional data streams. IEEE Trans Knowl Data Eng 21(10):1418\u20131431","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"1280_CR6","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/s10844-013-0265-4","volume":"42","author":"H Chen","year":"2014","unstructured":"Chen H (2014) Mining top-k frequent patterns over data streams sliding window. J Intell Inf Syst 42(1):111\u2013131","journal-title":"J Intell Inf Syst"},{"key":"1280_CR7","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.ins.2012.05.007","volume":"215","author":"H Chen","year":"2012","unstructured":"Chen H, Shu L, Xia J, Deng Q (2012) Mining frequent patterns in a varying-size sliding-window of online transactional data streams. Inf Sci 215:15\u201336","journal-title":"Inf Sci"},{"issue":"2","key":"1280_CR8","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1177\/0165551511401539","volume":"37","author":"S-C Chiu","year":"2011","unstructured":"Chiu S-C, Li H-F, Huang J-L, You H-H (2011) Incremental mining of closed inter-transaction itemsets over data stream sliding windows. J Inf Sci 37(2):208\u2013220","journal-title":"J Inf Sci"},{"issue":"3","key":"1280_CR9","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/s10489-017-0973-5","volume":"48","author":"AM Dakhel","year":"2018","unstructured":"Dakhel AM, Malazi HT, Mahdavi M (2018) A social recommender system using item asymmetric correlation. Appl Intell 48(3):527\u2013540","journal-title":"Appl Intell"},{"issue":"4","key":"1280_CR10","doi-asserted-by":"publisher","first-page":"366","DOI":"10.1002\/int.21580","volume":"28","author":"ZH Deng","year":"2013","unstructured":"Deng ZH (2013) Mining top-rank-k erasable itemsets by PID_lists. Int J Intell Syst 28(4):366\u2013379","journal-title":"Int J Intell Syst"},{"key":"1280_CR11","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.asoc.2016.01.010","volume":"41","author":"ZH Deng","year":"2016","unstructured":"Deng ZH (2016) DiffNodesets: an efficient structure for fast mining frequent itemsets. Appl Soft Comput 41:214\u2013223","journal-title":"Appl Soft Comput"},{"issue":"4","key":"1280_CR12","doi-asserted-by":"publisher","first-page":"4453","DOI":"10.1016\/j.eswa.2011.09.143","volume":"39","author":"ZH Deng","year":"2012","unstructured":"Deng ZH, Xu XR (2012) Fast mining erasable itemsets using NC_sets. Exp Syst Appl 39(4):4453\u20134463","journal-title":"Exp Syst Appl"},{"key":"1280_CR13","unstructured":"Deng ZH, Fang G, Wang Z, Xu X (2009) Mining erasable itemsets. In: ICMLC\u201909, pp 67\u201373"},{"issue":"4","key":"1280_CR14","doi-asserted-by":"publisher","first-page":"571","DOI":"10.3233\/IDA-2011-0483","volume":"15","author":"M Deypir","year":"2011","unstructured":"Deypir M, Sadreddini MH (2011) EclatDS: an efficient sliding-window based frequent pattern mining method for data streams. Intell Data Anal 15(4):571\u2013587","journal-title":"Intell Data Anal"},{"issue":"5","key":"1280_CR15","first-page":"1001","volume":"29","author":"M Deypir","year":"2013","unstructured":"Deypir M, Sadreddini MH, Tarahomi M (2013) An efficient sliding-window based algorithm for adaptive frequent itemset mining over data streams. J Inf Sci Eng 29(5):1001\u20131020","journal-title":"J Inf Sci Eng"},{"key":"1280_CR16","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Vo B, Chi TT, Zhang J, Le HB (2017) A survey of itemset mining. WIREs Data Min Knowl Discov 7(4):e1207","DOI":"10.1002\/widm.1207"},{"key":"1280_CR17","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: ACM SIGMOD\u201900, pp 1\u201312","DOI":"10.1145\/342009.335372"},{"key":"1280_CR18","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/j.eswa.2016.02.045","volume":"57","author":"N Khader","year":"2016","unstructured":"Khader N, Lashier A, Yoon SW (2016) Pharmacy robotic dispensing and planogram analysis using association rule mining with prescription data. Exp Syst Appl 57:296\u2013310","journal-title":"Exp Syst Appl"},{"key":"1280_CR19","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/j.engappai.2013.09.002","volume":"27","author":"T Le","year":"2014","unstructured":"Le T, Vo B (2014) MEI: an efficient algorithm for mining erasable itemsets. Eng Appl Artif Intell 27:155\u2013166","journal-title":"Eng Appl Artif Intell"},{"key":"1280_CR20","doi-asserted-by":"crossref","unstructured":"Le T, Vo B, Coenen F (2013) An efficient algorithm for mining erasable itemsets using the difference of NC-Sets. In: SMC\u201913, pp 2270\u20132274","DOI":"10.1109\/SMC.2013.388"},{"issue":"5","key":"1280_CR21","first-page":"356","volume":"4","author":"T Le","year":"2014","unstructured":"Le T, Vo B, Nguyen G (2014) A survey of erasable itemset mining algorithms. WIREs: Data Min Knowl Discov 4(5):356\u2013 379","journal-title":"WIREs: Data Min Knowl Discov"},{"issue":"4","key":"1280_CR22","doi-asserted-by":"publisher","first-page":"79","DOI":"10.3390\/sym10040079","volume":"10","author":"T Le","year":"2018","unstructured":"Le T, Lee MY, Park JR, Baik SW (2018) Oversampling techniques for bankruptcy prediction: novel features from a transaction dataset. Symmetry 10(4):79","journal-title":"Symmetry"},{"key":"1280_CR23","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.knosys.2018.04.038","volume":"154","author":"HS Le","year":"2018","unstructured":"Le HS, Chiclana F, Kumar R, Mittal M, Khari M, Chatterjee JM, Baik SW (2018) ARM-AMO: an efficient association rule mining algorithm based on animal migration optimization. Knowl-Based Syst 154:68\u201380","journal-title":"Knowl-Based Syst"},{"key":"1280_CR24","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2017.09.010","volume":"68","author":"T Le","year":"2018","unstructured":"Le T, Vo B, Baik SW (2018) Efficient algorithms for mining top-rank-k erasable patterns using pruning strategies and the subsume concept. Eng Appl Artif Intell 68:1\u20139","journal-title":"Eng Appl Artif Intell"},{"issue":"5","key":"1280_CR25","doi-asserted-by":"crossref","first-page":"1327","DOI":"10.1007\/s10489-017-1123-9","volume":"48","author":"T Le","year":"2018","unstructured":"Le T, Nguyen A, Huynh B, Vo B, Pedrycz W (2018) Mining constrained inter-sequence patterns: a novel approach to cope with item constraints. Appl Intell 48(5):1327\u20131343","journal-title":"Appl Intell"},{"issue":"2","key":"1280_CR26","doi-asserted-by":"publisher","first-page":"694","DOI":"10.1016\/j.eswa.2013.07.094","volume":"41","author":"G Lee","year":"2014","unstructured":"Lee G, Yun U, Ryu K (2014) Sliding-window based weighted maximal frequent pattern mining over data streams. Exp Syst Appl 41(2):694\u2013708","journal-title":"Exp Syst Appl"},{"issue":"3","key":"1280_CR27","doi-asserted-by":"crossref","first-page":"1145","DOI":"10.3233\/IFS-141398","volume":"28","author":"G Lee","year":"2015","unstructured":"Lee G, Yun U, Ryang H (2015) Mining weighted erasable patterns by using underestimated constraint-based pruning technique. J Intell Fuzzy Syst 28(3):1145\u20131157","journal-title":"J Intell Fuzzy Syst"},{"key":"1280_CR28","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1016\/j.engappai.2016.03.003","volume":"52","author":"G Lee","year":"2016","unstructured":"Lee G, Yun U, Ryang H, Kim D (2016) Erasable itemset mining over incremental databases with weight conditions. Eng Appl Artif Intell 52:213\u2013234","journal-title":"Eng Appl Artif Intell"},{"issue":"1","key":"1280_CR29","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1007\/s10489-015-0703-9","volume":"44","author":"CW Lin","year":"2016","unstructured":"Lin CW, Gan W, Fournier-Viger P, Hong TP, Tseng VS (2016) Weighted frequent itemset mining over uncertain databases. Appl Intell 44(1):232\u2013250","journal-title":"Appl Intell"},{"key":"1280_CR30","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: VLDB\u201902, pp 346\u2013357"},{"key":"1280_CR31","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/j.datak.2014.11.004","volume":"95","author":"SJ Nanda","year":"2015","unstructured":"Nanda SJ, Panda G (2015) Design of computationally efficient density-based clustering algorithms. Data Knowl Eng 95:23\u201338","journal-title":"Data Knowl Eng"},{"key":"1280_CR32","doi-asserted-by":"crossref","unstructured":"Nguyen G, Le T, Vo B, Le B (2014) A new approach for mining top-rank-k erasable itemsets. In: ACIIDS\u201914, pp 73\u201382","DOI":"10.1007\/978-3-319-05476-6_8"},{"key":"1280_CR33","doi-asserted-by":"crossref","unstructured":"Nguyen G, Le T, Vo B, Le B (2015) Discovering erasable closed patterns. In: ACIIDS\u201915, pp 368\u2013376","DOI":"10.1007\/978-3-319-15702-3_36"},{"issue":"1","key":"1280_CR34","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10489-014-0644-8","volume":"43","author":"G Nguyen","year":"2015","unstructured":"Nguyen G, Le T, Vo B, Le B (2015) EIFDD: an efficient approach for erasable itemset mining of very dense datasets. Appl Intell 43(1):85\u201394","journal-title":"Appl Intell"},{"issue":"3","key":"1280_CR35","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1016\/j.jss.2012.10.011","volume":"86","author":"F Nori","year":"2013","unstructured":"Nori F, Deypir M, Sadreddini MH (2013) A sliding-window based algorithm for frequent closed itemset mining over data streams. J Syst Softw 86(3):615\u2013623","journal-title":"J Syst Softw"},{"key":"1280_CR36","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.eswa.2016.03.001","volume":"57","author":"H Ryang","year":"2016","unstructured":"Ryang H, Yun U (2016) High utility pattern mining over data streams with sliding-window technique. Expert Syst Appl 57:214\u2013231","journal-title":"Expert Syst Appl"},{"issue":"13","key":"1280_CR37","doi-asserted-by":"publisher","first-page":"5754","DOI":"10.1016\/j.eswa.2015.02.051","volume":"42","author":"J Sahoo","year":"2015","unstructured":"Sahoo J, Das AK, Goswami A (2015) An efficient approach for mining association rules from high utility itemsets. Exp Syst Appl 42(13):5754\u20135778","journal-title":"Exp Syst Appl"},{"issue":"10","key":"1280_CR38","doi-asserted-by":"publisher","first-page":"6968","DOI":"10.1016\/j.eswa.2010.03.023","volume":"37","author":"PSM Tsai","year":"2010","unstructured":"Tsai PSM (2010) Mining top-k frequent closed itemsets over data streams using the sliding-window model. Exp Syst Appl 37(10):6968\u20136973","journal-title":"Exp Syst Appl"},{"issue":"2","key":"1280_CR39","doi-asserted-by":"publisher","first-page":"253","DOI":"10.1007\/s13042-014-0252-2","volume":"7","author":"B Vo","year":"2016","unstructured":"Vo B, Le T, Coenen F, Hong TP (2016) Mining frequent itemsets using the N-list and subsume concepts. Int J Mach Learn Cybern 7(2):253\u2013265","journal-title":"Int J Mach Learn Cybern"},{"key":"1280_CR40","doi-asserted-by":"publisher","first-page":"3111","DOI":"10.1109\/ACCESS.2017.2676803","volume":"5","author":"B Vo","year":"2017","unstructured":"Vo B, Le T, Nguyen G, Hong TP (2017) Efficient algorithms for mining erasable closed patterns from product datasets. IEEE Access 5:3111\u20133120","journal-title":"IEEE Access"},{"key":"1280_CR41","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1016\/j.jlp.2016.03.022","volume":"41","author":"J Wang","year":"2016","unstructured":"Wang J, Li H, Huang J, Su C (2016) Association rules mining based analysis of consequential alarm sequences in chemical processes. J Loss Prev Process Ind 41:178\u2013185","journal-title":"J Loss Prev Process Ind"},{"issue":"14","key":"1280_CR42","doi-asserted-by":"publisher","first-page":"1986","DOI":"10.1016\/j.ins.2005.11.003","volume":"176","author":"JX Yu","year":"2006","unstructured":"Yu JX, Chong Z, Lu H, Zhang Z, Zhou A (2006) A false negative approach to mining frequent itemsets from high speed transactional data streams. Inf Sci 176(14):1986\u20132015","journal-title":"Inf Sci"},{"key":"1280_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.future.2015.12.012","volume":"59","author":"U Yun","year":"2016","unstructured":"Yun U, Lee G (2016) Sliding-window based weighted erasable stream pattern mining for stream data applications. Futur Gener Comput Syst 59:1\u201320","journal-title":"Futur Gener Comput Syst"},{"issue":"6","key":"1280_CR44","doi-asserted-by":"publisher","first-page":"3605","DOI":"10.3233\/IFS-162106","volume":"30","author":"U Yun","year":"2016","unstructured":"Yun U, Kim D, Ryang H, Lee G, Lee KM (2016) Mining recent high average utility patterns based on sliding-window from stream data. J Intell Fuzzy Syst 30(6):3605\u20133617","journal-title":"J Intell Fuzzy Syst"},{"key":"1280_CR45","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.03.016","volume":"124","author":"U Yun","year":"2017","unstructured":"Yun U, Ryang H, Lee G, Fujita H (2017) An efficient algorithm for mining high utility patterns from incremental databases with one database scan. Knowl-Based Syst 124:188\u2013206","journal-title":"Knowl-Based Syst"},{"key":"1280_CR46","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1016\/j.knosys.2017.12.029","volume":"144","author":"U Yun","year":"2018","unstructured":"Yun U, Kim D, Yoon E, Fujita H (2018) Damped window based high average utility pattern mining over data streams. Knowl-Based Syst 144:188\u2013205","journal-title":"Knowl-Based Syst"},{"issue":"4","key":"1280_CR47","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"MJ Zaki","year":"2005","unstructured":"Zaki MJ, Hsiao CJ (2005) Efficient algorithms for mining closed itemsets and their lattice structure. IEEE Trans Knowl Data Eng 17(4):462\u2013478","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1280_CR48","doi-asserted-by":"crossref","unstructured":"Zhi-Jun X, Hong C, Li C (2006) An efficient algorithm for frequent itemset mining on data streams. In: ICDM\u201906, pp 474\u2013491","DOI":"10.1007\/11790853_37"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10489-018-1280-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1280-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-018-1280-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,8]],"date-time":"2020-11-08T18:27:00Z","timestamp":1604860020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10489-018-1280-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9,3]]},"references-count":48,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2019,2]]}},"alternative-id":["1280"],"URL":"https:\/\/doi.org\/10.1007\/s10489-018-1280-5","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2018,9,3]]},"assertion":[{"value":"3 September 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}