{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T13:55:59Z","timestamp":1781272559325,"version":"3.54.1"},"reference-count":47,"publisher":"Springer Science and Business Media LLC","issue":"17","license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"Provincial Natural Science Research Program of Higher Education Institutions of Anhui Province","award":["KJ2021A1030"],"award-info":[{"award-number":["KJ2021A1030"]}]},{"name":"Discipline Platform Projects of Chaohu University","award":["KJ22ZSYS03"],"award-info":[{"award-number":["KJ22ZSYS03"]}]},{"name":"Quality Improvement Project of Chaohu University on Discipline Construction","award":["KJ21GCZX03"],"award-info":[{"award-number":["KJ21GCZX03"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2025,11]]},"DOI":"10.1007\/s10489-025-06969-2","type":"journal-article","created":{"date-parts":[[2025,11,10]],"date-time":"2025-11-10T09:08:24Z","timestamp":1762765704000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Two top-k HUIM algorithms based on the particle filter theory"],"prefix":"10.1007","volume":"55","author":[{"given":"Yang","family":"Yang","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hafiz Mohd","family":"Sarim","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Honghai","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2025,11,10]]},"reference":[{"issue":"1","key":"6969_CR1","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han J, Cheng H, Xin D et al (2007) Frequent pattern mining: current status and future directions. Data Min Knowl Discov 15(1):55\u201386. https:\/\/doi.org\/10.1007\/s10618-006-0059-1","journal-title":"Data Min Knowl Discov"},{"issue":"6","key":"6969_CR2","doi-asserted-by":"publisher","first-page":"067006","DOI":"10.1289\/EHP8610","volume":"129","author":"Z Stanfield","year":"2021","unstructured":"Stanfield Z, Addington CK, Dionisio KL et al (2021) Mining of consumer product ingredient and purchasing data to identify potential chemical coexposures. Environ Health Perspect 129(6):067006\u2013067019. https:\/\/doi.org\/10.1289\/EHP8610","journal-title":"Environ Health Perspect"},{"key":"6969_CR3","doi-asserted-by":"publisher","first-page":"106972","DOI":"10.1016\/j.knosys.2021.106972","volume":"221","author":"X Ma","year":"2021","unstructured":"Ma X, Huo E, Yu H et al (2021) Mining truck platooning patterns through massive trajectory data. Knowledge-Based Systems 221:106972\u2013106987. https:\/\/doi.org\/10.1016\/j.knosys.2021.106972","journal-title":"Knowledge-Based Systems"},{"key":"6969_CR4","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1016\/j.ins.2021.07.061","volume":"576","author":"SA Ahmed","year":"2021","unstructured":"Ahmed SA, Nath B (2021) Identification of adverse disease agents and risk analysis using frequent pattern mining. Inf Sci 576:609\u2013641. https:\/\/doi.org\/10.1016\/j.ins.2021.07.061","journal-title":"Inf Sci"},{"key":"6969_CR5","doi-asserted-by":"publisher","unstructured":"Gan W, Wan S, Chen J, et\u00a0al (2020) Tophui: Top-k high-utility itemset mining with negative utility. In: 2020 IEEE International Conference on Big Data (Big Data). IEEE, Atlanta, GA, USA, pp 5350\u20135359, https:\/\/doi.org\/10.1109\/BigData50022.2020.9378288","DOI":"10.1109\/BigData50022.2020.9378288"},{"key":"6969_CR6","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 et al (2022) Tkn: an efficient approach for discovering top-k high utility itemsets with positive or negative profits. Inf Sci 587:654\u2013678. https:\/\/doi.org\/10.1016\/j.ins.2021.12.024","journal-title":"Inf Sci"},{"key":"6969_CR7","doi-asserted-by":"publisher","unstructured":"Liu Y, Liao Wk, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Advances in Knowledge Discovery and Data Mining: 9th Pacific-Asia Conference, PAKDD 2005, Hanoi, Vietnam, May 18-20, 2005. Proceedings 9. Springer Berlin Heidelberg, pp 689\u2013695, https:\/\/doi.org\/10.1007\/11430919_79","DOI":"10.1007\/11430919_79"},{"key":"6969_CR8","doi-asserted-by":"publisher","unstructured":"Tseng VS, Wu CW, Shie BE, et\u00a0al (2010) Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, New York, NY, USA, pp 253\u2013262, https:\/\/doi.org\/10.1145\/1835804.1835839","DOI":"10.1145\/1835804.1835839"},{"issue":"8","key":"6969_CR9","doi-asserted-by":"publisher","first-page":"1772","DOI":"10.1109\/TKDE.2012.59","volume":"25","author":"VS Tseng","year":"2012","unstructured":"Tseng VS, Shie BE, Wu CW et al (2012) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786. https:\/\/doi.org\/10.1109\/TKDE.2012.59","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"8","key":"6969_CR10","doi-asserted-by":"publisher","first-page":"3861","DOI":"10.1016\/j.eswa.2013.11.038","volume":"41","author":"U Yun","year":"2014","unstructured":"Yun U, Ryang H, Ryu KH (2014) High utility itemset mining with techniques for reducing overestimated utilities and pruning candidates. Expert Syst Appl 41(8):3861\u20133878. https:\/\/doi.org\/10.1016\/j.eswa.2013.11.038","journal-title":"Expert Syst Appl"},{"key":"6969_CR11","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. ACM, Maui, Hawaii, USA, pp 55\u201364, https:\/\/doi.org\/10.1145\/2396761.2396773","DOI":"10.1145\/2396761.2396773"},{"issue":"5","key":"6969_CR12","doi-asserted-by":"publisher","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy S (2015) Pruning strategies for mining high utility itemsets. Expert Syst Appl 42(5):2371\u20132381. https:\/\/doi.org\/10.1016\/j.eswa.2014.11.001","journal-title":"Expert Syst Appl"},{"issue":"4","key":"6969_CR13","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1080\/08839514.2014.891839","volume":"28","author":"S Kannimuthu","year":"2014","unstructured":"Kannimuthu S, Premalatha K (2014) Discovery of high utility itemsets using genetic algorithm with ranked mutation. Appl Artif Intell 28(4):337\u2013359. https:\/\/doi.org\/10.1080\/08839514.2014.891839","journal-title":"Appl Artif Intell"},{"key":"6969_CR14","doi-asserted-by":"publisher","unstructured":"Song W, Li J (2020) Discovering high utility itemsets using set-based particle swarm optimization. In: Advanced Data Mining and Applications: 16th International Conference, ADMA 2020, Foshan, China, November 12\u201314, 2020, Proceedings 16, Cham, pp 38\u201353. https:\/\/doi.org\/10.1007\/978-3-030-65390-3_4","DOI":"10.1007\/978-3-030-65390-3_4"},{"key":"6969_CR15","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2022.109073","volume":"124","author":"W Fang","year":"2022","unstructured":"Fang W, Zhang Q, Lu H et al (2022) High-utility itemsets mining based on binary particle swarm optimization with multiple adjustment strategies. Appl Soft Comput 124:109073.1\u2013109073.12. https:\/\/doi.org\/10.1016\/j.asoc.2022.109073","journal-title":"Appl Soft Comput"},{"issue":"1","key":"6969_CR16","doi-asserted-by":"publisher","first-page":"1169","DOI":"10.3233\/JIFS-220871","volume":"44","author":"K Subramanian","year":"2023","unstructured":"Subramanian K, Kandhasamy P (2023) Mining high utility itemsets using genetic algorithm based-particle swarm optimization (ga-pso). J Intell Fuzzy Syst 44(1):1169\u20131189. https:\/\/doi.org\/10.3233\/JIFS-220871","journal-title":"J Intell Fuzzy Syst"},{"issue":"1","key":"6969_CR17","doi-asserted-by":"publisher","first-page":"25","DOI":"10.5755\/j01.itc.52.1.31949","volume":"52","author":"K Logeswaran","year":"2023","unstructured":"Logeswaran K, Suresh P, Anandamurugan S (2023) Particle swarm optimization method combined with off policy reinforcement learning algorithm for the discovery of high utility itemset. Inf Technol Control 52(1):25\u201336. https:\/\/doi.org\/10.5755\/j01.itc.52.1.31949","journal-title":"Inf Technol Control"},{"key":"6969_CR18","doi-asserted-by":"publisher","first-page":"7941673","DOI":"10.1155\/2023\/7941673","volume":"1","author":"Y Yang","year":"2023","unstructured":"Yang Y, Ding J, Wang H et al (2023) (2023) A high utility itemset mining algorithm based on particle filter. Math Probl Eng 1:7941673. https:\/\/doi.org\/10.1155\/2023\/7941673","journal-title":"Math Probl Eng"},{"key":"6969_CR19","doi-asserted-by":"publisher","unstructured":"Gao Z, Han M, Liu S, et\u00a0al (2024) High utility itemsets mining based on hybrid harris hawk optimization and beluga whale optimization algorithms. J Intell Fuzzy Syst 2024(Preprint):1\u201336. https:\/\/doi.org\/10.3233\/JIFS-236793","DOI":"10.3233\/JIFS-236793"},{"key":"6969_CR20","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. https:\/\/doi.org\/10.1016\/j.eswa.2018.09.051","journal-title":"Expert Syst Appl"},{"key":"6969_CR21","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 et al (2019) Tkeh: an efficient algorithm for mining top-k high utility itemsets. Appl Intell 49:1078\u20131097. https:\/\/doi.org\/10.1007\/s10489-018-1316-x","journal-title":"Appl Intell"},{"issue":"15","key":"6969_CR22","doi-asserted-by":"publisher","first-page":"17026","DOI":"10.1007\/s10489-021-02576-z","volume":"52","author":"W Song","year":"2022","unstructured":"Song W, Zheng C, Huang C et al (2022) Heuristically mining the top-k high-utility itemsets with cross-entropy optimization. Appl Intell 52(15):17026\u201317041. https:\/\/doi.org\/10.1007\/s10489-021-02576-z","journal-title":"Appl Intell"},{"key":"6969_CR23","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.knosys.2015.12.019","volume":"96","author":"JC-W Lin","year":"2016","unstructured":"Lin JC-W, Gan W, Fournier-Viger P, Hong T-P, Tseng VS (2016) Efficient algorithms for mining high-utility itemsets in uncertain databases. Knowl-Based Syst 96:171\u2013187. https:\/\/doi.org\/10.1016\/j.knosys.2015.12.019","journal-title":"Knowl-Based Syst"},{"key":"6969_CR24","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-02181-6","author":"P Fournier-Viger","year":"2022","unstructured":"Fournier-Viger P, Wang Y, Yang P et al (2022) Tspin: mining top-k stable periodic patterns. Appl Intell. https:\/\/doi.org\/10.1007\/s10489-020-02181-6","journal-title":"Appl Intell"},{"issue":"22","key":"6969_CR25","doi-asserted-by":"publisher","DOI":"10.3390\/app132212340","volume":"13","author":"K Cao","year":"2023","unstructured":"Cao K, Duan Y (2023) Mining top-k high average-utility sequential patterns for resource transformation. Appl Sci 13(22):12340. https:\/\/doi.org\/10.3390\/app132212340","journal-title":"Appl Sci"},{"key":"6969_CR26","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.107047","volume":"126","author":"S Huang","year":"2023","unstructured":"Huang S, Gan W, Miao J et al (2023) Targeted mining of top-k high utility itemsets. Eng Appl Artif Intell 126:107047. https:\/\/doi.org\/10.1016\/j.engappai.2023.107047","journal-title":"Eng Appl Artif Intell"},{"issue":"5","key":"6969_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3645115","volume":"18","author":"K Singh","year":"2024","unstructured":"Singh K, Biswas B (2024) Mining top-k high on-shelf utility itemsets using novel threshold raising strategies. ACM Trans Knowl Discov Data 18(5):1\u201323. https:\/\/doi.org\/10.1145\/3645115","journal-title":"ACM Trans Knowl Discov Data"},{"key":"6969_CR28","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.knosys.2016.04.016","volume":"104","author":"QH Duong","year":"2016","unstructured":"Duong QH, Liao B, Fournier-Viger P et al (2016) An efficient algorithm for mining the top-k high utility itemsets, using novel threshold raising and pruning strategies. Knowledge-Based Systems 104:106\u2013122. https:\/\/doi.org\/10.1016\/j.knosys.2016.04.016","journal-title":"Knowledge-Based Systems"},{"key":"6969_CR29","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.knosys.2014.12.010","volume":"76","author":"H Ryang","year":"2015","unstructured":"Ryang H, Yun U (2015) Top-k high utility pattern mining with effective threshold raising strategies. Knowl-Based Syst 76:109\u2013126. https:\/\/doi.org\/10.1016\/j.knosys.2014.12.010","journal-title":"Knowl-Based Syst"},{"issue":"1","key":"6969_CR30","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1109\/TKDE.2015.2458860","volume":"28","author":"VS Tseng","year":"2015","unstructured":"Tseng VS, Wu CW, Fournier-Viger P et al (2015) Efficient algorithms for mining top-k high utility itemsets. IEEE Trans Knowl Data Eng 28(1):54\u201367. https:\/\/doi.org\/10.1109\/TKDE.2015.2458860","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6969_CR31","doi-asserted-by":"publisher","unstructured":"Wu CW, Shie BE, Tseng VS, et\u00a0al (2012) Mining top-k high utility itemsets. In: Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining. Association for Computing Machinery, Beijing, China, pp 78\u201386, https:\/\/doi.org\/10.1145\/2339530.2339546ss","DOI":"10.1145\/2339530.2339546ss"},{"issue":"8","key":"6969_CR32","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-E, Wu C-W, Philip SY (2013) Efficient algorithms for mining high utility itemsets from transactional databases. IEEE Trans Knowl Data Eng 25(8):1772\u20131786. https:\/\/doi.org\/10.1109\/TKDE.2012.59","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"6969_CR33","doi-asserted-by":"publisher","unstructured":"Zida S, Fournier-Viger P, Lin JCW, et\u00a0al (2015) Efim: a highly efficient algorithm for high-utility itemset mining. In: Sidorov G (ed) Advances in Artificial Intelligence and Soft Computing. MICAI 2015. Lecture Notes in Computer Science(), vol 9413. Springer, Cham, pp 530\u2013546. https:\/\/doi.org\/10.1007\/978-3-319-27060-9_4","DOI":"10.1007\/978-3-319-27060-9_4"},{"key":"6969_CR34","doi-asserted-by":"publisher","first-page":"104789","DOI":"10.1109\/ACCESS.2023.3314984","volume":"11","author":"VV Vu","year":"2023","unstructured":"Vu VV, Lam MT, Duong TT et al (2023) Ftkhuim: a fast and efficient method for mining top-k high-utility itemsets. IEEE Access 11:104789\u2013104805. https:\/\/doi.org\/10.1109\/ACCESS.2023.3314984","journal-title":"IEEE Access"},{"key":"6969_CR35","doi-asserted-by":"publisher","DOI":"10.9781\/ijimai.2024.01.002","author":"S Carstensen","year":"2024","unstructured":"Carstensen S, Chun-Wei Lin J (2024) Tku-pso: an efficient particle swarm optimization model for top-k high-utility itemset mining. Comput Sci. https:\/\/doi.org\/10.9781\/ijimai.2024.01.002","journal-title":"Comput Sci"},{"key":"6969_CR36","doi-asserted-by":"publisher","unstructured":"Mofid AH, Daneshpour N, Torabi Z, et\u00a0al (2024) Tku-bchoa: an accurate meta-heuristic method to mine top-k high utility itemsets. The J Supercomput pp 1\u201322. https:\/\/doi.org\/10.1007\/s11227-024-06275-7","DOI":"10.1007\/s11227-024-06275-7"},{"issue":"3","key":"6969_CR37","doi-asserted-by":"publisher","first-page":"5637","DOI":"10.3233\/JIFS-201357","volume":"40","author":"R Sun","year":"2021","unstructured":"Sun R, Han M, Zhang C et al (2021) Mining of top-k high utility itemsets with negative utility. J Intell Fuzzy Syst 40(3):5637\u20135652. https:\/\/doi.org\/10.3233\/JIFS-201357","journal-title":"J Intell Fuzzy Syst"},{"key":"6969_CR38","doi-asserted-by":"publisher","unstructured":"Chen J, Wan S, Gan W, et\u00a0al (2021) Topic: Top-k high-utility itemset discovering. arXiv:2106.14811. https:\/\/doi.org\/10.48550\/arXiv.2106.14811","DOI":"10.48550\/arXiv.2106.14811"},{"key":"6969_CR39","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1016\/j.ins.2022.12.092","volume":"624","author":"JM Luna","year":"2023","unstructured":"Luna JM, Kiran RU, Fournier-Viger P et al (2023) Efficient mining of top-k high utility itemsets through genetic algorithms. Inf Sci 624:529\u2013553. https:\/\/doi.org\/10.1016\/j.ins.2022.12.092","journal-title":"Inf Sci"},{"key":"6969_CR40","doi-asserted-by":"publisher","first-page":"19","DOI":"10.1007\/s10479-005-5724-z","volume":"134","author":"PT De Boer","year":"2005","unstructured":"De Boer PT, Kroese DP, Mannor S et al (2005) A tutorial on the cross-entropy method. Ann Oper Res 134:19\u201367. https:\/\/doi.org\/10.1007\/s10479-005-5724-z","journal-title":"Ann Oper Res"},{"issue":"5","key":"6969_CR41","doi-asserted-by":"publisher","first-page":"4984","DOI":"10.1109\/TVT.2021.3072727","volume":"70","author":"G Raja","year":"2021","unstructured":"Raja G, Suresh S, Anbalagan S et al (2021) Pfin: an efficient particle filter-based indoor navigation framework for uavs. IEEE Trans Veh Technol 70(5):4984\u20134992. https:\/\/doi.org\/10.1109\/TVT.2021.3072727","journal-title":"IEEE Trans Veh Technol"},{"issue":"09","key":"6969_CR42","doi-asserted-by":"publisher","DOI":"10.1142\/S0129183122501169","volume":"33","author":"X Lu","year":"2022","unstructured":"Lu X, Li F, Tang J et al (2022) A new performance index for measuring the effect of single target tracking with kalman particle filter. Int J Mod Phys C 33(09):2250116. https:\/\/doi.org\/10.1142\/S0129183122501169","journal-title":"Int J Mod Phys C"},{"issue":"4","key":"6969_CR43","doi-asserted-by":"publisher","first-page":"3485","DOI":"10.1109\/TIE.2020.2978688","volume":"68","author":"S Kim","year":"2020","unstructured":"Kim S, Park HJ, Choi JH et al (2020) A novel prognostics approach using shifting kernel particle filter of li-ion batteries under state changes. IEEE Trans Industr Electron 68(4):3485\u20133493. https:\/\/doi.org\/10.1109\/TIE.2020.2978688","journal-title":"IEEE Trans Industr Electron"},{"issue":"5","key":"6969_CR44","doi-asserted-by":"publisher","first-page":"2878","DOI":"10.1109\/TITS.2020.2976671","volume":"22","author":"L Wei","year":"2020","unstructured":"Wei L, Wang Y, Chen P (2020) A particle filter-based approach for vehicle trajectory reconstruction using sparse probe data. IEEE Trans Intell Transp Syst 22(5):2878\u20132890. https:\/\/doi.org\/10.1109\/TITS.2020.2976671","journal-title":"IEEE Trans Intell Transp Syst"},{"issue":"9","key":"6969_CR45","doi-asserted-by":"publisher","first-page":"3144","DOI":"10.1109\/LCOMM.2021.3090300","volume":"25","author":"W Shao","year":"2021","unstructured":"Shao W, Zhao F, Luo H et al (2021) Particle filter reinforcement via context-sensing for smartphone-based pedestrian dead reckoning. IEEE Commun Lett 25(9):3144\u20133148. https:\/\/doi.org\/10.1109\/LCOMM.2021.3090300","journal-title":"IEEE Commun Lett"},{"key":"6969_CR46","doi-asserted-by":"publisher","unstructured":"Kuptametee C, Aunsri N (2022) A review of resampling techniques in particle filtering framework. Measurement 193:110836.1\u2013110836.14. https:\/\/doi.org\/10.1016\/j.measurement.2022.110836","DOI":"10.1016\/j.measurement.2022.110836"},{"key":"6969_CR47","doi-asserted-by":"publisher","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, et\u00a0al (2016) The spmf open-source data mining library version 2. In: Machine Learning and Knowledge Discovery in Databases: European Conference, ECML PKDD 2016, September 19-23, 2016, Proceedings, Part III 16. Springer, Riva del Garda, Italy, pp 36\u201340. https:\/\/doi.org\/10.1007\/978-3-319-46131-1_8","DOI":"10.1007\/978-3-319-46131-1_8"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06969-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06969-2","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06969-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,19]],"date-time":"2025-12-19T01:05:10Z","timestamp":1766106310000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06969-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11]]},"references-count":47,"journal-issue":{"issue":"17","published-print":{"date-parts":[[2025,11]]}},"alternative-id":["6969"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06969-2","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11]]},"assertion":[{"value":"17 January 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 October 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2025","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 have no competing interests to declare that are relevant to the content of this article.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interests"}},{"value":"Not applicable","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical and Informed Consent for Data Used"}}],"article-number":"1091"}}