{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T04:58:11Z","timestamp":1780981091116,"version":"3.54.1"},"reference-count":43,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:00:00Z","timestamp":1785542400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T00:00:00Z","timestamp":1779235200000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001665","name":"French National Research Agency","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1016\/j.artint.2026.104561","type":"journal-article","created":{"date-parts":[[2026,5,20]],"date-time":"2026-05-20T06:36:39Z","timestamp":1779258999000},"page":"104561","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Innovative constraint models for mining frequent and rare association rules using multi-objective optimization"],"prefix":"10.1016","volume":"357","author":[{"given":"Charles","family":"Vernerey","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6245-7661","authenticated-orcid":false,"given":"Samir","family":"Loudni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3204-6065","authenticated-orcid":false,"given":"Noureddine","family":"Aribi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4736-2976","authenticated-orcid":false,"given":"Yahia","family":"Lebbah","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.artint.2026.104561_bib0001","series-title":"Proceedings of the 20th VLDB","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","author":"Agrawal","year":"1994"},{"issue":"5","key":"10.1016\/j.artint.2026.104561_bib0002","doi-asserted-by":"crossref","first-page":"652","DOI":"10.1109\/TKDE.2005.81","article-title":"TFP: an efficient algorithm for mining top-K frequent closed itemsets","volume":"17","author":"Wang","year":"2005","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"10.1016\/j.artint.2026.104561_bib0003","series-title":"Multiple Criteria Decision Analysis: State of the Art Surveys","author":"Figueira","year":"2005"},{"issue":"1\u20133","key":"10.1016\/j.artint.2026.104561_bib0004","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/j.ins.2003.03.021","article-title":"Multi-objective rule mining using genetic algorithms","volume":"36","author":"Ghosh","year":"2004","journal-title":"Inf. Sci."},{"key":"10.1016\/j.artint.2026.104561_bib0005","series-title":"ECML PKDD 2013","first-page":"272","article-title":"Discovering skylines of subgroup sets","author":"van Leeuwen","year":"2013"},{"key":"10.1016\/j.artint.2026.104561_bib0006","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/j.artint.2015.04.003","article-title":"Skypattern mining: from pattern condensed representations to dynamic constraint satisfaction problems","volume":"244","author":"Ugarte","year":"2017","journal-title":"Artif. Intell."},{"issue":"12","key":"10.1016\/j.artint.2026.104561_bib0007","doi-asserted-by":"crossref","first-page":"1951","DOI":"10.1016\/j.artint.2011.05.002","article-title":"Itemset mining: a constraint programming perspective","volume":"175","author":"Guns","year":"2011","journal-title":"Artif. Intell."},{"issue":"2","key":"10.1016\/j.artint.2026.104561_bib0008","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/s10601-016-9252-z","article-title":"Prefix-projection global constraint and top-k approach for sequential pattern mining","volume":"22","author":"Kemmar","year":"2017","journal-title":"Constraints An Int. J."},{"key":"10.1016\/j.artint.2026.104561_bib0009","series-title":"Proceedings of the 7th ICDT","first-page":"398","article-title":"Discovering frequent closed itemsets for association rules","author":"Pasquier","year":"1999"},{"key":"10.1016\/j.artint.2026.104561_bib0010","series-title":"Proceedings of IJCAI-22","first-page":"1880","article-title":"Threshold-free pattern mining meets multi-objective optimization: application to association rules","author":"Vernerey","year":"2022"},{"issue":"1","key":"10.1016\/j.artint.2026.104561_bib0011","first-page":"57","article-title":"Alternative interest measures for mining associations in databases","volume":"15","author":"Omiecinski","year":"2003","journal-title":"IEEE TKDE"},{"issue":"1","key":"10.1016\/j.artint.2026.104561_bib0012","doi-asserted-by":"crossref","first-page":"94","DOI":"10.1007\/s10618-008-0111-4","article-title":"Adequate condensed representations of patterns","volume":"17","author":"Soulet","year":"2008","journal-title":"Data Min. Knowl. Discov."},{"key":"10.1016\/j.artint.2026.104561_bib0013","series-title":"Computational Logic \u2013 CL 2000","first-page":"972","article-title":"Mining minimal non-redundant association rules using frequent closed itemsets","author":"Bastide","year":"2000"},{"issue":"3","key":"10.1016\/j.artint.2026.104561_bib0014","first-page":"219","article-title":"Generating rare association rules using the minimal rare itemsets family","volume":"4","author":"Szathmary","year":"2010","journal-title":"Int. J. Softw. Informatics"},{"key":"10.1016\/j.artint.2026.104561_bib0015","series-title":"Handbook of Constraint Programming","first-page":"169","article-title":"Global constraints","author":"Hoeve","year":"2006"},{"issue":"1","key":"10.1016\/j.artint.2026.104561_bib0016","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0004-3702(78)90029-2","article-title":"A language and a program for stating and solving combinatorial problems","volume":"10","author":"Lauri\u00e8re","year":"1978","journal-title":"Artif. Intell."},{"key":"10.1016\/j.artint.2026.104561_bib0017","series-title":"Proceedings of AAAI 96","first-page":"209","article-title":"Generalized arc consistency for global cardinality constraint","author":"R\u00e9gin","year":"1996"},{"issue":"12","key":"10.1016\/j.artint.2026.104561_bib0018","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1016\/0895-7177(94)90127-9","article-title":"Introducing global constraints in CHIP","volume":"20","author":"Beldiceanu","year":"1994","journal-title":"J. Math. Comput. Model."},{"key":"10.1016\/j.artint.2026.104561_bib0019","series-title":"Proceedings of the ICDM 2011","first-page":"655","article-title":"Mining dominant patterns in the sky","author":"Soulet","year":"2011"},{"key":"10.1016\/j.artint.2026.104561_bib0020","series-title":"Proceedings of the 2019 SIAM International Conference on Data Mining (SDM)","first-page":"127","article-title":"Constraint programming for association rules","author":"Belaid","year":"2019"},{"key":"10.1016\/j.artint.2026.104561_bib0021","series-title":"Proceedings of ECML PKDD 2020","first-page":"36","article-title":"A relaxation-based approach for mining diverse closed patterns","volume":"12457","author":"Hien","year":"2020"},{"key":"10.1016\/j.artint.2026.104561_bib0022","series-title":"Proceedings of the 23rd CP 2017","first-page":"529","article-title":"CoverSize: a global constraint for frequency-based itemset mining","author":"Schaus","year":"2017"},{"key":"10.1016\/j.artint.2026.104561_bib0023","series-title":"Proceedings of CP 2013","article-title":"Multi-objective large neighborhood search","author":"Schaus","year":"2013"},{"issue":"1","key":"10.1016\/j.artint.2026.104561_bib0024","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1145\/1007730.1007734","article-title":"Mining with rarity: a unifying framework","volume":"6","author":"Weiss","year":"2004","journal-title":"SIGKDD Explor."},{"key":"10.1016\/j.artint.2026.104561_bib0025","series-title":"Proc. of IJCAI","first-page":"607","article-title":"Limited discrepancy search","author":"Harvey","year":"1995"},{"key":"10.1016\/j.artint.2026.104561_bib0026","series-title":"Proc. of IJCAI","first-page":"617","article-title":"Limited discrepancy AND\/OR search and its application to optimization tasks in graphical models","author":"Larrosa","year":"2016"},{"key":"10.1016\/j.artint.2026.104561_bib0027","series-title":"Proceedings of the 13th ICDM","first-page":"557","article-title":"Dominance programming for itemset mining","author":"N\u00e9grevergne","year":"2013"},{"key":"10.1016\/j.artint.2026.104561_bib0028","series-title":"Proc. of ICTAI 2016, San Jose, CA, USA, November 6\u20138, 2016","first-page":"962","article-title":"Itemset mining with penalties","author":"Jabbour","year":"2016"},{"key":"10.1016\/j.artint.2026.104561_bib0029","series-title":"Proc. of CLA \u201908","first-page":"47","article-title":"An efficient hybrid algorithm for mining frequent closures and generators","author":"Szathmary","year":"2008"},{"key":"10.1016\/j.artint.2026.104561_bib0030","series-title":"Proc. of IJCAI 2020","first-page":"1265","article-title":"On the enumeration of association rules: a decomposition-based approach","author":"Izza","year":"2020"},{"key":"10.1016\/j.artint.2026.104561_bib0031","series-title":"Proc. of ICTAI 2007","first-page":"305","article-title":"Towards rare itemset mining","author":"Szathmary","year":"2007"},{"key":"10.1016\/j.artint.2026.104561_bib0032","series-title":"Proc. of PAKDD 2005","first-page":"97","article-title":"Finding sporadic rules using apriori-inverse","volume":"3518","author":"Koh","year":"2005"},{"key":"10.1016\/j.artint.2026.104561_bib0033","first-page":"157","article-title":"Finding interesting rare association rules using rare pattern tree","volume":"8","author":"Tsang","year":"2013","journal-title":"Trans. Large Scale Data Knowl. Centered Syst."},{"key":"10.1016\/j.artint.2026.104561_bib0034","series-title":"Proceedings of CIDM 2009","first-page":"340","article-title":"An improved multiple minimum support based approach to mine rare association rules","author":"Kiran","year":"2009"},{"key":"10.1016\/j.artint.2026.104561_bib0035","series-title":"Proc. of DASFAA 2010","first-page":"49","article-title":"Mining rare association rules in the datasets with widely varying items\u2019 frequencies","volume":"5981","author":"Kiran","year":"2010"},{"key":"10.1016\/j.artint.2026.104561_bib0036","series-title":"Proc. of BNCOD 27","first-page":"84","article-title":"An efficient approach to mine rare association rules using maximum items\u2019 support constraints","volume":"6121","author":"Kiran","year":"2010"},{"issue":"1-2","key":"10.1016\/j.artint.2026.104561_bib0037","doi-asserted-by":"crossref","first-page":"44","DOI":"10.1016\/j.ijar.2004.11.006","article-title":"Mining association rules with multiple minimum supports using maximum constraints","volume":"40","author":"Lee","year":"2005","journal-title":"Int. J. Approx. Reason."},{"issue":"78","key":"10.1016\/j.artint.2026.104561_bib0038","doi-asserted-by":"crossref","first-page":"4708","DOI":"10.21105\/joss.04708","article-title":"Choco-solver: A Java library for constraint programming","volume":"7","author":"Prud\u2019homme","year":"2022","journal-title":"J. Open Source Softw."},{"issue":"89","key":"10.1016\/j.artint.2026.104561_bib0039","doi-asserted-by":"crossref","first-page":"5654","DOI":"10.21105\/joss.05654","article-title":"A java library for itemset mining with choco-solver","volume":"8","author":"Vernerey","year":"2023","journal-title":"J. Open Source Softw."},{"key":"10.1016\/j.artint.2026.104561_bib0040","unstructured":"C. Vernerey, S. Loudni, Y. Lebbah, N. Aribi, Code and supplementary material, 2022, (https:\/\/gitlab.com\/chaver\/choco-mining). Accessed: 2025-12-05."},{"issue":"22","key":"10.1016\/j.artint.2026.104561_bib0041","doi-asserted-by":"crossref","first-page":"2643","DOI":"10.1093\/bioinformatics\/btn490","article-title":"GenMiner: mining non-redundant association rules from integrated gene expression data and annotations","volume":"24","author":"Martinez","year":"2008","journal-title":"Bioinformatics"},{"key":"10.1016\/j.artint.2026.104561_bib0042","series-title":"Proc. of BIBM 2007","first-page":"15","article-title":"GenMiner: mining informative association rules from genomic data","author":"Martinez","year":"2007"},{"key":"10.1016\/j.artint.2026.104561_bib0043","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1186\/1471-2105-7-54","article-title":"Integrated analysis of gene expression by association rules discovery","volume":"7","author":"Carmona-Saez","year":"2006","journal-title":"BMC Bioinform."}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370226000871?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370226000871?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T04:06:31Z","timestamp":1780977991000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370226000871"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,8]]},"references-count":43,"alternative-id":["S0004370226000871"],"URL":"https:\/\/doi.org\/10.1016\/j.artint.2026.104561","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[2026,8]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Innovative constraint models for mining frequent and rare association rules using multi-objective optimization","name":"articletitle","label":"Article Title"},{"value":"Artificial Intelligence","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.artint.2026.104561","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 The Authors. Published by Elsevier B.V.","name":"copyright","label":"Copyright"}],"article-number":"104561"}}