{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T09:20:15Z","timestamp":1768814415955,"version":"3.49.0"},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T00:00:00Z","timestamp":1636329600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Appl Intell"],"published-print":{"date-parts":[[2022,6]]},"DOI":"10.1007\/s10489-021-02922-1","type":"journal-article","created":{"date-parts":[[2021,11,8]],"date-time":"2021-11-08T03:02:43Z","timestamp":1636340563000},"page":"8839-8855","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Discovery of closed high utility itemsets using a fast nature-inspired ant colony algorithm"],"prefix":"10.1007","volume":"52","author":[{"given":"Subhadip","family":"Pramanik","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4420-0077","authenticated-orcid":false,"given":"Adrijit","family":"Goswami","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,11,8]]},"reference":[{"key":"2922_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal R, Imieli\u0144ski T., Swami A (1993) Mining association rules between sets of items in large databases. In: Proceedings of the 1993 ACM SIGMOD international conference on Management of data, pp 207\u2013216","DOI":"10.1145\/170036.170072"},{"issue":"6","key":"2922_CR2","doi-asserted-by":"publisher","first-page":"962","DOI":"10.1109\/69.553164","volume":"8","author":"R Agrawal","year":"1996","unstructured":"Agrawal R, Shafer JC (1996) Parallel mining of association rules. IEEE Trans Knowl Data Eng 8(6):962\u2013969","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"15","key":"2922_CR3","doi-asserted-by":"publisher","first-page":"11979","DOI":"10.1016\/j.eswa.2012.03.062","volume":"39","author":"CF Ahmed","year":"2012","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Choi HJ (2012) Interactive mining of high utility patterns over data streams. Expert Syst Appl 39(15):11979\u201311991","journal-title":"Expert Syst Appl"},{"issue":"12","key":"2922_CR4","doi-asserted-by":"publisher","first-page":"1708","DOI":"10.1109\/TKDE.2009.46","volume":"21","author":"CF Ahmed","year":"2009","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2009) Efficient tree structures for high utility pattern mining in incremental databases. IEEE Trans Knowl Data Eng 21(12):1708\u20131721","journal-title":"IEEE Trans Knowl Data Eng"},{"issue":"2","key":"2922_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1007\/s10489-009-0188-5","volume":"34","author":"CF Ahmed","year":"2011","unstructured":"Ahmed CF, Tanbeer SK, Jeong BS, Lee YK (2011) Huc-prune: an efficient candidate pruning technique to mine high utility patterns. Appl Intell 34(2):181\u2013198","journal-title":"Appl Intell"},{"key":"2922_CR6","doi-asserted-by":"crossref","unstructured":"Borgelt C (2005) Keeping things simple: finding frequent item sets by recursive elimination. In: Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, pp 66\u201370","DOI":"10.1145\/1133905.1133914"},{"key":"2922_CR7","unstructured":"Chan R, Yang Q, Shen YD (2003) Mining high utility itemsets. In: Proceedings of the Third IEEE International Conference on Data Mining, ICDM \u201903, IEEE Computer Society, USA"},{"issue":"3","key":"2922_CR8","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1057\/dbm.2012.17","volume":"19","author":"D Chen","year":"2012","unstructured":"Chen D, Sain SL, Guo K (2012) Data mining for the online retail industry: a case study of rfm model-based customer segmentation using data mining. J Database Market Custom Strategy Manag 19(3):197\u2013208","journal-title":"J Database Market Custom Strategy Manag"},{"issue":"2","key":"2922_CR9","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 (2019) Cls-miner: efficient and effective closed high-utility itemset mining. Front Comput Sci 13(2):357\u2013381","journal-title":"Front Comput Sci"},{"issue":"3","key":"2922_CR10","doi-asserted-by":"publisher","first-page":"809","DOI":"10.1007\/s10489-017-0932-1","volume":"47","author":"S Dawar","year":"2017","unstructured":"Dawar S, Goyal V, Bera D (2017) A hybrid framework for mining high-utility itemsets in a sparse transaction database. Appl Intell 47(3):809\u2013827","journal-title":"Appl Intell"},{"issue":"9","key":"2922_CR11","doi-asserted-by":"publisher","first-page":"3161","DOI":"10.1007\/s10489-017-1130-x","volume":"48","author":"Z Deng","year":"2018","unstructured":"Deng Z (2018) An efficient structure for fast mining high utility itemsets. Appl Intell 48 (9):3161\u20133177","journal-title":"Appl Intell"},{"issue":"1","key":"2922_CR12","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"2922_CR13","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) Ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B (Cybern) 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B (Cybern)"},{"key":"2922_CR14","unstructured":"Fayyad UM, Piatetsky-Shapiro G, Smyth P, Uthurusamy R (1996) Advances in knowledge discovery and data mining. American Association for Artificial Intelligence"},{"key":"2922_CR15","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Lin JCW, Gomariz A, Gueniche T, Soltani A, Deng Z, Lam HT (2016) The spmf open-source data mining library version 2. In: Joint european conference on machine learning and knowledge discovery in databases. Springer, pp 36\u201340","DOI":"10.1007\/978-3-319-46131-1_8"},{"key":"2922_CR16","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Wu CW, Zida S, Tseng VS (2014) Fhm: Faster high-utility itemset mining using estimated utility co-occurrence pruning. In: International symposium on methodologies for intelligent systems. Springer, pp 83\u201392","DOI":"10.1007\/978-3-319-08326-1_9"},{"key":"2922_CR17","doi-asserted-by":"crossref","unstructured":"Fournier-Viger P, Zhang Y, Lin JCW, Fujita H, Koh YS (2018) Mining local high utility itemsets. In: International conference on database and expert systems applications. Springer, pp 450\u2013460","DOI":"10.1007\/978-3-319-98812-2_41"},{"key":"2922_CR18","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 (2019) Mining local and peak high utility itemsets. Inf Sci 481:344\u2013367","journal-title":"Inf Sci"},{"key":"2922_CR19","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.knosys.2017.12.003","volume":"143","author":"W Gan","year":"2018","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Fujita H (2018) Extracting non-redundant correlated purchase behaviors by utility measure. Knowl-Based Syst 143:30\u201341","journal-title":"Knowl-Based Syst"},{"issue":"2","key":"2922_CR20","doi-asserted-by":"publisher","first-page":"e1242","DOI":"10.1002\/widm.1242","volume":"8","author":"W Gan","year":"2018","unstructured":"Gan W, Lin JCW, Fournier-Viger P, Chao HC, Hong TP, Fujita H (2018) A survey of incremental high-utility itemset mining. Wiley Interdiscip Rev Data Min Knowl Discov 8(2):e1242","journal-title":"Wiley Interdiscip Rev Data Min Knowl Discov"},{"key":"2922_CR21","doi-asserted-by":"crossref","unstructured":"Goethals B (2003) Frequent itemset mining dataset repository. Frequent Itemset Mining Implementations (FIMI\u201903)","DOI":"10.1145\/967900.968012"},{"issue":"1","key":"2922_CR22","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 Discov 8(1):53\u201387","journal-title":"Data Min Knowl Discov"},{"key":"2922_CR23","unstructured":"Holland J (1975) Adaptation in natural and artificial systems: an introductory analysis with application to biology Control and artificial intelligence"},{"issue":"4","key":"2922_CR24","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","journal-title":"Appl Artif Intell"},{"key":"2922_CR25","unstructured":"Kennedy J, Eberhart R (1995) Particle swarm optimization. In: Proceedings of ICNN\u201995-International Conference on Neural Networks. IEEE, vol 4, pp 1942\u20131948"},{"issue":"5","key":"2922_CR26","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","journal-title":"Expert Syst Appl"},{"issue":"1","key":"2922_CR27","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/s10115-012-0492-y","volume":"38","author":"GC Lan","year":"2014","unstructured":"Lan GC, Hong TP, Tseng VS (2014) An efficient projection-based indexing approach for mining high utility itemsets. Knowl Inf Syst 38(1):85\u2013107","journal-title":"Knowl Inf Syst"},{"key":"2922_CR28","doi-asserted-by":"crossref","unstructured":"Li YC, Yeh JS, Chang CC (2005) Direct candidates generation: a novel algorithm for discovering complete share-frequent itemsets. In: International conference on fuzzy systems and knowledge discovery. Springer, pp 551\u2013560","DOI":"10.1007\/11540007_67"},{"issue":"1","key":"2922_CR29","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"YC Li","year":"2008","unstructured":"Li YC, Yeh JS, Chang CC (2008) Isolated items discarding strategy for discovering high utility itemsets. Data Knowl Eng 64(1):198\u2013217","journal-title":"Data Knowl Eng"},{"key":"2922_CR30","doi-asserted-by":"publisher","first-page":"107422","DOI":"10.1016\/j.asoc.2021.107422","volume":"108","author":"JCW Lin","year":"2021","unstructured":"Lin JCW, Djenouri Y, Srivastava G, Yun U, Fournier-Viger P (2021) A predictive ga-based model for closed high-utility itemset mining. Appl Soft Comput 108:107422","journal-title":"Appl Soft Comput"},{"issue":"2","key":"2922_CR31","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Gan W, Fournier-Viger P, Hong TP, Tseng VS (2016) Fast algorithms for mining high-utility itemsets with various discount strategies. Adv Eng Inform 30(2):109\u2013126","journal-title":"Adv Eng Inform"},{"issue":"1","key":"2922_CR32","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/s10489-015-0697-3","volume":"44","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Gan W, Hong TP (2016) Maintaining the discovered high-utility itemsets with transaction modification. Appl Intell 44(1):166\u2013178","journal-title":"Appl Intell"},{"issue":"17","key":"2922_CR33","doi-asserted-by":"publisher","first-page":"5103","DOI":"10.1007\/s00500-016-2106-1","volume":"21","author":"JCW Lin","year":"2017","unstructured":"Lin JCW, Yang L, Fournier-Viger P, Hong TP, Voznak M (2017) A binary pso approach to mine high-utility itemsets. Soft Comput 21(17):5103\u20135121","journal-title":"Soft Comput"},{"key":"2922_CR34","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.engappai.2016.07.006","volume":"55","author":"JCW Lin","year":"2016","unstructured":"Lin JCW, Yang L, Fournier-Viger P, Wu JMT, Hong TP, Wang LSL, Zhan J (2016) Mining high-utility itemsets based on particle swarm optimization. Eng Appl Artif Intell 55:320\u2013330","journal-title":"Eng Appl Artif Intell"},{"key":"2922_CR35","doi-asserted-by":"crossref","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, pp 55\u201364","DOI":"10.1145\/2396761.2396773"},{"key":"2922_CR36","doi-asserted-by":"crossref","unstructured":"Liu Y, Liao WK, Choudhary A (2005) A two-phase algorithm for fast discovery of high utility itemsets. In: Pacific-asia conference on knowledge discovery and data mining. Springer, pp 689\u2013695","DOI":"10.1007\/11430919_79"},{"issue":"1","key":"2922_CR37","doi-asserted-by":"publisher","first-page":"230","DOI":"10.1186\/1471-2105-14-230","volume":"14","author":"Y Liu","year":"2013","unstructured":"Liu Y, Cheng CP, 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":"2922_CR38","doi-asserted-by":"crossref","unstructured":"NAWAZ MS, Fournier-Viger P, YUN U, WU Y, Song W (2021) Mining high utility itemsets with hill climbing and simulated annealing","DOI":"10.1145\/3462636"},{"key":"2922_CR39","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.ins.2019.05.006","volume":"495","author":"LT Nguyen","year":"2019","unstructured":"Nguyen LT, Vu VV, Lam MT, Duong TT, Manh LT, Nguyen TT, Vo B, Fujita H (2019) An efficient method for mining high utility closed itemsets. Inf Sci 495:78\u201399","journal-title":"Inf Sci"},{"key":"2922_CR40","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.engappai.2015.10.006","volume":"48","author":"E Osaba","year":"2016","unstructured":"Osaba E, Yang XS, Diaz F, Lopez-Garcia P, Carballedo R (2016) An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems. Eng Appl Artif Intell 48:59\u201371","journal-title":"Eng Appl Artif Intell"},{"key":"2922_CR41","unstructured":"Pisharath J, Liu Y, Ozisikyilmaz B, Narayanan R, Liao W, Choudhary A, Memik G (2005) Nu-minebench version 2.0 dataset and technical report. http:\/\/cucis.ece.northwestern.edu\/projects\/DMS\/MineBench.html (last access on 2 March 2015)"},{"issue":"2","key":"2922_CR42","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1007\/s10115-016-0989-x","volume":"51","author":"H Ryang","year":"2017","unstructured":"Ryang H, Yun U (2017) Indexed list-based high utility pattern mining with utility upper-bound reduction and pattern combination techniques. Knowl Inf Syst 51(2):627\u2013659","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"2922_CR43","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/s10489-015-0740-4","volume":"45","author":"J Sahoo","year":"2016","unstructured":"Sahoo J, Das AK, Goswami A (2016) An efficient fast algorithm for discovering closed+ high utility itemsets. Appl Intell 45(1):44\u201374","journal-title":"Appl Intell"},{"key":"2922_CR44","doi-asserted-by":"crossref","unstructured":"Shen YD, Zhang Z, Yang Q (2002) Objective-oriented utility-based association mining. In: 2002 IEEE International conference on data mining, 2002. Proceedings. IEEE, pp 426\u2013433","DOI":"10.1109\/ICDM.2002.1183938"},{"issue":"2","key":"2922_CR45","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/s10115-012-0483-z","volume":"37","author":"BE Shie","year":"2013","unstructured":"Shie BE, Hsiao HF, Tseng VS (2013) Efficient algorithms for discovering high utility user behavior patterns in mobile commerce environments. Knowl Inf Syst 37(2):363\u2013387","journal-title":"Knowl Inf Syst"},{"key":"2922_CR46","doi-asserted-by":"crossref","unstructured":"Shie BE, Hsiao HF, Tseng VS, Philip SY (2011) Mining high utility mobile sequential patterns in mobile commerce environments. In: International conference on database systems for advanced applications. Springer, pp 224\u2013238","DOI":"10.1007\/978-3-642-20149-3_18"},{"key":"2922_CR47","doi-asserted-by":"publisher","first-page":"19568","DOI":"10.1109\/ACCESS.2018.2819162","volume":"6","author":"W Song","year":"2018","unstructured":"Song W, Huang C (2018) Mining high utility itemsets using bio-inspired algorithms: a diverse optimal value framework. IEEE Access 6:19568\u201319582","journal-title":"IEEE Access"},{"issue":"1","key":"2922_CR48","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10489-013-0443-7","volume":"40","author":"W Song","year":"2014","unstructured":"Song W, Liu Y, Li J (2014) Mining high utility itemsets by dynamically pruning the tree structure. Appl Intell 40(1):29\u201343","journal-title":"Appl Intell"},{"key":"2922_CR49","doi-asserted-by":"crossref","unstructured":"Song W, Nan J (2020) Mining high utility itemsets using ant colony optimization. In: The international conference on natural computation, fuzzy systems and knowledge discovery. Springer, pp 98\u2013107","DOI":"10.1007\/978-3-030-70665-4_12"},{"issue":"8","key":"2922_CR50","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, Philip SY (2012) 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"},{"issue":"3","key":"2922_CR51","doi-asserted-by":"publisher","first-page":"726","DOI":"10.1109\/TKDE.2014.2345377","volume":"27","author":"VS Tseng","year":"2014","unstructured":"Tseng VS, Wu CW, Fournier-Viger P, Philip SY (2014) Efficient algorithms for mining the concise and lossless representation of high utility itemsets. IEEE Trans Knowl Data Eng 27(3):726\u2013739","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"2922_CR52","doi-asserted-by":"crossref","unstructured":"Tseng VS, Wu CW, Shie BE, Yu PS (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, pp 253\u2013262","DOI":"10.1145\/1835804.1835839"},{"key":"2922_CR53","doi-asserted-by":"crossref","unstructured":"Wu CW, Fournier-Viger P, Gu JY, Tseng VS (2015) Mining closed+ high utility itemsets without candidate generation. In: 2015 Conference on technologies and applications of artificial intelligence (TAAI). IEEE, pp 187\u2013194","DOI":"10.1109\/TAAI.2015.7407089"},{"key":"2922_CR54","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1016\/j.knosys.2016.10.027","volume":"116","author":"JMT Wu","year":"2017","unstructured":"Wu JMT, Zhan J, Lin JCW (2017) An aco-based approach to mine high-utility itemsets. Knowl-Based Syst 116:102\u2013113","journal-title":"Knowl-Based Syst"},{"issue":"3","key":"2922_CR55","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":"2922_CR56","doi-asserted-by":"crossref","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. SIAM, pp 482\u2013486","DOI":"10.1137\/1.9781611972740.51"},{"key":"2922_CR57","unstructured":"Yao H, Hamilton HJ, Geng L (2006) A unified framework for utility-based measures for mining itemsets. In: Proceedings of ACM SIGKDD 2nd workshop on utility-based data mining. Citeseer, pp 28\u201337"},{"key":"2922_CR58","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1016\/j.ins.2014.01.045","volume":"285","author":"M Zihayat","year":"2014","unstructured":"Zihayat M, An A (2014) Mining top-k high utility patterns over data streams. Inf Sci 285:138\u2013161","journal-title":"Inf Sci"},{"issue":"6","key":"2922_CR59","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1186\/s12918-017-0475-4","volume":"11","author":"M Zihayat","year":"2017","unstructured":"Zihayat M, Davoudi H, An A (2017) Mining significant high utility gene regulation sequential patterns. BMC Syst Biol 11(6):109","journal-title":"BMC Syst Biol"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02922-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-021-02922-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-021-02922-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T09:16:28Z","timestamp":1653902188000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-021-02922-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,8]]},"references-count":59,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,6]]}},"alternative-id":["2922"],"URL":"https:\/\/doi.org\/10.1007\/s10489-021-02922-1","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"value":"0924-669X","type":"print"},{"value":"1573-7497","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,11,8]]},"assertion":[{"value":"8 October 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"8 November 2021","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 declare that they have no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"<!--Emphasis Type='Bold' removed-->Conflict of Interests"}}]}}