{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,8]],"date-time":"2026-01-08T21:21:11Z","timestamp":1767907271647,"version":"3.49.0"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T00:00:00Z","timestamp":1714089600000},"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":["Multimed Tools Appl"],"DOI":"10.1007\/s11042-024-18913-6","type":"journal-article","created":{"date-parts":[[2024,4,26]],"date-time":"2024-04-26T05:01:42Z","timestamp":1714107702000},"page":"7835-7861","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An innovative clustering approach utilizing frequent item sets"],"prefix":"10.1007","volume":"84","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5912-3094","authenticated-orcid":false,"given":"Youness","family":"Manzali","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Khalidou Abdoulaye","family":"Barry","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rachid","family":"Flouchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Youssef","family":"Balouki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamad","family":"Elfar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,4,26]]},"reference":[{"key":"18913_CR1","unstructured":"MacQueen J (1967) Classification and analysis of multivariate observations. 5th Berkeley symposium on mathematical statistics and probability, 281\u2013297"},{"key":"18913_CR2","unstructured":"Huang Z (1997) Clustering large data sets with mixed numeric and categorical values. In: Proceedings of the 1st Pacific-Asia conference on knowledge discovery and data mining (PAKDD). Citeseer, pp 21\u201334"},{"issue":"8","key":"18913_CR3","first-page":"34","volume":"3","author":"Z Huang","year":"1997","unstructured":"Huang Z (1997) A fast clustering algorithm to cluster very large categorical data sets in data mining. DMKD 3(8):34\u201339","journal-title":"DMKD"},{"key":"18913_CR4","doi-asserted-by":"crossref","unstructured":"Sibson R (1973) SLINK: an optimally efficient algorithm for the single-link cluster method. Comput J 16(1):30\u201334. Oxford University Press","DOI":"10.1093\/comjnl\/16.1.30"},{"key":"18913_CR5","doi-asserted-by":"crossref","unstructured":"Defays D (1977) An efficient algorithm for a complete link method. Comput J 20(4):364\u2013366. Oxford University Press","DOI":"10.1093\/comjnl\/20.4.364"},{"key":"18913_CR6","doi-asserted-by":"crossref","unstructured":"Olson CF (1995) Parallel algorithms for hierarchical clustering. Parallel Comput 21(8):1313\u20131325. Elsevier","DOI":"10.1016\/0167-8191(95)00017-I"},{"key":"18913_CR7","doi-asserted-by":"crossref","unstructured":"Sharma KK, Ayan Seal A (2020) Clustering analysis using an adaptive fused distance. Eng Appl Artif Intell 96:103928. Elsevier","DOI":"10.1016\/j.engappai.2020.103928"},{"key":"18913_CR8","doi-asserted-by":"crossref","unstructured":"Sinaga KP, Yang M-S (2020) Unsupervised K-means clustering algorithm. IEEE Access 8:80716\u201380727. IEEE","DOI":"10.1109\/ACCESS.2020.2988796"},{"key":"18913_CR9","doi-asserted-by":"crossref","unstructured":"Li H, Liu X, Li T, Gan R (2020) A novel density-based clustering algorithm using nearest neighbor graph. Pattern Recogn 102:107206. Elsevier","DOI":"10.1016\/j.patcog.2020.107206"},{"key":"18913_CR10","doi-asserted-by":"crossref","unstructured":"Hamidi SS, Akbari E, Motameni H (2019) Consensus clustering algorithm based on the automatic partitioning similarity graph. Data Knowl Eng 124:101754. Elsevier","DOI":"10.1016\/j.datak.2019.101754"},{"key":"18913_CR11","doi-asserted-by":"crossref","unstructured":"Abbasi S, Nejatian S, Parvin H, Rezaie V, Bagherifard K (2019) Clustering ensemble selection considering quality and diversity. Artif Intell Rev 52(2):1311\u20131340. Springer","DOI":"10.1007\/s10462-018-9642-2"},{"key":"18913_CR12","doi-asserted-by":"crossref","unstructured":"Scitovski R, Sabo K (2020) DBSCAN-like clustering method for various data densities. Pattern Anal Appl 23(2):541\u2013554. Springer","DOI":"10.1007\/s10044-019-00809-z"},{"key":"18913_CR13","doi-asserted-by":"crossref","unstructured":"Wang S, Li Q, Zhao C, Zhu X, Yuan H, Dai T (2021) Extreme clustering\u2013A clustering method via density extreme points. Inform Sci 542:24\u201339. Elsevier","DOI":"10.1016\/j.ins.2020.06.069"},{"key":"18913_CR14","doi-asserted-by":"crossref","unstructured":"Hashemzadeh M, Oskouei AG, Farajzadeh N (2019) New fuzzy C-means clustering method based on feature-weight and cluster-weight learning. Appl Soft Comput 78:324\u2013345. Elsevier","DOI":"10.1016\/j.asoc.2019.02.038"},{"key":"18913_CR15","doi-asserted-by":"crossref","unstructured":"Kaufman L (1990) Finding groups in data: an introduction to cluster analysis. Wiley-Interscience, pp 230\u2013234","DOI":"10.1002\/9780470316801"},{"key":"18913_CR16","doi-asserted-by":"crossref","unstructured":"McLachlan GJ, Basford KE (1988) Mixture models. Inference and applications to clustering. In: Statistics: textbooks and monographs","DOI":"10.2307\/2348072"},{"issue":"1","key":"18913_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","volume":"39","author":"AP Dempster","year":"1977","unstructured":"Dempster AP, Laird NM, Rubin DB (1977) Maximum likelihood from incomplete data via the EM algorithm. J Roy Statist Soc 39(1):1\u201338","journal-title":"J Roy Statist Soc"},{"key":"18913_CR18","doi-asserted-by":"crossref","unstructured":"Yu J, Chaomurilige C, Yang M-S (2018) On convergence and parameter selection of the EM and DA-EM algorithms for Gaussian mixtures. Pattern Recogn 77:188\u2013203. Elsevier","DOI":"10.1016\/j.patcog.2017.12.014"},{"key":"18913_CR19","doi-asserted-by":"crossref","unstructured":"Jain AK (2010) Data clustering: 50 years beyond K-means. Pattern Recogn Lett 31(8):651\u2013666. Elsevier","DOI":"10.1016\/j.patrec.2009.09.011"},{"key":"18913_CR20","doi-asserted-by":"crossref","unstructured":"Yang M-S, Chang-Chien S-J, Nataliani Y (2018) A fully-unsupervised possibilistic C-means clustering algorithm. IEEE Access 6:78308\u201378320. IEEE","DOI":"10.1109\/ACCESS.2018.2884956"},{"key":"18913_CR21","doi-asserted-by":"crossref","unstructured":"Filippone M, Camastra F, Masulli F, Rovetta S (2008) A survey of kernel and spectral methods for clustering. Pattern Recogn 41(1):176\u2013190. Elsevier","DOI":"10.1016\/j.patcog.2007.05.018"},{"key":"18913_CR22","doi-asserted-by":"crossref","unstructured":"Bl\u00f6mer J, Lammersen C, Schmidt M, Sohler C (2016) Theoretical analysis of the k-means algorithm\u2013a survey. In: Algorithm engineering: selected results and surveys. Springer, pp 81\u2013116","DOI":"10.1007\/978-3-319-49487-6_3"},{"key":"18913_CR23","doi-asserted-by":"crossref","unstructured":"Fr\u00e4nti P, Sieranoja S (2018) K-means properties on six clustering benchmark datasets. Appl Intell 48(12):4743\u20134759. http:\/\/cs.uef.fi\/sipu\/datasets\/","DOI":"10.1007\/s10489-018-1238-7"},{"key":"18913_CR24","volume-title":"UCI machine learning repository","author":"A Asuncion","year":"2007","unstructured":"Asuncion A, Newman D (2007) UCI machine learning repository. Irvine, CA, USA"},{"key":"18913_CR25","unstructured":"Kaggle machine learning repository (19991)"},{"key":"18913_CR26","doi-asserted-by":"crossref","unstructured":"von Luxburg U (2017) A tutorial on spectral clustering. Statist Comput 17(4):395\u2013416. Springer","DOI":"10.1007\/s11222-007-9033-z"},{"key":"18913_CR27","doi-asserted-by":"crossref","unstructured":"Scitovski R, Sabo K (2019) Application of the DIRECT algorithm to searching for an optimal k partition of the set $$\\cal{A} \\subset \\mathbb{R} ^{n}$$ and its application to the multiple circle detection problem. J Glob Optimiz 74:63\u201377. Springer","DOI":"10.1007\/s10898-019-00743-8"},{"key":"18913_CR28","doi-asserted-by":"crossref","unstructured":"Wang Z (2020) A new clustering method based on morphological operations. Expert Syst Appl 145:113102. Elsevier","DOI":"10.1016\/j.eswa.2019.113102"},{"key":"18913_CR29","doi-asserted-by":"crossref","unstructured":"Xu D, Tian Y (2015) A comprehensive survey of clustering algorithms. Ann Data Sci 2:165\u2013193. Springer","DOI":"10.1007\/s40745-015-0040-1"},{"key":"18913_CR30","doi-asserted-by":"crossref","unstructured":"Djenouri Y, Belhadi A, Fournier-Viger P, Chun-Wei Lin J (2018) Fast and effective cluster-based information retrieval using frequent closed itemsets. Inform Sci 453:154\u2013167. Elsevier","DOI":"10.1016\/j.ins.2018.04.008"},{"key":"18913_CR31","doi-asserted-by":"crossref","unstructured":"Kurita T (1991) An efficient agglomerative clustering algorithm using a heap. Pattern Recogn 24(3):205\u2013209. Elsevier","DOI":"10.1016\/0031-3203(91)90062-A"},{"key":"18913_CR32","doi-asserted-by":"crossref","unstructured":"Zhang T, Ramakrishnan R, Livny M (1996) BIRCH: an efficient data clustering method for very large databases. ACM SIGMOD Rec 25(2):103\u2013114. ACM New York, USA","DOI":"10.1145\/235968.233324"},{"key":"18913_CR33","doi-asserted-by":"crossref","unstructured":"Nguyen-Trang T, Nguyen-Thoi T, Nguyen-Thi K-N, Vo-Van T (2022) Balance-driven automatic clustering for probability density functions using metaheuristic optimization. Int J Mach Learn Cybern 1\u201316. Springer","DOI":"10.1007\/s13042-022-01683-8"},{"key":"18913_CR34","doi-asserted-by":"crossref","unstructured":"Jiang C, Li Z, Yao J (2022) A shadowed set-based three-way clustering ensemble approach. Int J Mach Learn Cybern 1\u201314. Springer","DOI":"10.1007\/s13042-022-01543-5"},{"key":"18913_CR35","doi-asserted-by":"crossref","unstructured":"Loyola-Gonzalez O, Gutierrez-Rodr\u00edguez AE, Medina-P\u00e9rez MA, Monroy R, Mart\u00ednez-Trinidad JF, Carrasco-Ochoa JA, Garcia-Borroto M (2020) An explainable artificial intelligence model for clustering numerical databases. IEEE Access 8:52370\u201352384. IEEE","DOI":"10.1109\/ACCESS.2020.2980581"},{"key":"18913_CR36","doi-asserted-by":"crossref","unstructured":"Wan D, Razavi-Far R, Saif M, Mozafari N (2021) COLI: collaborative clustering missing data imputation. Pattern Recogn Lett 152:420\u2013427. Elsevier","DOI":"10.1016\/j.patrec.2021.11.011"},{"key":"18913_CR37","doi-asserted-by":"crossref","unstructured":"Sengupta S, Das S (2022) Selective nearest neighbors clustering. Pattern Recogn Lett 155:178\u2013185. Elsevier","DOI":"10.1016\/j.patrec.2021.10.005"},{"key":"18913_CR38","doi-asserted-by":"crossref","unstructured":"Andrade D, Fukumizu K, Okajima Y (2021) Convex covariate clustering for classification. Pattern Recogn Lett 151:193\u2013199. Elsevier","DOI":"10.1016\/j.patrec.2021.08.012"},{"key":"18913_CR39","doi-asserted-by":"crossref","unstructured":"Lee Y-H, Jen-Hwa HuP, Zhu H, Chen H-W (2020) Discovering event episodes from sequences of online news articles: a time-adjoining frequent itemset-based clustering method. Inform Manag 57(7):103348. Elsevier","DOI":"10.1016\/j.im.2020.103348"},{"issue":"7","key":"18913_CR40","doi-asserted-by":"publisher","first-page":"745","DOI":"10.4304\/jsw.5.7.745-752","volume":"5","author":"S Gong","year":"2010","unstructured":"Gong S (2010) A collaborative filtering recommendation algorithm based on user clustering and item clustering. J Softw 5(7):745\u2013752","journal-title":"J Softw"},{"key":"18913_CR41","doi-asserted-by":"crossref","unstructured":"Rouane O, Belhadef H, Bouakkaz M (2019) Combine clustering and frequent itemsets mining to enhance biomedical text summarization. Expert Syst Appl 135:362\u2013373. Elsevier","DOI":"10.1016\/j.eswa.2019.06.002"},{"key":"18913_CR42","doi-asserted-by":"crossref","unstructured":"Shankar R, Kiran GVR, Pudi V (2010) Evolutionary clustering using frequent itemsets. In: Proceedings of the first international workshop on novel data stream pattern mining techniques, pp 25\u201330","DOI":"10.1145\/1833280.1833284"},{"key":"18913_CR43","doi-asserted-by":"crossref","unstructured":"Agbaje MB, Ezugwu AE, Els R (2019) Automatic data clustering using hybrid firefly particle swarm optimization algorithm. IEEE Access 7:184963\u2013184984. IEEE","DOI":"10.1109\/ACCESS.2019.2960925"},{"key":"18913_CR44","doi-asserted-by":"crossref","unstructured":"Behera M, Sarangi A, Mishra D, Mallick PK, Shafi J, Srinivasu PN, Ijaz MF (2022) Automatic data clustering by hybrid enhanced firefly and particle swarm optimization algorithms. Mathematics 10(19):3532. MDPI","DOI":"10.3390\/math10193532"},{"key":"18913_CR45","doi-asserted-by":"crossref","unstructured":"Rajah V, Ezugwu AE (2020) Hybrid symbiotic organism search algorithms for automatic data clustering. 2020 conference on Information Communications Technology and Society (ICTAS). IEEE, pp 1\u20139","DOI":"10.1109\/ICTAS47918.2020.234001"},{"key":"18913_CR46","doi-asserted-by":"crossref","unstructured":"Aliniya Z, Mirroshandel SA (2019) A novel combinatorial merge-split approach for automatic clustering using imperialist competitive algorithm. Expert Syst Appl 117:243\u2013266. Elsevier","DOI":"10.1016\/j.eswa.2018.09.050"},{"key":"18913_CR47","doi-asserted-by":"crossref","unstructured":"Zhou Y, Wu H, Luo Q, Abdel-Baset M (2019) Automatic data clustering using nature-inspired symbiotic organism search algorithm. Knowl-Based Syst 163:546\u2013557. Elsevier","DOI":"10.1016\/j.knosys.2018.09.013"},{"key":"18913_CR48","doi-asserted-by":"crossref","unstructured":"Pacheco TM, Gon\u00e7alves LB, Str\u00f6ele V, Soares SSRF (2018) An ant colony optimization for automatic data clustering problem. 2018 IEEE congress on evolutionary computation (CEC). IEEE, pp 1\u20138","DOI":"10.1109\/CEC.2018.8477806"},{"key":"18913_CR49","doi-asserted-by":"crossref","unstructured":"Kuo R-J, Zulvia FE (2018) Automatic clustering using an improved artificial bee colony optimization for customer segmentation. Knowl Inform Syst 57(2):331\u2013357. Springer","DOI":"10.1007\/s10115-018-1162-5"},{"key":"18913_CR50","doi-asserted-by":"crossref","unstructured":"Sharma M, Chhabra JK (2019) Sustainable automatic data clustering using hybrid PSO algorithm with mutation. Sustain Comput: Inform Syst 23:144\u2013157. Elsevier","DOI":"10.1016\/j.suscom.2019.07.009"},{"key":"18913_CR51","doi-asserted-by":"crossref","unstructured":"Yang Y, Lian B, Li L, Chen C, Li P (2014) DBSCAN clustering algorithm applied to identify suspicious financial transactions. 2014 international conference on cyber-enabled distributed computing and knowledge discovery. IEEE, pp 60\u201365","DOI":"10.1109\/CyberC.2014.89"},{"key":"18913_CR52","doi-asserted-by":"crossref","unstructured":"Alkhasov SS, Tselykh AN, Tselykh AA (2015) Application of cluster analysis for the assessment of the share of fraud victims among bank card holders. In: Proceedings of the 8th international conference on security of information and networks, pp 103\u2013106","DOI":"10.1145\/2799979.2800033"},{"key":"18913_CR53","doi-asserted-by":"crossref","unstructured":"Kisore NR, Koteswaraiah CB (2017) Improving ATM coverage area using density based clustering algorithm and voronoi diagrams. Inform Sci 376:1\u201320. Elsevier","DOI":"10.1016\/j.ins.2016.09.058"},{"key":"18913_CR54","doi-asserted-by":"crossref","unstructured":"Waheed A, Akram MU, Khalid S, Waheed Z, Khan MA, Shaukat A (2015) Hybrid features and mediods classification based robust segmentation of blood vessels. J Med Syst 39:1\u201314. Springer","DOI":"10.1007\/s10916-015-0316-1"},{"key":"18913_CR55","doi-asserted-by":"crossref","unstructured":"Akram MU, Khalid S, Tariq A, Javed MY (2013) Detection of neovascularization in retinal images using multivariate m-Mediods based classifier. Computer Med Imag Graph 37(5\u20136):346\u2013357. Elsevier","DOI":"10.1016\/j.compmedimag.2013.06.008"},{"key":"18913_CR56","unstructured":"Patel PM, Shah BN, Shah V (2013) Image segmentation using K-mean clustering for finding tumor in medical application. Int J Comput Trends Technol 4(5):1239\u20131242"},{"key":"18913_CR57","doi-asserted-by":"crossref","unstructured":"Ai L, Gao X, Xiong J (2014) Application of mean-shift clustering to blood oxygen level dependent functional MRI activation detection. BMC Med Imag 14(1):1\u201310. BioMed Central","DOI":"10.1186\/1471-2342-14-6"},{"key":"18913_CR58","doi-asserted-by":"crossref","unstructured":"Saha S, Alok AK, Ekbal A (2016) Brain image segmentation using semi-supervised clustering. Expert Syst Appl 52:50\u201363. Elsevier","DOI":"10.1016\/j.eswa.2016.01.005"},{"key":"18913_CR59","unstructured":"Ziedan I, Zamel A, Al Zohairy (2015) A clustering of medical X-ray images by merging outputs of different classification techniques. In: CLEF (Working Notes)"},{"key":"18913_CR60","doi-asserted-by":"crossref","unstructured":"Guo L, Chen L, Chen CLP (2016) Image guided fuzzy clustering for image segmentation. 2016 IEEE international conference on systems, man, and cybernetics (SMC). IEEE, pp 004271\u2013004276","DOI":"10.1109\/SMC.2016.7844902"},{"key":"18913_CR61","doi-asserted-by":"crossref","unstructured":"Choy SK, Lam SY, Yu KW, Lee WY, Leung KT (2017) Fuzzy model-based clustering and its application in image segmentation. Pattern Recogn 68:141\u2013157. Elsevier","DOI":"10.1016\/j.patcog.2017.03.009"},{"key":"18913_CR62","doi-asserted-by":"crossref","unstructured":"Li N, Huo H, Zhao Y-M, Chen X, Fang T (2013) A spatial clustering method with edge weighting for image segmentation. IEEE Geosci Remote Sens Lett 10(5):1124\u20131128. IEEE","DOI":"10.1109\/LGRS.2012.2231662"},{"key":"18913_CR63","doi-asserted-by":"crossref","unstructured":"Kim S, Yoo CD, Nowozin S, Kohli P (2014) Image segmentation using higher-order correlation clustering. IEEE Trans Pattern Anal Mach Intell 36(9):1761\u20131774. IEEE","DOI":"10.1109\/TPAMI.2014.2303095"},{"key":"18913_CR64","doi-asserted-by":"crossref","unstructured":"Kharinov MV (2015) Pixel clustering for color image segmentation. Program Comput Softw 41:258\u2013266. Springer","DOI":"10.1134\/S0361768815050047"},{"key":"18913_CR65","doi-asserted-by":"crossref","unstructured":"Meng Y, Liu X (2007) Application of K-means algorithm based on ant clustering algorithm in macroscopic planning of highway transportation hub. 2007 first IEEE international symposium on information technologies and applications in education. IEEE, pp 483\u2013488","DOI":"10.1109\/ISITAE.2007.4409331"},{"key":"18913_CR66","doi-asserted-by":"crossref","unstructured":"Zhou Z, Si G, Chen J, Zheng K, Yue W (2017) A novel method of transformer fault diagnosis based on k-mediods and decision tree algorithm. 2017 1st international conference on electrical materials and power equipment (ICEMPE). IEEE, pp 369\u2013373","DOI":"10.1109\/ICEMPE.2017.7982105"},{"key":"18913_CR67","doi-asserted-by":"crossref","unstructured":"Peng X, Zhou C, Hepburn DM, Judd MD, Siew WH (2013) Application of K-Means method to pattern recognition in on-line cable partial discharge monitoring. IEEE Trans Dielectr Electr Insul 20(3):754\u2013761. IEEE","DOI":"10.1109\/TDEI.2013.6518945"},{"key":"18913_CR68","unstructured":"Pomente A, Aleandri D (2017) Convolutional expectation maximization for population estimation. In: CLEF (Working Notes)"},{"key":"18913_CR69","doi-asserted-by":"crossref","unstructured":"Huang H, Zhou G, Liang N, Zhao Q, Xie S (2022) Diverse deep matrix factorization with hypergraph regularization for multiview data representation. IEEE\/CAA J Automat Sin. IEEE","DOI":"10.1109\/JAS.2022.105980"},{"key":"18913_CR70","doi-asserted-by":"crossref","unstructured":"Huang H, Zhou G, Zhao Q, He L, Xie S (2023) Comprehensive multiview representation learning via deep autoencoder-like nonnegative matrix factorization. IEEE Trans Neural Netw Learn Syst. IEEE","DOI":"10.1109\/TNNLS.2023.3304626"},{"key":"18913_CR71","doi-asserted-by":"crossref","unstructured":"Rodr\u00edguez-Fdez I, Canosa A, Mucientes M, Bugar\u00edn A (2015) STAC: a web platform for the comparison of algorithms using statistical tests. 2015 IEEE international conference on fuzzy systems (FUZZ-IEEE). IEEE, pp 1\u20138","DOI":"10.1109\/FUZZ-IEEE.2015.7337889"},{"key":"18913_CR72","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In: Proceedings of the 20th international conference on Very Large Data Bases, VLDB, vol 1215. Santiago, Chile, pp 487\u2013499"}],"container-title":["Multimedia Tools and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-18913-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11042-024-18913-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11042-024-18913-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,31]],"date-time":"2025-03-31T04:16:54Z","timestamp":1743394614000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11042-024-18913-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,26]]},"references-count":72,"journal-issue":{"issue":"10","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["18913"],"URL":"https:\/\/doi.org\/10.1007\/s11042-024-18913-6","relation":{},"ISSN":["1573-7721"],"issn-type":[{"value":"1573-7721","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,4,26]]},"assertion":[{"value":"4 October 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"5 February 2024","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 March 2024","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"26 April 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 have no relevant financial or non-financial interests to disclose.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing Interest"}}]}}