{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T04:09:02Z","timestamp":1778645342623,"version":"3.51.4"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T00:00:00Z","timestamp":1702944000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T00:00:00Z","timestamp":1702944000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2024,1]]},"DOI":"10.1007\/s10489-023-05145-8","type":"journal-article","created":{"date-parts":[[2023,12,19]],"date-time":"2023-12-19T19:02:27Z","timestamp":1703012547000},"page":"767-790","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["New approaches for mining high utility itemsets with multiple utility thresholds"],"prefix":"10.1007","volume":"54","author":[{"given":"Bao","family":"Huynh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"N. T.","family":"Tung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Trinh D. D.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cuong","family":"Trinh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vaclav","family":"Snasel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6440-6462","authenticated-orcid":false,"given":"Loan","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,19]]},"reference":[{"issue":"2","key":"5145_CR1","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal R, Imieli\u0144ski T, Swami A (1993) Mining association rules between sets of items in large databases. ACM SIGMOD Rec 22(2):207\u2013216","journal-title":"ACM SIGMOD Rec"},{"key":"5145_CR2","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/j.knosys.2018.07.031","volume":"161","author":"D Nguyen","year":"2018","unstructured":"Nguyen D, Luo W, Phung D, Venkatesh S (2018) LTARM: A novel temporal association rule mining method to understand toxicities in a routine cancer treatment. Knowl-Based Syst 161:313\u2013328","journal-title":"Knowl-Based Syst"},{"key":"5145_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2020.113670","volume":"161","author":"D Nguyen","year":"2020","unstructured":"Nguyen D, Luo W, Vo B, Pedrycz W (2020) Succinct contrast sets via false positive controlling with an application in clinical process redesign. Expert Syst Appl 161:113670","journal-title":"Expert Syst Appl"},{"key":"5145_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.107382","volume":"229","author":"D Nguyen","year":"2021","unstructured":"Nguyen D, Luo W, Vo B, Nguyen LTT, Pedrycz W (2021) Con2Vec: Learning embedding representations for contrast sets. Knowl-Based Syst 229:107382","journal-title":"Knowl-Based Syst"},{"key":"5145_CR5","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules in large Databases. In: Proceedings of the 20th international conference on very large data bases, vol 1215, p 487499"},{"issue":"3","key":"5145_CR6","doi-asserted-by":"publisher","first-page":"372","DOI":"10.1109\/69.846291","volume":"12","author":"MJ Zaki","year":"2000","unstructured":"Zaki MJ (2000) Scalable algorithms for association mining. IEEE Trans Knowl Data Eng 12(3):372\u2013390","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"1","key":"5145_CR7","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han J, Pei J, Yin Y, Mao R (2004) Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach. Data Min Knowl Disc 8(1):53\u201387","journal-title":"Data Min Knowl Disc"},{"key":"5145_CR8","doi-asserted-by":"publisher","unstructured":"Liu B, Hsu W, Ma Y (1999) Mining association rules with multiple minimum supports. In: Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 99, p 337341. https:\/\/doi.org\/10.1145\/312129.312274","DOI":"10.1145\/312129.312274"},{"issue":"1","key":"5145_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.dss.2004.09.007","volume":"42","author":"Y-H Hu","year":"2006","unstructured":"Hu Y-H, Chen Y-L (2006) Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism. Decis Support Syst 42(1):1\u201324","journal-title":"Decis Support Syst"},{"key":"5145_CR10","doi-asserted-by":"publisher","unstructured":"Yao H, Hamilton HJ, Butz CJ (2004) A Foundational approach to mining itemset utilities from databases. In: Proceedings of the 2004 SIAM international conference on data mining, vol 4, p 482486. https:\/\/doi.org\/10.1137\/1.9781611972740.51","DOI":"10.1137\/1.9781611972740.51"},{"issue":"8","key":"5145_CR11","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng VS, Shie B-EE, Wu C-WW, Yu PS (2013) Efficient Algorithms for Mining High Utility Itemsets from Transactional Databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"5145_CR12","doi-asserted-by":"crossref","unstructured":"Ahmed CF, Tanbeer SK (2009) Byeong-Soo Jeong, and Young-Koo Lee, \u201cEfficient Tree Structures for High Utility Pattern Mining in Incremental Databases.\u201d IEEE Trans Knowl Data Eng 21(12):1708\u20131721","DOI":"10.1109\/TKDE.2009.46"},{"issue":"1","key":"5145_CR13","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1186\/1471-2105-14-230","volume":"14","author":"Y-C Liu","year":"2013","unstructured":"Liu Y-C, Cheng C-P, Tseng VS (2013) Mining differential top-k co-expression patterns from time course comparative gene expression datasets. BMC Bioinformatics 14(1):230","journal-title":"BMC Bioinformatics"},{"key":"5145_CR14","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1016\/j.protcy.2012.10.053","volume":"6","author":"M Thilagu","year":"2012","unstructured":"Thilagu M, Nadarajan R (2012) Efficiently Mining of Effective Web Traversal Patterns with Average Utility. Procedia Technol 6:444\u2013451","journal-title":"Procedia Technol"},{"key":"5145_CR15","doi-asserted-by":"publisher","unstructured":"Belghith K, Fournier-Viger P, Jawadi J (2022) Hui2Vec: learning transaction embedding through high utility itemsets. In: lecture notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol 13773. LNCS, p 211224. https:\/\/doi.org\/10.1007\/978-3-031-24094-2_15","DOI":"10.1007\/978-3-031-24094-2_15"},{"key":"5145_CR16","doi-asserted-by":"publisher","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol 3518. LNAI, Springer-Verlag, p 689695. https:\/\/doi.org\/10.1007\/11430919_79","DOI":"10.1007\/11430919_79"},{"key":"5145_CR17","doi-asserted-by":"publisher","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (2010) UP-Growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, p 253262. https:\/\/doi.org\/10.1145\/1835804.1835839","DOI":"10.1145\/1835804.1835839"},{"issue":"2","key":"5145_CR18","first-page":"164","volume":"5","author":"B Le","year":"2011","unstructured":"Le B, Nguyen H, Vo B (2011) An efficient strategy for mining high utility itemsets. Int J Intell Inf Database Syst 5(2):164\u2013176","journal-title":"Int J Intell Inf Database Syst"},{"key":"5145_CR19","doi-asserted-by":"publisher","unstructured":"Liu M, Qu J (2012) Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM international conference on Information and knowledge management - CIKM 12, p 55. https:\/\/doi.org\/10.1145\/2396761.2396773","DOI":"10.1145\/2396761.2396773"},{"key":"5145_CR20","doi-asserted-by":"publisher","unstructured":"Fournier-Viger P, Wu C-W, Zida S, Tseng VS (2014) FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Lecture notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol 8502. LNAI, p 8392. https:\/\/doi.org\/10.1007\/978-3-319-08326-1_9","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"5145_CR21","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy S (2017) HMiner: Efficiently mining high utility itemsets. Expert Syst Appl 90:168\u2013183","journal-title":"Expert Syst Appl"},{"issue":"7","key":"5145_CR22","doi-asserted-by":"publisher","first-page":"1859","DOI":"10.1007\/s10489-017-1057-2","volume":"48","author":"Q-HH Duong","year":"2018","unstructured":"Duong Q-HH, Fournier-Viger P, Ramampiaro H, N\u00f8rv\u00e5g K, Dam T-LL (2018) Efficient high utility itemset mining using buffered utility-lists. Appl Intell 48(7):1859\u20131877","journal-title":"Appl Intell"},{"issue":"2","key":"5145_CR23","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/s10115-016-0986-0","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida S, Fournier-Viger P, Lin JC-W, Wu C-W, Tseng VS (2017) EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl Inf Syst 51(2):595\u2013625","journal-title":"Knowl Inf Syst"},{"key":"5145_CR24","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Nguyen P, Nguyen TDD, Vo B, Fournier-Viger P, Tseng VS (2019) Mining high-utility itemsets in dynamic profit databases. Knowl-Based Syst 175:130\u2013144","journal-title":"Knowl-Based Syst"},{"key":"5145_CR25","doi-asserted-by":"publisher","unstructured":"Lin JC-W, Gan W, Fournier-Viger P, Hong T-P (2015) Mining high-utility itemsets with multiple minimum utility thresholds. In: Proceedings of the eighth international C* Conference on Computer Science & Software Engineering - C3S2E 15, pp 917. https:\/\/doi.org\/10.1007\/978-3-319-44403-1_5","DOI":"10.1007\/978-3-319-44403-1_5"},{"key":"5145_CR26","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.knosys.2016.09.013","volume":"113","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Gan W, Fournier-Viger P, Hong T-P, Zhan J (2016) Efficient mining of high-utility itemsets using multiple minimum utility thresholds. Knowl-Based Syst 113:100\u2013115","journal-title":"Knowl-Based Syst"},{"key":"5145_CR27","doi-asserted-by":"publisher","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC (2016) More efficient algorithms for mining high-utility itemsets with multiple minimum utility thresholds. In: Hartmann S, Ma H (eds) Database and expert systems applications. DEXA 2016. Lecture Notes in Computer Science, vol 9827. Springer, Cham. https:\/\/doi.org\/10.1007\/978-3-319-44403-1_5","DOI":"10.1007\/978-3-319-44403-1_5"},{"key":"5145_CR28","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1016\/j.engappai.2017.12.012","volume":"69","author":"S Krishnamoorthy","year":"2018","unstructured":"Krishnamoorthy S (2018) Efficient mining of high utility itemsets with multiple minimum utility thresholds. Eng Appl Artif Intell 69:112\u2013126","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"5145_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. ACM SIGMOD Rec 29(2):1\u201312","journal-title":"ACM SIGMOD Rec"},{"key":"5145_CR30","doi-asserted-by":"publisher","unstructured":"Zaki MJ, Gouda K (2003) Fast vertical mining using diffsets. In: Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining - KDD 03, p 326. https:\/\/doi.org\/10.1145\/956750.956788","DOI":"10.1145\/956750.956788"},{"key":"5145_CR31","doi-asserted-by":"publisher","unstructured":"Kiran RU, Reddy PK (2011) Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms. In: Proceedings of the 14th International Conference on Extending Database Technology - EDBT\/ICDT 11, p 11. https:\/\/doi.org\/10.1145\/1951365.1951370","DOI":"10.1145\/1951365.1951370"},{"key":"5145_CR32","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.engappai.2017.01.009","volume":"60","author":"W Gan","year":"2017","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Zhan J (2017) Mining of frequent patterns with multiple minimum supports. Eng Appl Artif Intell 60:83\u201396","journal-title":"Eng Appl Artif Intell"},{"issue":"3","key":"5145_CR33","doi-asserted-by":"publisher","first-page":"603","DOI":"10.1016\/j.datak.2005.10.004","volume":"59","author":"H Yao","year":"2006","unstructured":"Yao H, Hamilton HJ (2006) Mining itemset utilities from transaction databases. Data Knowl Eng 59(3):603\u2013626","journal-title":"Data Knowl Eng"},{"key":"5145_CR34","doi-asserted-by":"publisher","unstructured":"Le B, Nguyen H, Cao TA, Vo B (2009) A novel algorithm for mining high utility itemsets. In: 2009 first asian conference on intelligent information and database systems, pp 1317. https:\/\/doi.org\/10.1109\/ACIIDS.2009.55","DOI":"10.1109\/ACIIDS.2009.55"},{"key":"5145_CR35","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2022.108865","volume":"248","author":"P Wu","year":"2022","unstructured":"Wu P, Niu X, Fournier-Viger P, Huang C, Wang B (2022) UBP-Miner: An efficient bit based high utility itemset mining algorithm. Knowl-Based Syst 248:108865","journal-title":"Knowl-Based Syst"},{"issue":"6","key":"5145_CR36","doi-asserted-by":"publisher","first-page":"6992","DOI":"10.1007\/s10489-022-03850-4","volume":"53","author":"Z Cheng","year":"2023","unstructured":"Cheng Z, Fang W, Shen W, Lin JC-W, Yuan B (2023) An efficient utility-list based high-utility itemset mining algorithm. Appl Intell 53(6):6992\u20137006","journal-title":"Appl Intell"},{"key":"5145_CR37","doi-asserted-by":"publisher","unstructured":"Liu J, Wang K, Fung BCM (2012) Direct discovery of high utility itemsets without candidate generation. In: Proceedings\u00a0 IEEE International Conference on Data Mining, ICDM, pp 984989. https:\/\/doi.org\/10.1109\/ICDM.2012.20","DOI":"10.1109\/ICDM.2012.20"},{"issue":"4","key":"5145_CR38","doi-asserted-by":"publisher","first-page":"1306","DOI":"10.1109\/TKDE.2019.2942594","volume":"33","author":"W Gan","year":"2021","unstructured":"Gan W, Lin JC-W, Fournier-Viger P, Chao H-C, Tseng VS, Yu PS (2021) A Survey of Utility-Oriented Pattern Mining. IEEE Trans Knowl Data Eng 33(4):1306\u20131327","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"3","key":"5145_CR39","doi-asserted-by":"publisher","first-page":"1078","DOI":"10.1007\/s10489-018-1316-x","volume":"49","author":"K Singh","year":"2019","unstructured":"Singh K, Singh SS, Kumar A, Biswas B (2019) TKEH: an efficient algorithm for mining top-k high utility itemsets. Appl Intell 49(3):1078\u20131097","journal-title":"Appl Intell"},{"key":"5145_CR40","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":"5145_CR41","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1016\/j.ins.2020.08.028","volume":"557","author":"X Han","year":"2021","unstructured":"Han X, Liu X, Li J, Gao H (2021) Efficient top-k high utility itemset mining on massive data. Inf Sci 557:382\u2013406","journal-title":"Inf Sci"},{"issue":"2","key":"5145_CR42","doi-asserted-by":"publisher","first-page":"140","DOI":"10.1080\/01969722.2019.1705549","volume":"51","author":"LTT Nguyen","year":"2020","unstructured":"Nguyen LTT, Vu D-B, Nguyen TDD, Vo B (2020) Mining Maximal High Utility Itemsets on Dynamic Profit Databases. Cybern Syst 51(2):140\u2013160","journal-title":"Cybern Syst"},{"key":"5145_CR43","doi-asserted-by":"publisher","first-page":"31813","DOI":"10.1109\/ACCESS.2020.2974104","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo B, Nguyen LTT, Bui N, Nguyen TDD, Huynh V-N, Hong T-P (2020) An Efficient Method for Mining Closed Potential High-Utility Itemsets. IEEE Access 8:31813\u201331822","journal-title":"IEEE Access"},{"key":"5145_CR44","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2021.115741","volume":"186","author":"TDD Nguyen","year":"2021","unstructured":"Nguyen TDD, Nguyen LTT, Vu L, Vo B, Pedrycz W (2021) Efficient algorithms for mining closed high utility itemsets in dynamic profit databases. Expert Syst Appl 186:115741","journal-title":"Expert Syst Appl"},{"key":"5145_CR45","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"},{"issue":"5","key":"5145_CR46","doi-asserted-by":"publisher","first-page":"5475","DOI":"10.1007\/s10489-021-02681-z","volume":"52","author":"NT Tung","year":"2022","unstructured":"Tung NT, Nguyen LTT, Nguyen TDD, Vo B (2022) An efficient method for mining multi-level high utility Itemsets. Appl Intell 52(5):5475\u20135496","journal-title":"Appl Intell"},{"key":"5145_CR47","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, Fourier-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"},{"key":"5145_CR48","doi-asserted-by":"publisher","unstructured":"Alhusaini N, Li J, Fournier-Viger P, Hawbani A, Chen G (2022) Mining high utility itemset with multiple minimum utility thresholds based on utility deviation. In: 2022 IEEE International Conference on Data Mining Workshops (ICDMW), pp 49049. https:\/\/doi.org\/10.1109\/ICDMW58026.2022.00071","DOI":"10.1109\/ICDMW58026.2022.00071"},{"key":"5145_CR49","doi-asserted-by":"publisher","unstructured":"Nguyen TDD, Nguyen LTT, Vo B (2019) A parallel algorithm for mining high utility itemsets. In: Advances in intelligent systems and computing, vol 853. Springer Verlag, pp 286295. https:\/\/doi.org\/10.1007\/978-3-319-99996-8_26","DOI":"10.1007\/978-3-319-99996-8_26"},{"key":"5145_CR50","doi-asserted-by":"publisher","first-page":"85890","DOI":"10.1109\/ACCESS.2020.2992729","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo B, Nguyen LTT, Nguyen TDD, Fournier-Viger P, Yun U (2020) A Multi-Core Approach to Efficiently Mining High-Utility Itemsets in Dynamic Profit Databases. IEEE Access 8:85890\u201385899","journal-title":"IEEE Access"},{"key":"5145_CR51","doi-asserted-by":"publisher","unstructured":"Nguyen LTT et al (2020) Efficient method for mining high utility itemsets using high-average utility measure. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol 12496. LNAI, pp 305315. https:\/\/doi.org\/10.1007\/978-3-030-63007-2_24","DOI":"10.1007\/978-3-030-63007-2_24"},{"key":"5145_CR52","doi-asserted-by":"publisher","unstructured":"Nguyen TDD, LTT Nguyen, Kozierkiewicz A, Pham T, Vo B (2021) An efficient approach for mining high-utility itemsets from multiple abstraction levels. In: Lecture notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol 12672. LNAI, p 92103. https:\/\/doi.org\/10.1007\/978-3-030-73280-6_8","DOI":"10.1007\/978-3-030-73280-6_8"},{"key":"5145_CR53","doi-asserted-by":"publisher","unstructured":"Tung NT, Nguyen LTT, Nguyen TDD, Kozierkiewicz A (2021) Cross-level high-utility itemset mining using multi-core processing. In: Lecture notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Note in Bioinformatics), vol 12876. LNAI, p 467479. https:\/\/doi.org\/10.1007\/978-3-030-88081-1_35","DOI":"10.1007\/978-3-030-88081-1_35"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05145-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-023-05145-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-023-05145-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,13]],"date-time":"2024-01-13T10:22:04Z","timestamp":1705141324000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-023-05145-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,19]]},"references-count":53,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2024,1]]}},"alternative-id":["5145"],"URL":"https:\/\/doi.org\/10.1007\/s10489-023-05145-8","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,19]]},"assertion":[{"value":"30 October 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 December 2023","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"We use public datasets in our experiments.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and informed consent for data used."}}]}}