{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,13]],"date-time":"2025-12-13T07:22:12Z","timestamp":1765610532774,"version":"3.37.3"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T00:00:00Z","timestamp":1722729600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T00:00:00Z","timestamp":1722729600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF No. 2021R1A2C1009388"],"award-info":[{"award-number":["NRF No. 2021R1A2C1009388"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2024,10]]},"DOI":"10.1007\/s10115-024-02185-5","type":"journal-article","created":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T14:02:03Z","timestamp":1722780123000},"page":"5919-5958","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["An efficient approach for incremental erasable utility pattern mining from non-binary data"],"prefix":"10.1007","volume":"66","author":[{"given":"Yoonji","family":"Baek","sequence":"first","affiliation":[]},{"given":"Hanju","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Myungha","family":"Cho","sequence":"additional","affiliation":[]},{"given":"Hyeonmo","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Chanhee","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Taewoong","family":"Ryu","sequence":"additional","affiliation":[]},{"given":"Heonho","family":"Kim","sequence":"additional","affiliation":[]},{"given":"Bay","family":"Vo","sequence":"additional","affiliation":[]},{"given":"Vincent W.","family":"Gan","sequence":"additional","affiliation":[]},{"given":"Philippe","family":"Fournier-Viger","sequence":"additional","affiliation":[]},{"given":"Jerry Chun-Wei","family":"Lin","sequence":"additional","affiliation":[]},{"given":"Witold","family":"Pedrycz","sequence":"additional","affiliation":[]},{"given":"Unil","family":"Yun","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,8,4]]},"reference":[{"issue":"12","key":"2185_CR1","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong B, Lee Y (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2185_CR2","doi-asserted-by":"publisher","first-page":"103735","DOI":"10.1016\/j.engappai.2020.103735","volume":"94","author":"Y Baek","year":"2020","unstructured":"Baek Y, Yun U, Kim H, Nam H, Lee G, Yoon E, Vo B, Lin JC-W (2020) Erasable pattern mining based on tree structures with damped window over data streams. Eng Appl Artif Intell 94:103735","journal-title":"Eng Appl Artif Intell"},{"issue":"11","key":"2185_CR3","doi-asserted-by":"publisher","first-page":"1699","DOI":"10.1002\/int.22269","volume":"35","author":"Y Baek","year":"2020","unstructured":"Baek Y, Yun U, Lin JC-W, Yoon E, Fujita H (2020) Efficiently mining erasable stream patterns for intelligent systems over uncertain data. Int J Intell Syst 35(11):1699\u20131734","journal-title":"Int J Intell Syst"},{"key":"2185_CR4","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.eswa.2018.07.051","volume":"115","author":"H-J Choi","year":"2019","unstructured":"Choi H-J, Park CH (2019) Emerging topic detection in twitter stream based on high utility pattern mining. Expert Syst Appl 115:27\u201336","journal-title":"Expert Syst Appl"},{"key":"2185_CR5","doi-asserted-by":"crossref","unstructured":"Deng Z-H and Xu X (2010) An efficient algorithm for mining erasable itemsets. Advanced data mining and applications: 6th International Conference, vol. 1, pp. 214-225","DOI":"10.1007\/978-3-642-17316-5_20"},{"issue":"4","key":"2185_CR6","doi-asserted-by":"publisher","first-page":"4453","DOI":"10.1016\/j.eswa.2011.09.143","volume":"39","author":"Z-H Deng","year":"2012","unstructured":"Deng Z-H, Xu X (2012) Fast mining erasable itemsets using NC_sets. Expert Syst Appl 39(4):4453\u20134463","journal-title":"Expert Syst Appl"},{"key":"2185_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1016\/j.ins.2019.10.002","volume":"510","author":"W Ding","year":"2020","unstructured":"Ding W, Lin C-T, Liew AW-C, Triguero I, Luo W (2020) Current trends of granular data mining for biomedical data analysis. Inf Sci 510:341\u2013343","journal-title":"Inf Sci"},{"key":"2185_CR8","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/j.knosys.2018.04.001","volume":"152","author":"H Fasihy","year":"2018","unstructured":"Fasihy H, Shahraki MHN (2018) Incremental mining maximal frequent patterns from univariate uncertain data. Knowl-Based Syst 152:40\u201350","journal-title":"Knowl-Based Syst"},{"key":"2185_CR9","doi-asserted-by":"publisher","first-page":"1419","DOI":"10.1109\/ACCESS.2021.3139028","volume":"10","author":"MA Fouad","year":"2022","unstructured":"Fouad MA, Hussein W, Rady S, Yu PS, Gharib TF (2022) An efficient approach for mining reliable high utility patterns. IEEE Access 10:1419\u20131431","journal-title":"IEEE Access"},{"key":"2185_CR10","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1016\/j.ins.2019.10.033","volume":"513","author":"W Gan","year":"2020","unstructured":"Gan W, Lin JC-W, Zhang J, Chao H-C, Fujita H, Yu PS (2020) ProUM: projection-based utility mining on sequence data. Inf Sci 513:222\u2013240. https:\/\/doi.org\/10.1016\/j.ins.2019.10.033","journal-title":"Inf Sci"},{"key":"2185_CR11","doi-asserted-by":"publisher","first-page":"101927","DOI":"10.1016\/j.datak.2021.101927","volume":"136","author":"A Hidouri","year":"2021","unstructured":"Hidouri A, Jabbour S, Raddaoui B, Yaghlane BB (2021) Mining closed high utility itemsets based on propositional satisfiability. Data Knowl Eng 136:101927","journal-title":"Data Knowl Eng"},{"key":"2185_CR12","doi-asserted-by":"crossref","unstructured":"Hong T-P, Lee C-H and Wang S-L (2009) Mining high average-utility itemsets. 2009 IEEE International Conference on Systems, Man and Cybernetics, pp. 2526\u20132530","DOI":"10.1109\/ICSMC.2009.5346333"},{"key":"2185_CR13","doi-asserted-by":"publisher","first-page":"106029","DOI":"10.1109\/ACCESS.2021.3100584","volume":"9","author":"T-P Hong","year":"2021","unstructured":"Hong T-P, Huang W-M, Lan G-C, Chiang M-C, Lin JC-W (2021) A bitmap approach for mining erasable itemsets. IEEE Access 9:106029\u2013106038","journal-title":"IEEE Access"},{"key":"2185_CR14","doi-asserted-by":"crossref","unstructured":"Hong T-P, Chang H, Li S-M, and Tsai Y-C (2021) A dedicated temporal erasable-itemset mining algorithm. International conference on intelligent systems design and applications, pp. 977\u2013985","DOI":"10.1007\/978-3-030-96308-8_91"},{"key":"2185_CR15","doi-asserted-by":"publisher","first-page":"112993","DOI":"10.1016\/j.eswa.2019.112993","volume":"142","author":"HM Huynh","year":"2020","unstructured":"Huynh HM, Nguyen LTT, Vo B, Nguyen A, Tseng VS (2020) Efficient methods for mining weighted clickstream patterns. Expert Syst Appl 142:112993","journal-title":"Expert Syst Appl"},{"key":"2185_CR16","doi-asserted-by":"publisher","first-page":"118214","DOI":"10.1016\/j.eswa.2022.118214","volume":"209","author":"H Kim","year":"2022","unstructured":"Kim H, Ryu T, Lee C, Kim H, Yoon E, Vo B, Lin JC-W, Yun U (2022) HMIN: efficient approach of list based high-utility pattern mining with negative unit profits. Expert Syst Appl 209:118214","journal-title":"Expert Syst Appl"},{"key":"2185_CR17","doi-asserted-by":"publisher","first-page":"106653","DOI":"10.1016\/j.knosys.2020.106653","volume":"213","author":"H Kim","year":"2021","unstructured":"Kim H, Yun U, Baek Y, Kim H, Nam H, Lin JC-W, Fournier-Viger P (2021) Damped sliding based utility oriented pattern mining over stream data. Knowl-Based Syst 213:106653","journal-title":"Knowl-Based Syst"},{"key":"2185_CR18","doi-asserted-by":"publisher","first-page":"148","DOI":"10.1016\/j.eswa.2018.09.051","volume":"117","author":"S Krishnamoorthy","year":"2019","unstructured":"Krishnamoorthy S (2019) Mining top-k high utility itemsets with effective threshold raising strategies. Expert Syst Appl 117:148\u2013165","journal-title":"Expert Syst Appl"},{"key":"2185_CR19","doi-asserted-by":"crossref","unstructured":"Le T, Vo B and Coenen F (2013) An efficient algorithm for mining erasable itemsets using the difference of NC-sets. 2013 IEEE International conference on systems, man, and cybernetics, pp. 2270\u20132274","DOI":"10.1109\/SMC.2013.388"},{"key":"2185_CR20","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"},{"issue":"2","key":"2185_CR21","doi-asserted-by":"publisher","first-page":"478","DOI":"10.1007\/s10489-018-1280-5","volume":"49","author":"T Le","year":"2019","unstructured":"Le T, Vo B, Fournier-Viger P, Lee MY, Baik SW (2019) SPPC: a new tree structure for mining erasable patterns in data streams. Appl Intell 49(2):478\u2013495","journal-title":"Appl Intell"},{"key":"2185_CR22","doi-asserted-by":"publisher","first-page":"1288","DOI":"10.1016\/j.ins.2022.07.037","volume":"609","author":"C Lee","year":"2022","unstructured":"Lee C, Baek Y, Ryu T, Kim H, Kim H, Lin JC-W, Vo B, Yun U (2022) An efficient approach for mining maximized erasable utility patterns. Inf Sci 609:1288\u20131308","journal-title":"Inf Sci"},{"key":"2185_CR23","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"},{"key":"2185_CR24","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.future.2017.07.035","volume":"80","author":"G Lee","year":"2018","unstructured":"Lee G, Yun U (2018) Single-pass based efficient erasable pattern mining using list data structure on dynamic incremental databases. Futur Gener Comput Syst 80:12\u201328","journal-title":"Futur Gener Comput Syst"},{"issue":"3","key":"2185_CR25","doi-asserted-by":"publisher","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"},{"issue":"3","key":"2185_CR26","doi-asserted-by":"publisher","first-page":"1199","DOI":"10.1007\/s10115-019-01385-8","volume":"62","author":"JC-W Lin","year":"2020","unstructured":"Lin JC-W, Li T, Pirouz M, Zhang J, Fournier-Viger P (2020) High average-utility sequential pattern mining based on uncertain databases. Knowl Inf Syst 62(3):1199\u20131228","journal-title":"Knowl Inf Syst"},{"issue":"3","key":"2185_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3487046","volume":"16","author":"JC-W Lin","year":"2022","unstructured":"Lin JC-W, Djenouri Y, Srivastava G, Li Y, Yu PS (2022) Scalable mining of high-utility sequential patterns with three-tier mapreduce model. ACM Trans Knowl Discov Data 16(3):1\u201326. https:\/\/doi.org\/10.1145\/3487046","journal-title":"ACM Trans Knowl Discov Data"},{"key":"2185_CR28","doi-asserted-by":"publisher","first-page":"107422","DOI":"10.1016\/j.asoc.2021.107422","volume":"108","author":"JC-W Lin","year":"2021","unstructured":"Lin JC-W, Djenouri Y, Srivastava G, Yun U, Fournier-Viger P (2021) A predictive GA-based model for closed high-utility itemset mining. Appl Soft Comput 108:107422","journal-title":"Appl Soft Comput"},{"key":"2185_CR29","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao W and Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets, Adv Knowl Discover Data Mining, pp. 689-695","DOI":"10.1007\/11430919_79"},{"key":"2185_CR30","first-page":"4554","volume":"2019","author":"J Ma","year":"2019","unstructured":"Ma J, Zhang Y, Zhang L, Du B, Tao D (2019) Pseudo supervised matrix factorization in discriminative subspace. IJCAI 2019:4554\u20134560","journal-title":"IJCAI"},{"key":"2185_CR31","doi-asserted-by":"publisher","first-page":"113087","DOI":"10.1016\/j.eswa.2019.113087","volume":"143","author":"H Nam","year":"2020","unstructured":"Nam H, Yun U, Yoon E, Lin JC-W (2020) Efficient approach for incremental weighted erasable pattern mining with list structure. Expert Syst Appl 143:113087","journal-title":"Expert Syst Appl"},{"key":"2185_CR32","doi-asserted-by":"publisher","first-page":"107709","DOI":"10.1016\/j.knosys.2021.107709","volume":"237","author":"H Nguyen","year":"2022","unstructured":"Nguyen H, Le T, Nguyen M, Fournier-Viger P, Tseng VS, Vo B (2022) Mining frequent weighted utility itemsets in hierarchical quantitative databases. Knowl-Based Syst 237:107709","journal-title":"Knowl-Based Syst"},{"key":"2185_CR33","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.eswa.2019.01.034","volume":"124","author":"L Nguyen","year":"2019","unstructured":"Nguyen L, Nguyen G, Le B (2019) Fast algorithms for mining maximal erasable patterns. Expert Syst Appl 124:50\u201366","journal-title":"Expert Syst Appl"},{"issue":"9","key":"2185_CR34","doi-asserted-by":"publisher","first-page":"5477","DOI":"10.1002\/int.22799","volume":"37","author":"T Ryu","year":"2022","unstructured":"Ryu T, Yun U, Lee C, Lin JC-W, Pedrycz W (2022) Occupancy-based utility pattern mining in dynamic environments of intelligent systems. Int J Intell Syst 37(9):5477\u20135507","journal-title":"Int J Intell Syst"},{"key":"2185_CR35","doi-asserted-by":"publisher","first-page":"112863","DOI":"10.1016\/j.eswa.2019.112863","volume":"139","author":"S Simsek","year":"2020","unstructured":"Simsek S, Kursuncu U, Kibis E, AnisAbdellatif M, Dag A (2020) A hybrid data mining approach for identifying the temporal effects of variables associated with breast cancer survival. Expert Syst Appl 139:112863","journal-title":"Expert Syst Appl"},{"key":"2185_CR36","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.engappai.2019.05.010","volume":"85","author":"T Truong","year":"2019","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P (2019) FMaxCloHUSM: An efficient algorithm for mining frequent closed and maximal high utility sequences. Eng Appl Artif Intell 85:1\u201320","journal-title":"Eng Appl Artif Intell"},{"key":"2185_CR37","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/j.ins.2019.11.018","volume":"515","author":"T Truong","year":"2020","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P (2020) EHAUSM: An efficient algorithm for high average utility sequence mining. Inf Sci 515:302\u2013323","journal-title":"Inf Sci"},{"key":"2185_CR38","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2021.12.017","volume":"587","author":"NT Tung","year":"2022","unstructured":"Tung NT, Nguyen LTT, Nguyen TDD, Fournier-Viger P, Nguyen N-T, Vo B (2022) Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf Sci 587:41\u201362","journal-title":"Inf Sci"},{"issue":"1","key":"2185_CR39","doi-asserted-by":"publisher","first-page":"128","DOI":"10.1109\/TKDE.2019.2923211","volume":"33","author":"Z Wang","year":"2019","unstructured":"Wang Z, Du B, Tu W, Zhang L, Tao D (2019) Incorporating Distribution Matching into Uncertainty for Multiple Kernel Active Learning. IEEE Trans Knowl Data Eng 33(1):128\u2013142","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2185_CR40","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.knosys.2018.09.010","volume":"163","author":"X Xu","year":"2019","unstructured":"Xu X, Yin X, Chen X (2019) A large-group emergency risk decision method based on data mining of public attribute preferences. Knowl-Based Syst 163:495\u2013509","journal-title":"Knowl-Based Syst"},{"key":"2185_CR41","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":"2185_CR42","doi-asserted-by":"publisher","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","volume":"68","author":"U Yun","year":"2017","unstructured":"Yun U, Kim D (2017) Mining of high average-utility itemsets using novel list structure and pruning strategy. Futur Gener Comput Syst 68:346\u2013360","journal-title":"Futur Gener Comput Syst"},{"key":"2185_CR43","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"},{"key":"2185_CR44","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.future.2018.12.029","volume":"95","author":"U Yun","year":"2019","unstructured":"Yun U, Nam H, Lee G, Yoon E (2019) Efficient approach for incremental high utility pattern mining with indexed list structure. Futur Gener Comput Syst 95:221\u2013239","journal-title":"Futur Gener Comput Syst"},{"key":"2185_CR45","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1016\/j.engappai.2018.09.009","volume":"77","author":"L Zhang","year":"2019","unstructured":"Zhang L, Yang S, Wu X, Cheng F, Xie Y, Lin Z (2019) An indexed set representation based multi-objective evolutionary approach for mining diversified top-k high utility patterns. Eng Appl Artif Intell 77:9\u201320","journal-title":"Eng Appl Artif Intell"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02185-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10115-024-02185-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-024-02185-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T05:09:57Z","timestamp":1727068197000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10115-024-02185-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,4]]},"references-count":45,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["2185"],"URL":"https:\/\/doi.org\/10.1007\/s10115-024-02185-5","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"type":"print","value":"0219-1377"},{"type":"electronic","value":"0219-3116"}],"subject":[],"published":{"date-parts":[[2024,8,4]]},"assertion":[{"value":"6 April 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 August 2023","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 July 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"4 August 2024","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}