{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T11:33:30Z","timestamp":1786620810671,"version":"3.56.0"},"reference-count":43,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,7,1]],"date-time":"2026-07-01T00:00:00Z","timestamp":1782864000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["102.01-2023.12"],"award-info":[{"award-number":["102.01-2023.12"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["102.01-2023.12"],"award-info":[{"award-number":["102.01-2023.12"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007224","name":"National Foundation for Science and Technology Development","doi-asserted-by":"publisher","award":["102.01-2023.12"],"award-info":[{"award-number":["102.01-2023.12"]}],"id":[{"id":"10.13039\/100007224","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cluster Comput"],"published-print":{"date-parts":[[2026,7]]},"DOI":"10.1007\/s10586-026-06242-2","type":"journal-article","created":{"date-parts":[[2026,7,13]],"date-time":"2026-07-13T11:27:25Z","timestamp":1783942045000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An efficiency method for mining top-k multi-level high utility itemsets through multi-core parallelism"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3537-4726","authenticated-orcid":false,"given":"N. T.","family":"Tung","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Trinh D. D.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0045-4657","authenticated-orcid":false,"given":"Duc-Lung","family":"Vu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6440-6462","authenticated-orcid":false,"given":"Loan T. T.","family":"Nguyen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,7,13]]},"reference":[{"key":"6242_CR1","doi-asserted-by":"publisher","unstructured":"Luna, J.M., Fournier-Viger, P., Ventura, S.: Frequent itemset mining: A 25 years review. Wiley Interdiscip Rev. Data Min. Knowl. Discov. 9 (2019). https:\/\/doi.org\/10.1002\/widm.1329","DOI":"10.1002\/widm.1329"},{"key":"6242_CR2","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: ACM International Conference Proceeding Series. pp. 55\u201364. ACM, New York, NY, USA (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"6242_CR3","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Wu, C.W., Zida, S., Tseng, V.S.: 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). pp. 83\u201392 (2014)","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"6242_CR4","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.: HMiner: Efficiently mining high utility itemsets. Expert Syst. Appl. 90, 168\u2013183 (2017). https:\/\/doi.org\/10.1016\/j.eswa.2017.08.028","journal-title":"Expert Syst. Appl."},{"key":"6242_CR5","doi-asserted-by":"publisher","first-page":"108865","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.: UBP-Miner: An efficient bit based high utility itemset mining algorithm. Knowl. Based Syst. 248, 108865 (2022). https:\/\/doi.org\/10.1016\/j.knosys.2022.108865","journal-title":"Knowl. Based Syst."},{"key":"6242_CR6","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, J.C.W., Wu, C.W., Tseng, V.S.: EFIM: a fast and memory efficient algorithm for high-utility itemset mining. Knowl. Inf. Syst. 51, 595\u2013625 (2017). https:\/\/doi.org\/10.1007\/s10115-016-0986-0","journal-title":"Knowl. Inf. Syst."},{"key":"6242_CR7","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.knosys.2019.03.022","volume":"175","author":"LTT Nguyen","year":"2019","unstructured":"Nguyen, L.T.T., Nguyen, P., Nguyen, T.D.D., Vo, B., Fournier-Viger, P., Tseng, V.S.: Mining high-utility itemsets in dynamic profit databases. Knowl. Based Syst. 175, 130\u2013144 (2019). https:\/\/doi.org\/10.1016\/j.knosys.2019.03.022","journal-title":"Knowl. Based Syst."},{"key":"6242_CR8","doi-asserted-by":"crossref","unstructured":"Cagliero, L., Chiusano, S., Garza, P., Ricupero, G.: Discovering high-utility itemsets at multiple abstraction levels. In: Communications in Computer and Information Science. pp. 224\u2013234 (2017)","DOI":"10.1007\/978-3-319-67162-8_22"},{"key":"6242_CR9","doi-asserted-by":"publisher","first-page":"5475","DOI":"10.1007\/s10489-021-02681-z","volume":"52","author":"NT Tung","year":"2022","unstructured":"Tung, N.T., Nguyen, L.T.T., Nguyen, T.D.D., Vo, B.: An efficient method for mining multi-level high utility Itemsets. Appl. Intell. 52, 5475\u20135496 (2022). https:\/\/doi.org\/10.1007\/s10489-021-02681-z","journal-title":"Appl. Intell."},{"key":"6242_CR10","doi-asserted-by":"crossref","unstructured":"Fournier-Viger, P., Wang, Y., Lin, J.C.W., Luna, J.M., Ventura, S.: Mining cross-level high utility itemsets. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). pp. 858\u2013871 (2020)","DOI":"10.1007\/978-3-030-55789-8_73"},{"key":"6242_CR11","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.ins.2021.12.017","volume":"587","author":"NT Tung","year":"2022","unstructured":"Tung, N.T., Nguyen, L.T.T., Nguyen, T.D.D., Fourier-Viger, P., Nguyen, N.T., Vo, B.: Efficient mining of cross-level high-utility itemsets in taxonomy quantitative databases. Inf. Sci. (N Y). 587, 41\u201362 (2022). https:\/\/doi.org\/10.1016\/j.ins.2021.12.017","journal-title":"Inf. Sci. (N Y)"},{"key":"6242_CR12","doi-asserted-by":"publisher","first-page":"5420","DOI":"10.1109\/TKDE.2025.3579746","volume":"37","author":"NT Tung","year":"2025","unstructured":"Tung, N.T., Nguyen, T.D.D., Nguyen, L.T.T., Vu, D.-L., Fournier-Viger, P., Vo, B.: Mining Cross-Level High Utility Itemsets in Unstable and Negative Profit Databases. IEEE Trans. Knowl. Data Eng. 37, 5420\u20135435 (2025). https:\/\/doi.org\/10.1109\/TKDE.2025.3579746","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"6242_CR13","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2016","unstructured":"Tseng, V.S., Wu, C.W., Fournier-Viger, P., Yu, P.S.: Efficient Algorithms for Mining Top-K High Utility Itemsets. IEEE Trans. Knowl. Data Eng. 28, 54\u201367 (2016). https:\/\/doi.org\/10.1109\/TKDE.2015.2458860","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"6242_CR14","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"QH Duong","year":"2016","unstructured":"Duong, Q.H., Liao, B., Fournier-Viger, P., Dam, T.L.: An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowl. Based Syst. 104, 106\u2013122 (2016). https:\/\/doi.org\/10.1016\/j.knosys.2016.04.016","journal-title":"Knowl. Based Syst."},{"key":"6242_CR15","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.: Mining top-k high utility itemsets with effective threshold raising strategies. Expert Syst. Appl. 117, 148\u2013165 (2019). https:\/\/doi.org\/10.1016\/j.eswa.2018.09.051","journal-title":"Expert Syst. Appl."},{"key":"6242_CR16","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, S.S., Kumar, A., Biswas, B.: TKEH: an efficient algorithm for mining top-k high utility itemsets. Appl. Intell. 49, 1078\u20131097 (2019). https:\/\/doi.org\/10.1007\/s10489-018-1316-x","journal-title":"Appl. Intell."},{"key":"6242_CR17","doi-asserted-by":"publisher","first-page":"113359","DOI":"10.1016\/j.knosys.2025.113359","volume":"316","author":"LTT Nguyen","year":"2025","unstructured":"Nguyen, L.T.T., Tung, N.T., Vo, B.: An efficient method for mining top-k multi-level high utility itemsets. Knowl. Based Syst. 316, 113359 (2025). https:\/\/doi.org\/10.1016\/j.knosys.2025.113359","journal-title":"Knowl. Based Syst."},{"key":"6242_CR18","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s10115-026-02722-4","volume":"68","author":"NT Tung","year":"2026","unstructured":"Tung, N.T., Vu, D.-L., Nguyen, L.T.T.: Efficient mining of top-K cross-level high utility itemsets on unstable profit databases. Knowl. Inf. Syst. 68, 97 (2026). https:\/\/doi.org\/10.1007\/s10115-026-02722-4","journal-title":"Knowl. Inf. Syst."},{"key":"6242_CR19","doi-asserted-by":"crossref","unstructured":"Nguyen, T.D.D., Nguyen, L.T.T., Kozierkiewicz, A., Pham, T., Vo, B.: 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). pp. 92\u2013103 (2021)","DOI":"10.1007\/978-3-030-73280-6_8"},{"key":"6242_CR20","doi-asserted-by":"publisher","first-page":"110733","DOI":"10.1016\/j.knosys.2023.110733","volume":"276","author":"TDD Nguyen","year":"2023","unstructured":"Nguyen, T.D.D., Tung, N.T., Pham, T., Nguyen, L.T.T.: Parallel approaches to extract multi-level high utility itemsets from hierarchical transaction databases. Knowl. Based Syst. 276, 110733 (2023). https:\/\/doi.org\/10.1016\/j.knosys.2023.110733","journal-title":"Knowl. Based Syst."},{"key":"6242_CR21","doi-asserted-by":"crossref","unstructured":"Kimura, G., Hayamizu, Y., Kiran, R.U., Kitsuregawa, M., Goda, K.: Efficient Parallel Mining of High-utility Itemsets on Multicore Processors. In: 2023 IEEE 39th International Conference on Data Engineering (ICDE). pp. 638\u2013652. IEEE (2023)","DOI":"10.1109\/ICDE55515.2023.00388"},{"key":"6242_CR22","doi-asserted-by":"publisher","first-page":"121218","DOI":"10.1016\/j.ins.2024.121218","volume":"681","author":"Y Yan","year":"2024","unstructured":"Yan, Y., Niu, X., Zhang, Z., Fournier-Viger, P., Ye, L., Min, F.: Efficient high utility itemset mining without the join operation. Inf. Sci. (N Y). 681, 121218 (2024). https:\/\/doi.org\/10.1016\/j.ins.2024.121218","journal-title":"Inf. Sci. (N Y)"},{"key":"6242_CR23","doi-asserted-by":"publisher","first-page":"10224","DOI":"10.1109\/TKDE.2023.3256126","volume":"35","author":"JF Qu","year":"2023","unstructured":"Qu, J.F., Fournier-Viger, P., Liu, M., Hang, B., Hu, C.: Mining High Utility Itemsets Using Prefix Trees and Utility Vectors. IEEE Trans. Knowl. Data Eng. 35, 10224\u201310236 (2023). https:\/\/doi.org\/10.1109\/TKDE.2023.3256126","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"6242_CR24","doi-asserted-by":"publisher","first-page":"77605","DOI":"10.1109\/ACCESS.2024.3406562","volume":"12","author":"C Lee","year":"2024","unstructured":"Lee, C., Kim, H., Cho, M., Kim, H., Vo, B., Lin, J.C.-W., Fournier-Viger, P., Yun, U.: Incremental Top-k High Utility Pattern Mining and Analyzing Over the Entire Accumulated Dynamic Database. IEEE Access. 12, 77605\u201377620 (2024). https:\/\/doi.org\/10.1109\/ACCESS.2024.3406562","journal-title":"IEEE Access."},{"key":"6242_CR25","doi-asserted-by":"publisher","first-page":"111060","DOI":"10.1016\/j.knosys.2023.111060","volume":"282","author":"S Kim","year":"2023","unstructured":"Kim, S., Kim, H., Cho, M., Kim, H., Vo, B., Lin, J.C.W., Yun, U.: Efficient approach for mining high-utility patterns on incremental databases with dynamic profits. Knowl. Based Syst. 282, 111060 (2023). https:\/\/doi.org\/10.1016\/j.knosys.2023.111060","journal-title":"Knowl. Based Syst."},{"key":"6242_CR26","doi-asserted-by":"publisher","first-page":"110081","DOI":"10.1016\/j.engappai.2025.110081","volume":"144","author":"M Naderi Vlashejerdi","year":"2025","unstructured":"Naderi Vlashejerdi, M., Daneshpour, N.: Efficient mining of closed high-utility itemsets in dynamic and incremental databases. Eng. Appl. Artif. Intell. 144, 110081 (2025). https:\/\/doi.org\/10.1016\/j.engappai.2025.110081","journal-title":"Eng. Appl. Artif. Intell."},{"key":"6242_CR27","doi-asserted-by":"publisher","first-page":"109960","DOI":"10.1016\/j.engappai.2024.109960","volume":"145","author":"W Song","year":"2025","unstructured":"Song, W., Ren, G., Gan, W.: Fast mining local high-utility itemsets. Eng. Appl. Artif. Intell. 145, 109960 (2025). https:\/\/doi.org\/10.1016\/j.engappai.2024.109960","journal-title":"Eng. Appl. Artif. Intell."},{"key":"6242_CR28","doi-asserted-by":"publisher","first-page":"654","DOI":"10.1016\/j.ins.2021.12.024","volume":"587","author":"M Ashraf","year":"2022","unstructured":"Ashraf, M., Abdelkader, T., Rady, S., Gharib, T.F.: TKN: An efficient approach for discovering top-k high utility itemsets with positive or negative profits. Inf. Sci. (N Y). 587, 654\u2013678 (2022). https:\/\/doi.org\/10.1016\/j.ins.2021.12.024","journal-title":"Inf. Sci. (N Y)"},{"key":"6242_CR29","doi-asserted-by":"publisher","first-page":"106182","DOI":"10.1016\/j.engappai.2023.106182","volume":"123","author":"F Lai","year":"2023","unstructured":"Lai, F., Zhang, X., Chen, G., Gan, W.: Mining periodic high-utility itemsets with both positive and negative utilities. Eng. Appl. Artif. Intell. 123, 106182 (2023). https:\/\/doi.org\/10.1016\/j.engappai.2023.106182","journal-title":"Eng. Appl. Artif. Intell."},{"key":"6242_CR30","doi-asserted-by":"publisher","first-page":"118945","DOI":"10.1016\/j.ins.2023.118945","volume":"637","author":"X Zhang","year":"2023","unstructured":"Zhang, X., Lai, F., Chen, G., Gan, W.: Mining high-utility sequences with positive and negative values. Inf. Sci. (N Y). 637, 118945 (2023). https:\/\/doi.org\/10.1016\/j.ins.2023.118945","journal-title":"Inf. Sci. (N Y)"},{"key":"6242_CR31","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s00500-025-10930-3","volume":"30","author":"K Singh","year":"2026","unstructured":"Singh, K., Kumar, R., Singh, S.S., Mahato, D.P.: TKHN: efficient mining of top-K high utility itemsets with negative item values. Soft comput. 30, 209\u2013225 (2026). https:\/\/doi.org\/10.1007\/s00500-025-10930-3","journal-title":"Soft comput."},{"key":"6242_CR32","doi-asserted-by":"publisher","unstructured":"He, J., Han, X., Wan, X., Wang, J.: Efficient Skyline Frequent-Utility Itemset Mining Algorithm on Massive Data. IEEE Trans. Knowl. Data Eng. 1\u201314 (2024). https:\/\/doi.org\/10.1109\/TKDE.2024.3349454","DOI":"10.1109\/TKDE.2024.3349454"},{"key":"6242_CR33","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.: Efficient top-k high utility itemset mining on massive data. Inf. Sci. (N Y). 557, 382\u2013406 (2021). https:\/\/doi.org\/10.1016\/j.ins.2020.08.028","journal-title":"Inf. Sci. (N Y)"},{"key":"6242_CR34","doi-asserted-by":"publisher","first-page":"125955","DOI":"10.1016\/j.eswa.2024.125955","volume":"265","author":"X Zhang","year":"2025","unstructured":"Zhang, X., Chen, G., Song, L., Gan, W.: Enabling knowledge discovery through low utility itemset mining. Expert Syst. Appl. 265, 125955 (2025). https:\/\/doi.org\/10.1016\/j.eswa.2024.125955","journal-title":"Expert Syst. Appl."},{"key":"6242_CR35","doi-asserted-by":"publisher","first-page":"1114","DOI":"10.1007\/s10489-025-06995-0","volume":"55","author":"Q Zhou","year":"2025","unstructured":"Zhou, Q., Gan, W., Chen, G.: Discovering top-k periodic and high-utility patterns. Appl. Intell. 55, 1114 (2025). https:\/\/doi.org\/10.1007\/s10489-025-06995-0","journal-title":"Appl. Intell."},{"key":"6242_CR36","doi-asserted-by":"publisher","first-page":"114733","DOI":"10.1016\/j.knosys.2025.114733","volume":"331","author":"K Logeswaran","year":"2025","unstructured":"Logeswaran, K., Suresh, P., Savitha, S., Anandamurugan, S.: Adaptive optimization with reinforcement learning for high utility itemset extraction. Knowl. Based Syst. 331, 114733 (2025). https:\/\/doi.org\/10.1016\/j.knosys.2025.114733","journal-title":"Knowl. Based Syst."},{"key":"6242_CR37","doi-asserted-by":"publisher","first-page":"104789","DOI":"10.1109\/ACCESS.2023.3314984","volume":"11","author":"VV Vu","year":"2023","unstructured":"Vu, V.V., Lam, M.T.H., Duong, T.T.M., Manh, L.T., Nguyen, T.T.T., Nguyen, L.V., Yun, U., Snasel, V., Vo, B.: FTKHUIM: A Fast and Efficient Method for Mining Top-K High-Utility Itemsets. IEEE Access. 11, 104789\u2013104805 (2023). https:\/\/doi.org\/10.1109\/ACCESS.2023.3314984","journal-title":"IEEE Access."},{"key":"6242_CR38","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.ins.2022.12.092","volume":"624","author":"JM Luna","year":"2023","unstructured":"Luna, J.M., Kiran, R.U., Fournier-Viger, P., Ventura, S.: Efficient mining of top-k high utility itemsets through genetic algorithms. Inf. Sci. (N Y). 624, 529\u2013553 (2023). https:\/\/doi.org\/10.1016\/j.ins.2022.12.092","journal-title":"Inf. Sci. (N Y)"},{"key":"6242_CR39","doi-asserted-by":"publisher","first-page":"85890","DOI":"10.1109\/ACCESS.2020.2992729","volume":"8","author":"B Vo","year":"2020","unstructured":"Vo, B., Nguyen, L.T.T., Nguyen, T.D.D., Fournier-Viger, P., Yun, U.: A Multi-Core Approach to Efficiently Mining High-Utility Itemsets in Dynamic Profit Databases. IEEE Access. 8, 85890\u201385899 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.2992729","journal-title":"IEEE Access."},{"key":"6242_CR40","doi-asserted-by":"publisher","first-page":"889","DOI":"10.1007\/s10586-021-03442-w","volume":"25","author":"KK Sethi","year":"2022","unstructured":"Sethi, K.K., Ramesh, D., Trivedi, M.C.: A Spark-based high utility itemset mining with multiple external utilities. Cluster Comput. 25, 889\u2013909 (2022). https:\/\/doi.org\/10.1007\/s10586-021-03442-w","journal-title":"Cluster Comput."},{"key":"6242_CR41","doi-asserted-by":"publisher","first-page":"805","DOI":"10.1007\/s10586-021-03448-4","volume":"25","author":"S Saleti","year":"2022","unstructured":"Saleti, S.: Incremental mining of high utility sequential patterns using MapReduce paradigm. Cluster Comput. 25, 805\u2013825 (2022). https:\/\/doi.org\/10.1007\/s10586-021-03448-4","journal-title":"Cluster Comput."},{"key":"6242_CR42","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10586-024-04868-8","volume":"28","author":"S Raj","year":"2025","unstructured":"Raj, S., Ramesh, D., Gantela, P.: CrossFIM: a spark-based hybrid frequent itemset mining algorithm for large datasets. Cluster Comput. 28, 231 (2025). https:\/\/doi.org\/10.1007\/s10586-024-04868-8","journal-title":"Cluster Comput."},{"key":"6242_CR43","doi-asserted-by":"publisher","first-page":"1217","DOI":"10.1007\/s10586-023-04014-w","volume":"27","author":"C Fernandez-Basso","year":"2024","unstructured":"Fernandez-Basso, C., Ruiz, M.D., Martin-Bautista, M.J.: New Spark solutions for distributed frequent itemset and association rule mining algorithms. Cluster Comput. 27, 1217\u20131234 (2024). https:\/\/doi.org\/10.1007\/s10586-023-04014-w","journal-title":"Cluster Comput."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-026-06242-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10586-026-06242-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10586-026-06242-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,13]],"date-time":"2026-08-13T10:53:33Z","timestamp":1786618413000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10586-026-06242-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,7]]},"references-count":43,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2026,7]]}},"alternative-id":["6242"],"URL":"https:\/\/doi.org\/10.1007\/s10586-026-06242-2","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"value":"1386-7857","type":"print"},{"value":"1573-7543","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,7]]},"assertion":[{"value":"19 November 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 April 2026","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 June 2026","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 July 2026","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"The authors have no conflict of interest. This research was carried using public data. No experiments were conducted with humans or animals.","order":1,"name":"Ethics","label":"Compliance with ethical standards","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare no competing interests.","order":2,"name":"Ethics","label":"Competing interests","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"466"}}