{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,20]],"date-time":"2025-09-20T09:45:53Z","timestamp":1758361553725,"version":"3.44.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T00:00:00Z","timestamp":1743206400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,29]],"date-time":"2025-03-29T00:00:00Z","timestamp":1743206400000},"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":["Appl Intell"],"published-print":{"date-parts":[[2025,5]]},"DOI":"10.1007\/s10489-025-06482-6","type":"journal-article","created":{"date-parts":[[2025,4,8]],"date-time":"2025-04-08T00:06:37Z","timestamp":1744070797000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximizing diversity in k-pattern set mining through constraint programming and entropy"],"prefix":"10.1007","volume":"55","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0770-0636","authenticated-orcid":false,"given":"Mohamed El Amine","family":"Douad","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-0002-0547-784X","authenticated-orcid":false,"given":"Arnold","family":"Hien","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"}]}],"member":"297","published-online":{"date-parts":[[2025,3,29]]},"reference":[{"key":"6482_CR1","doi-asserted-by":"crossref","unstructured":"Amane M, Aissaoui K, Berrada M (2023) Enhancing learning object analysis through fuzzy c-means clustering and web mining methods. Emerg Sci J 7(3)","DOI":"10.28991\/ESJ-2023-07-03-010"},{"key":"6482_CR2","doi-asserted-by":"publisher","unstructured":"Aribi N, Ouali A, Lebbah Y et\u00a0al (2018) Equitable conceptual clustering using OWA operator. In: Phung DQ, Tseng VS, Webb GI et\u00a0al (eds) Advances in knowledge discovery and data mining - 22nd Pacific-Asia conference, PAKDD 2018, Melbourne, VIC, Australia, June 3-6, 2018, Proceedings, Part III, Lecture Notes in Computer Science, vol 10939. Springer, pp 465\u2013477. https:\/\/doi.org\/10.1007\/978-3-319-93040-4_37","DOI":"10.1007\/978-3-319-93040-4_37"},{"key":"6482_CR3","doi-asserted-by":"publisher","unstructured":"Belfodil A, Belfodil A, Bendimerad A et\u00a0al (2019) FSSD - A fast and efficient algorithm for subgroup set discovery. In: Singh L, Veaux RDD, Karypis G et\u00a0al (eds) 2019 IEEE international conference on data science and advanced analytics, DSAA 2019, Washington, DC, USA, October 5-8, 2019. IEEE, pp 91\u201399. https:\/\/doi.org\/10.1109\/DSAA.2019.00023","DOI":"10.1109\/DSAA.2019.00023"},{"issue":"5","key":"6482_CR4","doi-asserted-by":"publisher","first-page":"21","DOI":"10.3390\/A16050218","volume":"16","author":"N Belmecheri","year":"2023","unstructured":"Belmecheri N, Aribi N, Lazaar N et al (2023) Boosting the learning for ranking patterns. Algorithms 16(5):21. https:\/\/doi.org\/10.3390\/A16050218","journal-title":"Algorithms"},{"key":"6482_CR5","doi-asserted-by":"publisher","unstructured":"Bendimerad A, Lijffijt J, Plantevit M et\u00a0al (2020) Gibbs sampling subjectively interesting tiles. In: Berthold MR, Feelders A, Krempl G (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. Springer, pp 80\u201392. https:\/\/doi.org\/10.1007\/978-3-030-44584-3_7","DOI":"10.1007\/978-3-030-44584-3_7"},{"issue":"3","key":"6482_CR6","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1007\/s10618-010-0209-3","volume":"23","author":"TD Bie","year":"2011","unstructured":"Bie TD (2011) Maximum entropy models and subjective interestingness: an application to tiles in binary databases. Data Min Knowl Discov 23(3):407\u201344. https:\/\/doi.org\/10.1007\/s10618-010-0209-3","journal-title":"Data Min Knowl Discov"},{"issue":"3","key":"6482_CR7","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 et al (2018) Anytime discovery of a diverse set of patterns with monte carlo tree search. Data Min Knowl Discov 32(3):604\u201365. https:\/\/doi.org\/10.1007\/s10618-017-0547-5","journal-title":"Data Min Knowl Discov"},{"key":"6482_CR8","doi-asserted-by":"crossref","unstructured":"Chakraborty S, Fremont DJ, Meel KS et\u00a0al (2014) Distribution-aware sampling and weighted model counting for sat. arXiv:1404.2984","DOI":"10.1609\/aaai.v28i1.8990"},{"key":"6482_CR9","volume-title":"Elements of information theory (Wiley Series in Telecommunications and Signal Processing)","author":"TM Cover","year":"2006","unstructured":"Cover TM, Thomas JA (2006) Elements of information theory (Wiley Series in Telecommunications and Signal Processing). Wiley-Interscience, USA"},{"key":"6482_CR10","doi-asserted-by":"crossref","unstructured":"De Raedt L, Zimmermann A (2007) Constraint-based pattern set mining. In: Proceedings of the seventh SIAM international conference on data mining. SIAM, Minneapolis, Minnesota, USA","DOI":"10.1137\/1.9781611972771.22"},{"key":"6482_CR11","doi-asserted-by":"crossref","unstructured":"De\u00a0Raedt L, Guns T, Nijssen S (2008) Constraint programming for itemset mining. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining. ACM, pp 204\u2013212","DOI":"10.1145\/1401890.1401919"},{"issue":"5","key":"6482_CR12","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 LD (2017) Flexible constrained sampling with guarantees for pattern mining. Data Min Knowl Discov 31(5):1266\u2013129. https:\/\/doi.org\/10.1007\/s10618-017-0501-6","journal-title":"Data Min Knowl Discov"},{"key":"6482_CR13","unstructured":"Gong Z, Zhong P, Hu W (2018) Diversity in machine learning. CoRR abs\/1807.01477. http:\/\/arxiv.org\/abs\/1807.01477, arXiv:1807.01477"},{"key":"6482_CR14","doi-asserted-by":"publisher","first-page":"64323","DOI":"10.1109\/ACCESS.2019.2917620","volume":"7","author":"Z Gong","year":"2019","unstructured":"Gong Z, Zhong P, Hu W (2019) Diversity in machine learning. IEEE Access 7:64323\u20136435. https:\/\/doi.org\/10.1109\/ACCESS.2019.2917620","journal-title":"IEEE Access"},{"key":"6482_CR15","doi-asserted-by":"crossref","unstructured":"Haugland V, Kj\u00f8lleberg M, Larsen SE et\u00a0al (2014) A two-armed bandit collective for hierarchical examplar based mining of frequent itemsets with applications to intrusion detection. Trans Comput Collect Intell 14:1\u201319. https:\/\/api.semanticscholar.org\/CorpusID:45799111","DOI":"10.1007\/978-3-662-44509-9_1"},{"key":"6482_CR16","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/978-3-030-67658-2_3","volume-title":"Machine learning and knowledge discovery in databases","author":"A Hien","year":"2021","unstructured":"Hien A, Loudni S, Aribi N et al (2021) A relaxation-based approach for mining diverse closed patterns. In: Hutter F, Kersting K, Lijffijt J et al (eds) Machine learning and knowledge discovery in databases. Springer International Publishing, Cham, pp 36\u201354"},{"issue":"1","key":"6482_CR17","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/S10601-024-09373-8","volume":"29","author":"A Hien","year":"2024","unstructured":"Hien A, Aribi N, Loudni S et al (2024) Mining diverse sets of patterns with constraint programming using the pairwise jaccard similarity relaxation. Constraints An Int J 29(1):80\u201311. https:\/\/doi.org\/10.1007\/S10601-024-09373-8","journal-title":"Constraints An Int J"},{"key":"6482_CR18","doi-asserted-by":"crossref","unstructured":"Khiari M, Boizumault P, Cr\u00e9milleux B (2010) Constraint programming for mining n-ary patterns. In: CP\u201910, LNCS, vol 6308. Springer, pp 552\u2013567","DOI":"10.1007\/978-3-642-15396-9_44"},{"key":"6482_CR19","doi-asserted-by":"publisher","unstructured":"Kim J, Choi I, Li Q (2021) Customer satisfaction of recommender system: examining accuracy and diversity in several types of recommendation approaches. Sustainability 13(11). https:\/\/doi.org\/10.3390\/su13116165, https:\/\/www.mdpi.com\/2071-1050\/13\/11\/6165","DOI":"10.3390\/su13116165"},{"key":"6482_CR20","doi-asserted-by":"publisher","unstructured":"Knobbe AJ, Ho EKY (2006a) Maximally informative k-itemsets and their efficient discovery. In: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining, pp 237\u2013244. https:\/\/doi.org\/10.1145\/1150402.115043","DOI":"10.1145\/1150402.115043"},{"key":"6482_CR21","doi-asserted-by":"crossref","unstructured":"Knobbe AJ, Ho EKY (2006b) Pattern teams. In: European conference on principles of data mining and knowledge discovery, pp 577\u2013584","DOI":"10.1007\/11871637_58"},{"key":"6482_CR22","doi-asserted-by":"publisher","unstructured":"Lazaar N, Lebbah Y, Loudni S et\u00a0al (2016) A global constraint for closed frequent pattern mining. In: Principles and practice of constraint programming - 22nd international conference, CP 2016, Toulouse, France, September 5-9, 2016, Proceedings, pp 333\u2013349. https:\/\/doi.org\/10.1007\/978-3-319-44953-1_22","DOI":"10.1007\/978-3-319-44953-1_22"},{"issue":"2","key":"6482_CR23","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 (2012) Diverse subgroup set discovery. Data Min Knowl Disc 25(2):208\u2013242. https:\/\/doi.org\/10.1007\/s10618-012-0273-y","journal-title":"Data Min Knowl Disc"},{"key":"6482_CR24","doi-asserted-by":"publisher","unstructured":"Pan F, Roberts A, McMillan L et\u00a0al (2007) Sample selection for maximal diversity. In: Seventh IEEE International Conference on Data Mining (ICDM 2007), pp 262\u2013271.https:\/\/doi.org\/10.1109\/ICDM.2007.16","DOI":"10.1109\/ICDM.2007.16"},{"key":"6482_CR25","unstructured":"Prud\u2019homme C, Fages JG, Lorca X (2016) Choco solver documentation"},{"key":"6482_CR26","doi-asserted-by":"publisher","unstructured":"R\u00e9gin JC (2011) Global constraints: a survey. Springer New York, New York, NY, pp 63\u2013134. https:\/\/doi.org\/10.1007\/978-1-4419-1644-0_3","DOI":"10.1007\/978-1-4419-1644-0_3"},{"key":"6482_CR27","volume-title":"Handbook of constraint programming","author":"F Rossi","year":"2006","unstructured":"Rossi F, van Beek P, Walsh T (2006) Handbook of constraint programming, 1st edn. Elsevier","edition":"1"},{"key":"6482_CR28","doi-asserted-by":"crossref","unstructured":"Schaus P, Aoga JOR, Guns T (2017) Coversize: a global constraint for frequency-based itemset mining. In: Principles and practice of constraint programming, pp 529\u2013546","DOI":"10.1007\/978-3-319-66158-2_34"},{"key":"6482_CR29","doi-asserted-by":"publisher","unstructured":"Sullivan D, Smyth B, Wilson D (2004) Preserving recommender accuracy and diversity in sparse datasets. Int J Artif Intell Tools 13(01):219\u2013235. https:\/\/doi.org\/10.1142\/S0218213004001491","DOI":"10.1142\/S0218213004001491"},{"key":"6482_CR30","doi-asserted-by":"publisher","unstructured":"Vernerey C, Loudni S, Aribi N et\u00a0al (2022) Threshold-free pattern mining meets multi-objective optimization: Application to asso ciation rules. In: Raedt LD (ed) Proceedings of the thirty-first international joint conference on artificial intelligence, IJCAI-22. International Joint Conferences on Artificial Intelligence Organization, pp 1880\u20131886. https:\/\/doi.org\/10.24963\/ijcai.2022\/261, main Track","DOI":"10.24963\/ijcai.2022\/261"},{"issue":"1","key":"6482_CR31","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 Min Knowl Discov 23(1):169\u201321. https:\/\/doi.org\/10.1007\/s10618-010-0202-x","journal-title":"Data Min Knowl Discov"},{"key":"6482_CR32","unstructured":"Zaki MJ, Parthasarathy S, Ogihara M et\u00a0al (1997) New algorithms for fast discovery of association rules. In: Heckerman D, Mannila H, Pregibon D (eds) Proceedings of the third international conference on knowledge discovery and data mining (KDD-97), Newport Beach, California, USA, August 14-17, 1997. AAAI Press, pp 283\u2013286. http:\/\/www.aaai.org\/Library\/KDD\/1997\/kdd97-060.php"},{"issue":"11","key":"6482_CR33","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0206458","volume":"13","author":"C Zhang","year":"2018","unstructured":"Zhang C, Liu J, Qu Y et al (2018) Enhancing the robustness of recommender systems against spammers. PLoS ONE 13(11):e0206458. https:\/\/doi.org\/10.1371\/journal.pone.0206458","journal-title":"PLoS ONE"},{"key":"6482_CR34","doi-asserted-by":"crossref","unstructured":"Zhu N (2023) Research on customer relationship segmentation of apparel retail industry through data mining. Ital Publication 4(2)","DOI":"10.28991\/HIJ-2023-04-02-05"}],"container-title":["Applied Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06482-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10489-025-06482-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10489-025-06482-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T19:32:59Z","timestamp":1758310379000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10489-025-06482-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,29]]},"references-count":34,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2025,5]]}},"alternative-id":["6482"],"URL":"https:\/\/doi.org\/10.1007\/s10489-025-06482-6","relation":{},"ISSN":["0924-669X","1573-7497"],"issn-type":[{"type":"print","value":"0924-669X"},{"type":"electronic","value":"1573-7497"}],"subject":[],"published":{"date-parts":[[2025,3,29]]},"assertion":[{"value":"16 March 2025","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 March 2025","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"To ensure objectivity and transparency in the research and to confirm that accepted principles of ethical and professional conduct were followed, the authors certify the following statements:","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"This research did not involve human participants or animals and, therefore, did not require approval from an ethics committee.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"All authors listed on the title page have contributed to this work, have read the manuscript, attest to the validity and legitimacy of the data and its interpretation, and agree to its submission to the Journal of Applied Intelligence.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}},{"value":"All authors declare no conflict of interest and approve the submission of the manuscript. We affirm that the article is our original work, has not been previously published, and is not under consideration for publication elsewhere.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Potential Conflicts of Interest"}}],"article-number":"597"}}