{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T03:11:07Z","timestamp":1774321867265,"version":"3.50.1"},"reference-count":42,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,6,1]],"date-time":"2024-06-01T00:00:00Z","timestamp":1717200000000},"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":["Constraints"],"published-print":{"date-parts":[[2024,6]]},"DOI":"10.1007\/s10601-024-09373-8","type":"journal-article","created":{"date-parts":[[2024,10,2]],"date-time":"2024-10-02T05:01:39Z","timestamp":1727845299000},"page":"80-111","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Mining diverse sets of patterns with constraint programming using the pairwise Jaccard similarity relaxation"],"prefix":"10.1007","volume":"29","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0547-784X","authenticated-orcid":false,"given":"Arnold","family":"Hien","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3204-6065","authenticated-orcid":false,"given":"Noureddine","family":"Aribi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6245-7661","authenticated-orcid":false,"given":"Samir","family":"Loudni","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4736-2976","authenticated-orcid":false,"given":"Yahia","family":"Lebbah","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0855-0181","authenticated-orcid":false,"given":"Abdelkader","family":"Ouali","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8319-7456","authenticated-orcid":false,"given":"Albrecht","family":"Zimmermann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,2]]},"reference":[{"key":"9373_CR1","unstructured":"Agrawal, R., & Srikant, R. (1994), Fast algorithms for mining association rules in large databases. In Proceedings of the 20th VLDB (pp. 487\u2013499). San Francisco, CA, USA."},{"key":"9373_CR2","doi-asserted-by":"publisher","unstructured":"Belaid, M., Bessiere, C., & Lazaar, N. (2019). Constraint programming for association rules. In T. Y. Berger-Wolf, & N. V. Chawla (Eds.) Proceedings of the 2019 SIAM International Conference on Data Mining, SDM 2019, Calgary, Alberta, Canada, May 2-4, 2019 (pp. 127\u2013135). SIAM. https:\/\/doi.org\/10.1137\/1.9781611975673.15","DOI":"10.1137\/1.9781611975673.15"},{"key":"9373_CR3","doi-asserted-by":"publisher","unstructured":"Belaid, M., Bessiere, C., & Lazaar, N. (2019). Constraint programming for mining borders of frequent itemsets. In S. Kraus (Ed.) Proceedings of the twenty-eighth international joint conference on artificial intelligence, IJCAI 2019, Macao, China, August 10-16, 2019. (pp. 1064\u20131070). https:\/\/doi.org\/10.24963\/ijcai.2019\/149","DOI":"10.24963\/ijcai.2019\/149"},{"key":"9373_CR4","doi-asserted-by":"publisher","unstructured":"Belfodil, A., Belfodil, A., Bendimerad, A., Lamarre, P., Robardet, C., Kaytoue, M., & Plantevit, M. (2019). FSSD - A fast and efficient algorithm for subgroup set discovery. In L. Singh, R. D. D. Veaux, & G. Karypis et al. (Eds.) 2019 IEEE International Conference on Data Science and Advanced Analytics, DSAA 2019, Washington, DC, USA, October 5-8, 2019 (pp. 91\u201399). IEEE. https:\/\/doi.org\/10.1109\/DSAA.2019.00023","DOI":"10.1109\/DSAA.2019.00023"},{"key":"9373_CR5","doi-asserted-by":"publisher","unstructured":"Bendimerad, A., Lijffijt, J., Plantevit, M., Robardet, C., & De Bie, T. (2020). Gibbs sampling subjectively interesting tiles. In: M. R. Berthold, A. Feelders, & G. Krempl (Eds.) Advances in intelligent data analysis XVIII - 18th International Symposium on Intelligent Data Analysis, IDA 2020, Konstanz, Germany, April 27-29, 2020, Proceedings, Lecture Notes in Computer Science, vol 12080 (pp. 80\u201392). Springer. https:\/\/doi.org\/10.1007\/978-3-030-44584-3_7","DOI":"10.1007\/978-3-030-44584-3_7"},{"issue":"3","key":"9373_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"TD Bie","year":"2011","unstructured":"Bie, T. D. (2011). Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Mining and Knowledge Discovery, 23(3), 407\u2013446. https:\/\/doi.org\/10.1007\/s10618-010-0209-3","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9373_CR7","doi-asserted-by":"publisher","unstructured":"Boley, M., Moens, S., & G\u00e4rtner, T. (2012). Linear space direct pattern sampling using coupling from the past. In Q. Yang, D. Agarwal, & J. Pei (Eds.) The 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, KDD \u201912, Beijing, China, August 12-16, 2012 (pp. 69\u201377). ACM. https:\/\/doi.org\/10.1145\/2339530.2339545","DOI":"10.1145\/2339530.2339545"},{"key":"9373_CR8","doi-asserted-by":"publisher","unstructured":"Boley, M., Mampaey, M., Kang, B., Tokmakov, P., & Wrobel, S. (2013). One click mining: interactive local pattern discovery through implicit preference and performance learning. In D. H. Chau, J. Vreeken, & M. van Leeuwen, et al. (Eds.) Proceedings of the ACM SIGKDD Workshop on Interactive Data Exploration and Analytics, IDEA@KDD 2013, Chicago, Illinois, USA, August 11, 2013 (pp. 27\u201335). ACM. https:\/\/doi.org\/10.1145\/2501511.2501517","DOI":"10.1145\/2501511.2501517"},{"issue":"6","key":"9373_CR9","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1002\/widm.1074","volume":"2","author":"C Borgelt","year":"2012","unstructured":"Borgelt, C. (2012). Frequent item set mining. WIREs Data Mining and Knowledge Discovery, 2(6), 437\u2013456. https:\/\/doi.org\/10.1002\/widm.1074","journal-title":"WIREs Data Mining and Knowledge Discovery"},{"issue":"3","key":"9373_CR10","doi-asserted-by":"publisher","first-page":"604","DOI":"10.1007\/s10618-017-0547-5","volume":"32","author":"G Bosc","year":"2018","unstructured":"Bosc, G., Boulicaut, J., Ra\u00efssi, C., & Kaytoue, M. (2018). Anytime discovery of a diverse set of patterns with monte carlo tree search. Data Mining and Knowledge Discovery, 32(3), 604\u2013650. https:\/\/doi.org\/10.1007\/s10618-017-0547-5","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9373_CR11","doi-asserted-by":"publisher","unstructured":"Bringmann, B., & Zimmermann, A. (2007). The chosen few: On identifying valuable patterns. In: Proceedings of the 7th IEEE International Conference on Data Mining (ICDM 2007), October 28-31, 2007, Omaha, Nebraska, USA (pp. 63\u201372). IEEE Computer Society. https:\/\/doi.org\/10.1109\/ICDM.2007.85","DOI":"10.1109\/ICDM.2007.85"},{"issue":"1","key":"9373_CR12","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10115-008-0136-4","volume":"18","author":"B Bringmann","year":"2009","unstructured":"Bringmann, B., & Zimmermann, A. (2009). One in a million: picking the right patterns. Knowledge and Information Systems, 18(1), 61\u201381. https:\/\/doi.org\/10.1007\/s10115-008-0136-4","journal-title":"Knowledge and Information Systems"},{"key":"9373_CR13","doi-asserted-by":"publisher","unstructured":"Dzyuba, V., & van Leeuwen, M. (2013). Interactive discovery of interesting subgroup sets. In A. Tucker, F. H\u00f6ppner, & A. Siebes, et al. (Eds.) Advances in Intelligent Data Analysis XII - 12th International Symposium, IDA 2013, London, UK, October 17-19, 2013 (pp. 150\u2013161). Proceedings, Lecture Notes in Computer Science, vol 8207, Springer. https:\/\/doi.org\/10.1007\/978-3-642-41398-8_14","DOI":"10.1007\/978-3-642-41398-8_14"},{"issue":"5","key":"9373_CR14","doi-asserted-by":"publisher","first-page":"1266","DOI":"10.1007\/s10618-017-0501-6","volume":"31","author":"V Dzyuba","year":"2017","unstructured":"Dzyuba, V., van Leeuwen, M., & Raedt, L. D. (2017). Flexible constrained sampling with guarantees for pattern mining. Data Mining and Knowledge Discovery, 31(5), 1266\u20131293. https:\/\/doi.org\/10.1007\/s10618-017-0501-6","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9373_CR15","doi-asserted-by":"publisher","unstructured":"Gallo, A., Miettinen, P., & Mannila, H. (2008). Finding subgroups having several descriptions: Algorithms for redescription mining. In: Proceedings of the SIAM International Conference on Data Mining, SDM 2008, April 24-26, 2008, Atlanta, Georgia, USA (pp. 334\u2013345). SIAM. https:\/\/doi.org\/10.1137\/1.9781611972788.30","DOI":"10.1137\/1.9781611972788.30"},{"key":"9373_CR16","doi-asserted-by":"publisher","unstructured":"Hien, A., Loudni, S., Aribi, N., Lebbah, Y., Laghzaoui, M. E. A., Ouali, A., & Zimmermann, A. (2020). A relaxation-based approach for mining diverse closed patterns. In F. Hutter, K. Kersting, & J. Lijffijt et al. (Eds.) Machine Learning and Knowledge Discovery in Databases - European Conference, ECML PKDD 2020, Ghent, Belgium, September 14-18, 2020, Proceedings, Part I, Lecture Notes in Computer Science, vol 12457 (pp. 36\u201354). Springer. https:\/\/doi.org\/10.1007\/978-3-030-67658-2_3","DOI":"10.1007\/978-3-030-67658-2_3"},{"key":"9373_CR17","doi-asserted-by":"crossref","unstructured":"Hoeve, W., Katriel, I. (2006). Global constraints. In Handbook of Constraint Programming (pp. 169\u2013208). Elsevier Science Inc.","DOI":"10.1016\/S1574-6526(06)80010-6"},{"key":"9373_CR18","doi-asserted-by":"publisher","unstructured":"Ke, Y., Cheng, J., Yu, J. X. (2009). Top-k correlative graph mining. In: SDM. SIAM (pp. 1038\u20131049). https:\/\/doi.org\/10.1137\/1.9781611972795","DOI":"10.1137\/1.9781611972795"},{"key":"9373_CR19","doi-asserted-by":"publisher","unstructured":"Khiari, M., Boizumault, P., & Cr\u00e9milleux, B. (2010). Constraint programming for mining n-ary patterns. In: D. Cohen (Ed.) Principles and Practice of Constraint Programming - CP 2010 - 16th International Conference, CP 2010, St. Andrews, Scotland, UK, September 6-10, 2010 (pp. 552\u2013567). Proceedings, Lecture Notes in Computer Science, vol 6308. Springer. https:\/\/doi.org\/10.1007\/978-3-642-15396-9_44","DOI":"10.1007\/978-3-642-15396-9_44"},{"key":"9373_CR20","doi-asserted-by":"crossref","unstructured":"Kifer, D., Gehrke, J., Bucila, C., & White, W. (2006). How to quickly find a witness. In Constraint-Based Mining and Inductive Databases (pp. 216\u2013242). Berlin Heidelberg: Springer.","DOI":"10.1007\/11615576_11"},{"key":"9373_CR21","doi-asserted-by":"publisher","unstructured":"Knobbe, A. J., & Ho, E. K. Y. (2006). Pattern teams. In: J. F\u00fcrnkranz, T. Scheffer, & M. Spiliopoulou (Eds.) Knowledge Discovery in Databases: PKDD 2006, 10th European Conference on Principles and Practice of Knowledge Discovery in Databases, Berlin, Germany, September 18-22, 2006, Proceedings, Lecture Notes in Computer Science, vol 4213 (pp. 577\u2013584). Springer. https:\/\/doi.org\/10.1007\/11871637_58","DOI":"10.1007\/11871637_58"},{"key":"9373_CR22","doi-asserted-by":"publisher","unstructured":"Lazaar, N., Lebbah, Y., Loudni, S., Maamar, M., Lemi\u00e8re, V., Bessiere, C., & Boizumault, P. (2016). A global constraint for closed frequent pattern mining. In M. Rueher (Ed) Principles and Practice of Constraint Programming - 22nd International Conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings, Lecture Notes in Computer Science, vol 9892 (pp. 333\u2013349). Springer. https:\/\/doi.org\/10.1007\/978-3-319-44953-1_22","DOI":"10.1007\/978-3-319-44953-1_22"},{"key":"9373_CR23","doi-asserted-by":"publisher","unstructured":"van Leeuwen, M. (2014). Interactive data exploration using pattern mining. Lecture Notes in Computer Science, vol 8401, (pp. 169\u2013182). Springer. https:\/\/doi.org\/10.1007\/978-3-662-43968-5_9","DOI":"10.1007\/978-3-662-43968-5_9"},{"issue":"2","key":"9373_CR24","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/s10618-012-0273-y","volume":"25","author":"M van Leeuwen","year":"2012","unstructured":"van Leeuwen, M., & Knobbe, A. J. (2012). Diverse subgroup set discovery. Data Mining and Knowledge Discovery, 25(2), 208\u2013242. https:\/\/doi.org\/10.1007\/s10618-012-0273-y","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9373_CR25","unstructured":"Makhalova, T., Kuznetsov, S.O., & Napoli, A. (2019). On on entropy in pattern mining. In SFC 2019 - XXVIe Rencontres de la Soci\u00e9t\u00e9 Francophone de Classification, Sep 2019, Nancy, France. hal-02193296. https:\/\/hal.archives-ouvertes.fr\/hal-02193296"},{"key":"9373_CR26","doi-asserted-by":"publisher","unstructured":"Meeng, M., Duivesteijn, W., & Knobbe, A. J. (2014). Rocsearch - an roc-guided search strategy for subgroup discovery. In M. J. Zaki, Z. Obradovic, & P. Tan, et al. (Eds.) Proceedings of the 2014 SIAM International Conference on Data Mining, Philadelphia, Pennsylvania, USA, April 24-26, 2014 (pp. 704\u2013712). SIAM. https:\/\/doi.org\/10.1137\/1.9781611973440.81","DOI":"10.1137\/1.9781611973440.81"},{"issue":"2","key":"9373_CR27","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1016\/0004-3702(82)90040-6","volume":"18","author":"TM Mitchell","year":"1982","unstructured":"Mitchell, T. M. (1982). Generalization as search. Artificial Intelligence, 18(2), 203\u2013226. https:\/\/doi.org\/10.1016\/0004-3702(82)90040-6","journal-title":"Artificial Intelligence"},{"key":"9373_CR28","doi-asserted-by":"crossref","unstructured":"Ng, R. T., Lakshmanan, L. V. S., & Han, J., et al. (1998). Exploratory mining and pruning optimizations of constrained association rules. In Proceedings of ACM SIGMOD (pp. 13\u201324).","DOI":"10.1145\/276304.276307"},{"key":"9373_CR29","doi-asserted-by":"publisher","unstructured":"Nijssen, S., & Zimmermann, A. (2014). Constraint-based pattern mining. In C. C. Aggarwal, & J. Han (Eds.) Frequent Pattern Mining (pp. 147\u2013163). Springer. https:\/\/doi.org\/10.1007\/978-3-319-07821-2_7","DOI":"10.1007\/978-3-319-07821-2_7"},{"key":"9373_CR30","doi-asserted-by":"crossref","unstructured":"Pasquier, N., Bastide, Y., Taouil, R., & Lakhal, L. (1999). Discovering frequent closed itemsets for association rules. In Proceedings of the 7th ICDT, (pp. 398\u2013416).","DOI":"10.1007\/3-540-49257-7_25"},{"key":"9373_CR31","doi-asserted-by":"publisher","unstructured":"Pei, J., Han, J., Lakshmanan, L. V. S. (2001). Mining frequent item sets with convertible constraints. In D. Georgakopoulos, & A. Buchmann (Eds.) Proceedings of the 17th International Conference on Data Engineering, April 2-6, 2001, Heidelberg, Germany (pp. 433\u2013442). IEEE Computer Society.https:\/\/doi.org\/10.1109\/ICDE.2001.914856","DOI":"10.1109\/ICDE.2001.914856"},{"key":"9373_CR32","unstructured":"Prud\u2019homme, C., Fages, J. G., & Lorca, X. (2016). Choco Solver Documentation."},{"key":"9373_CR33","doi-asserted-by":"crossref","unstructured":"Puolam\u00e4ki, K., Kang, B., Lijffijt, J., & De Bie, T. (2016). Interactive visual data exploration with subjective feedback. In Proceedings of ECML PKDD (pp. 214\u2013229). Springer","DOI":"10.1007\/978-3-319-46227-1_14"},{"key":"9373_CR34","doi-asserted-by":"publisher","unstructured":"Raedt, L. D., Guns, T., & Nijssen, S. (2008). Constraint programming for itemset mining. In Y. Li, B. Liu, & S. Sarawagi (Eds.) Proceedings of the 14th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Las Vegas, Nevada, USA, August 24-27, 2008 (pp. 204\u2013212). ACM. https:\/\/doi.org\/10.1145\/1401890.1401919","DOI":"10.1145\/1401890.1401919"},{"key":"9373_CR35","doi-asserted-by":"publisher","unstructured":"Rojas, W. U., Boizumault, P., Loudni, S., Cr\u00e9milleux, B., & Lepailleur, A. (2014) Mining (soft-) skypatterns using dynamic CSP. In H. Simonis (Ed.) Integration of AI and OR Techniques in Constraint Programming - 11th International Conference, CPAIOR 2014, Cork, Ireland, May 19-23, 2014. (pp. 71\u201387). Proceedings, Lecture Notes in Computer Science, vol 8451. Springer. https:\/\/doi.org\/10.1007\/978-3-319-07046-9_6","DOI":"10.1007\/978-3-319-07046-9_6"},{"key":"9373_CR36","doi-asserted-by":"publisher","unstructured":"Schaus, P., Aoga, J. O. R., & Guns, T. (2017). Coversize: A global constraint for frequency-based itemset mining. In J. C. Beck (Ed.) Principles and Practice of Constraint Programming - 23rd International Conference, CP 2017, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, Lecture Notes in Computer Science, vol 10416 (pp. 529\u2013546). Springer. https:\/\/doi.org\/10.1007\/978-3-319-66158-2_34","DOI":"10.1007\/978-3-319-66158-2_34"},{"issue":"2","key":"9373_CR37","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s10844-013-0281-4","volume":"44","author":"W Ugarte","year":"2015","unstructured":"Ugarte, W., Boizumault, P., Loudni, S., Cr\u00e9milleux, B., & Lepailleur, A. (2015). Soft constraints for pattern mining. Journal of Intelligent Information System, 44(2), 193\u2013221. https:\/\/doi.org\/10.1007\/s10844-013-0281-4","journal-title":"Journal of Intelligent Information System"},{"key":"9373_CR38","doi-asserted-by":"crossref","unstructured":"Vijayakumar, A. K., Cogswell, M., Selvaraju, R. R., Sun, Q., Lee, S., Crandall, D., & Batra, D. (2018). Diverse beam search for improved description of complex scenes. In S. A. McIlraith & K. Q. Weinberger (eds) Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, (AAAI-18), the 30th innovative Applications of Artificial Intelligence (IAAI-18), and the 8th AAAI Symposium on Educational Advances in Artificial Intelligence (EAAI-18), New Orleans, Louisiana, USA, February 2-7, 2018 (pp. 7371\u20137379). AAAI Press. https:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI18\/paper\/view\/17329","DOI":"10.1609\/aaai.v32i1.12340"},{"issue":"1","key":"9373_CR39","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/s10618-010-0202-x","volume":"23","author":"J Vreeken","year":"2011","unstructured":"Vreeken, J., van Leeuwen, M., & Siebes, A. (2011). Krimp: mining itemsets that compress. Data Mining and Knowledge Discovery, 23(1), 169\u2013214. https:\/\/doi.org\/10.1007\/s10618-010-0202-x","journal-title":"Data Mining and Knowledge Discovery"},{"key":"9373_CR40","doi-asserted-by":"publisher","unstructured":"Wang, J., Han, J., & Pei, J. (2003). CLOSET+: searching for the best strategies for mining frequent closed itemsets. In L. Getoor, T. E. Senator, & P. M. Domingos et al. (eds) Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, August 24 - 27, 2003 (pp. 236\u2013245). ACM. https:\/\/doi.org\/10.1145\/956750.956779","DOI":"10.1145\/956750.956779"},{"issue":"5","key":"9373_CR41","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J Wang","year":"2005","unstructured":"Wang, J., Han, J., Lu, Y., & Tzvetkov, P. (2005). TFP: an efficient algorithm for mining top-k frequent closed itemsets. IEEE Transactions on Knowledge and Data Engineering, 17(5), 652\u2013664.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"9373_CR42","unstructured":"Zaki, M. J., Parthasarathy, S., Ogihara, M., & Li, W. (1997). New algorithms for fast discovery of association rules. In D. Heckerman, H. Mannila, & D. Pregibon (eds) Proceedings of the Third International Conference on Knowledge Discovery and Data Mining (KDD-97), Newport Beach, California, USA, August 14-17, 1997 (pp. 283\u2013286) . AAAI Press. http:\/\/www.aaai.org\/Library\/KDD\/1997\/kdd97-060.php"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-024-09373-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10601-024-09373-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-024-09373-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,4]],"date-time":"2024-11-04T11:10:15Z","timestamp":1730718615000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10601-024-09373-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6]]},"references-count":42,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2024,6]]}},"alternative-id":["9373"],"URL":"https:\/\/doi.org\/10.1007\/s10601-024-09373-8","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,6]]},"assertion":[{"value":"11 September 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 October 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"To ensure objectivity and transparency in research and to ensure that accepted principles of ethical and professional conduct have been followed, the authors certify the following statements:  All authors have no conflict of interest to declare and approve the manuscript being submitted. We warrant that the article is the Authors\u2019 original work. We warrant that the article has not received prior publication and is not under consideration for publication elsewhere. On behalf of all co-authors, the corresponding author shall bear full responsibility for the submission.  All authors did not receive support from any organization for the submitted work. The authors have no relevant financial or non-financial interests to disclose.  All authors listed on the title page have contributed significantly to the work, have read the manuscript, attest to the validity and legitimacy of the data and its interpretation, and agree to its submission to the Constraints Journal.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}}]}}