{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,24]],"date-time":"2025-06-24T06:29:37Z","timestamp":1750746577518,"version":"3.37.3"},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T00:00:00Z","timestamp":1667433600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T00:00:00Z","timestamp":1667433600000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-022-01460-y","type":"journal-article","created":{"date-parts":[[2022,11,3]],"date-time":"2022-11-03T16:03:22Z","timestamp":1667491402000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mining for Enthalpy-Based Average High-Utility Patterns with Tighter Upper Bounds"],"prefix":"10.1007","volume":"4","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8478-1291","authenticated-orcid":false,"given":"Ramdas","family":"Vankdothu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohd Abdul","family":"Hameed","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,11,3]]},"reference":[{"issue":"2","key":"1460_CR1","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1109\/TKDE.2018.2833478","volume":"31","author":"T Truong","year":"2018","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P. Efficient vertical mining of high average-utility itemsets based on novel upper-bounds. IEEE Trans Knowl Data Eng. 2018;31(2):301\u201314.","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"1460_CR2","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.ins.2018.11.026","volume":"479","author":"M Rahman","year":"2019","unstructured":"Rahman M, Ahmed C. Leung CKS (2019) Miningweighted frequent sequences in uncertain Databases. Inf Sci. 2019;479:76\u2013100.","journal-title":"Inf Sci"},{"key":"1460_CR3","first-page":"1","volume":"1","author":"A Al-badwi","year":"2019","unstructured":"Al-badwi A, Long Z, Zhang Z, Al-habib M, Al-Sabahi K. A novel integrated approach for companion vehicle discovery based on frequent itemset mining spark. Arab J Sci Eng. 2019;1:1\u201311.","journal-title":"Arab J Sci Eng"},{"issue":"2","key":"1460_CR4","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/s11704-016-6245-4","volume":"13","author":"TL Dam","year":"2019","unstructured":"Dam TL, Li K, Fournier-Viger P, Duong QH. CLS-Miner: efficient and effective closed high-utility itemset data mining. Front Comput Sci. 2019;13(2):357\u201381.","journal-title":"Front Comput Sci"},{"key":"1460_CR5","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen LTT, Vu VV, Lam MTH, Duong TTM, Manh LY, Nguyen TTT, Vo B, Fujita H. An efficient method for Mininghigh utility closed itemsets. Inf Sci. 2019;495:78\u201399.","journal-title":"Inf Sci"},{"key":"1460_CR6","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. Mining high-utility itemsets in dynamic profit databases. Knowl Based Syst. 2019;175:130\u201344.","journal-title":"Knowl Based Syst"},{"key":"1460_CR7","first-page":"1","volume":"1","author":"J Liu","year":"2019","unstructured":"Liu J, Ju X, Zhang X, Fung BCM, Yang X, Yu C. Incremental mining of high utility patterns in one phase by absence and legacy-based pruning. IEEE Access. 2019;1:1.","journal-title":"IEEE Access"},{"key":"1460_CR8","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1016\/j.ins.2018.12.070","volume":"481","author":"P Fournier-Viger","year":"2019","unstructured":"Fournier-Viger P, Zhang Y, Lin JCW, Fujita H, Koh YS. Mininglocal and peak high utility itemsets. Inf Sci. 2019;481:344\u201367.","journal-title":"Inf Sci"},{"issue":"1","key":"1460_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.15625\/1813-9663\/35\/1\/13234","volume":"35","author":"TC Tin","year":"2019","unstructured":"Tin TC, Anh TN, Hai DV. HUPSMT: an efficient algorithm for Mininghigh utility-probability sequences in uncertain databases with multiple minimum utility thresholds. J Comput Sci Cybern. 2019;35(1):1\u201320.","journal-title":"J Comput Sci Cybern"},{"key":"1460_CR10","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/j.knosys.2018.11.019","volume":"165","author":"T-L Dam","year":"2019","unstructured":"Dam T-L, Ramampiaro H, N\u00f8rv\u00e5g K, Duong QH. Towards efficiently Mining closed high utility itemsets from incremental Databases. Knowl Based Syst. 2019;165:13\u201329.","journal-title":"Knowl Based Syst"},{"issue":"8","key":"1460_CR11","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/s12046-019-1158-1","volume":"44","author":"A Bai","year":"2019","unstructured":"Bai A, Dhabu M, Jagtap V, Deshpande PS. An efficient approach based on selective partitioning for maximal frequent itemsets Data mining. Sadhana. 2019;44(8):183.","journal-title":"Sadhana"},{"key":"1460_CR12","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/j.ins.2018.08.009","volume":"496","author":"MK Vanahalli","year":"2019","unstructured":"Vanahalli MK, Patil N. An efficient parallel row enumerated algorithm for Miningfrequent colossal, closed itemsets from high dimensional Datasets. Inf Sci. 2019;496:343\u201362.","journal-title":"Inf Sci"},{"key":"1460_CR13","doi-asserted-by":"publisher","first-page":"614","DOI":"10.1016\/j.eswa.2018.08.053","volume":"118","author":"Y Chen","year":"2019","unstructured":"Chen Y, Yuan P, Qiu M, Pi D. An indoor trajectory frequent pattern Miningalgorithm based on vague grid sequence. Expert Syst Appl. 2019;118:614\u201324.","journal-title":"Expert Syst Appl"},{"issue":"1","key":"1460_CR14","first-page":"187","volume":"20","author":"JC-W Lin","year":"2019","unstructured":"Lin JC-W, Li T, Fournier-Viger P, Zhang J, Guo X. Mining of high average-utility patterns with item-level thresholds. J Internet Technol. 2019;20(1):187\u201394.","journal-title":"J Internet Technol"},{"key":"1460_CR15","first-page":"1","volume":"1","author":"JC-W Lin","year":"2019","unstructured":"Lin JC-W, Li T, Pirouz M, Zhang J, Fournier-Viger P. High average-utility sequential pattern Miningbased on uncertain databases. Knowl Inf Syst. 2019;1:1\u201330.","journal-title":"Knowl Inf Syst"},{"issue":"6","key":"1460_CR16","doi-asserted-by":"publisher","first-page":"674","DOI":"10.1080\/17517575.2017.1405286","volume":"12","author":"MK Sohrabi","year":"2018","unstructured":"Sohrabi MK. A gossip-based information fusion protocol for distributed frequent itemset Data mining. Enterprise Inf Syst. 2018;12(6):674\u201394.","journal-title":"Enterprise Inf Syst"},{"key":"1460_CR17","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. Efficient mining of high utility itemsets with multiple minimum utility thresholds. Eng Appl Artif Intell. 2018;69:112\u201326.","journal-title":"Eng Appl Artif Intell"},{"issue":"2","key":"1460_CR18","first-page":"479","volume":"15","author":"B Huynh","year":"2019","unstructured":"Huynh B, Trinh C, Dang V, Vo B. A parallel method for Miningfrequent patterns with multiple minimum support thresholds. Int J Innov Comput Inf Control. 2019;15(2):479\u201388.","journal-title":"Int J Innov Comput Inf Control"},{"key":"1460_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2019.07.018","volume":"183","author":"T Truong","year":"2019","unstructured":"Truong T, Duong H, Le B, Fournier-Viger P, Yun U. Efficient high average-utility itemset mining using novel weak vertical upper-bounds. Knowl Based Syst. 2019;183: 104847.","journal-title":"Knowl Based Syst"},{"key":"1460_CR20","doi-asserted-by":"publisher","first-page":"144245","DOI":"10.1109\/ACCESS.2019.2945840","volume":"7","author":"I Yildirim","year":"2019","unstructured":"Yildirim I, Celik M. An efficient tree-based algorithm for mininghigh average-utility itemset. IEEE Access. 2019;7:144245\u201363.","journal-title":"IEEE Access"},{"issue":"6","key":"1460_CR21","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. Miningrecent high average utility patterns based on sliding window from stream Data. J Intell Fuzzy Syst. 2016;30(6):3605\u201317.","journal-title":"J Intell Fuzzy Syst"},{"issue":"1","key":"1460_CR22","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger P, Gomariz A, Gueniche T, Soltani A, Wu C. SPMF: a Java open-source pattern mining library. J Mach Learn Res. 2014;15(1):3389\u201393.","journal-title":"J Mach Learn Res"},{"key":"1460_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/j.ins.2020.07.043","volume":"543","author":"UY Heonhokim","year":"2021","unstructured":"Heonhokim UY, Jongseongkim B, Eunchuyoon H. Efficient list based mining of high average utility patterns with maximum average pruning strategies. Inf Sci. 2021;543:85\u2013105.","journal-title":"Inf Sci"},{"key":"1460_CR24","doi-asserted-by":"publisher","first-page":"10288","DOI":"10.1007\/s11227-020-03247-5","volume":"76","author":"KK Sethi","year":"2020","unstructured":"Sethi KK, Ramesh D. A fast high average-utility itemset mining with efficient tighter upper bounds and novel list structure. J Supercomput. 2020;76:10288\u2013318.","journal-title":"J Supercomput"},{"key":"1460_CR25","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, Phillippe Fournier-Vigere B. Ehausm: an efficient algorithm average utility sequence mining. Inf Sci. 2020;515:302\u201323.","journal-title":"Inf Sci"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01460-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-022-01460-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-022-01460-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T22:23:24Z","timestamp":1673130204000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-022-01460-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,11,3]]},"references-count":25,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["1460"],"URL":"https:\/\/doi.org\/10.1007\/s42979-022-01460-y","relation":{},"ISSN":["2661-8907"],"issn-type":[{"type":"electronic","value":"2661-8907"}],"subject":[],"published":{"date-parts":[[2022,11,3]]},"assertion":[{"value":"18 November 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 October 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 November 2022","order":3,"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 that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of Interest"}},{"value":"There is no informed consent.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}},{"value":"This paper does not have ethical approval. This article does not contain any studies performed with human participants by any of the authors.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}}],"article-number":"41"}}