{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T13:54:25Z","timestamp":1784555665830,"version":"3.55.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T00:00:00Z","timestamp":1728432000000},"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":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-024-03303-4","type":"journal-article","created":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T15:16:59Z","timestamp":1728487019000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the Discovery of Frequent Gradual Patterns: A Symbolic AI-Based Framework"],"prefix":"10.1007","volume":"5","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3278-9969","authenticated-orcid":false,"given":"Jerry","family":"Lonlac","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Imen","family":"Ouled Dlala","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sa\u00efd","family":"Jabbour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Engelbert","family":"Mephu Nguifo","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Badran","family":"Raddaoui","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Lakhdar","family":"Sa\u00efs","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,10,9]]},"reference":[{"issue":"2","key":"3303_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/235968.233311","volume":"25","author":"S Ramakrishnan","year":"1996","unstructured":"Ramakrishnan S, Rakesh A. Mining quantitative association rules in large relational tables. SIGMOD Rec. 1996;25(2):1\u201312.","journal-title":"SIGMOD Rec."},{"key":"3303_CR2","doi-asserted-by":"crossref","unstructured":"Aumann Y, Lindell Y. A statistical theory for quantitative association rules. In: SIGKDD; 1999. pp. 261\u2013270.","DOI":"10.1145\/312129.312243"},{"key":"3303_CR3","unstructured":"Salleb-Aouissi A, Vrain C, Nortet C. Quantminer: a genetic algorithm for mining quantitative association rules. In: IJCAI; 2007. pp. 1035\u20131040."},{"key":"3303_CR4","doi-asserted-by":"crossref","unstructured":"Jabbour S, Raddaoui B, Sais L. A symbolic approach to computing disjunctive association rules from data. In: IJCAI; 2023. pp. 2133\u20132141.","DOI":"10.24963\/ijcai.2023\/237"},{"key":"3303_CR5","doi-asserted-by":"crossref","unstructured":"Hidouri A, Raddaoui B, Jabbour S. Targeting minimal rare itemsets from transaction databases. In: IJCAI; 2023. pp. 2114\u20132121.","DOI":"10.24963\/ijcai.2023\/235"},{"key":"3303_CR6","doi-asserted-by":"crossref","unstructured":"Kaytoue M, Kuznetsov SO, Napoli A. Revisiting numerical pattern mining with formal concept analysis. In: IJCAI; 2011. pp. 1342\u20131347.","DOI":"10.1007\/978-3-642-20514-9_12"},{"key":"3303_CR7","doi-asserted-by":"crossref","unstructured":"Calders T, Goethals B, Jaroszewicz S. Mining rank-correlated sets of numerical attributes. In: KDD; 2006. pp. 96\u2013105.","DOI":"10.1145\/1150402.1150417"},{"key":"3303_CR8","doi-asserted-by":"crossref","unstructured":"Di-Jorio L, Laurent A, Teisseire M. Mining frequent gradual itemsets from large databases. In: IDA; 2009. pp. 297\u2013308.","DOI":"10.1007\/978-3-642-03915-7_26"},{"issue":"3","key":"3303_CR9","first-page":"593","volume":"28","author":"B N\u00e9grevergne","year":"2014","unstructured":"N\u00e9grevergne B, Termier A, Rousset M, M\u00e9haut J. Para miner: a generic pattern mining algorithm for multi-core architectures. DMKD. 2014;28(3):593\u2013633.","journal-title":"DMKD"},{"issue":"5","key":"3303_CR10","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1080\/03081079.2022.2162049","volume":"52","author":"MC Boujike","year":"2023","unstructured":"Boujike MC, Lonlac J, Tsopz\u00e9 N, Nguifo EM, Fotso LP. GRAPGT: gradual patterns with gradualness threshold. Int J Gen Syst. 2023;52(5):525\u201345.","journal-title":"Int J Gen Syst"},{"key":"3303_CR11","doi-asserted-by":"crossref","unstructured":"Ngo T, Georgescu V, Laurent A, Libourel T, Mercier G. Mining spatial gradual patterns: application to measurement of potentially avoidable hospitalizations. In: SOFSEM; 2018. pp. 596\u2013608,","DOI":"10.1007\/978-3-319-73117-9_42"},{"key":"3303_CR12","doi-asserted-by":"crossref","unstructured":"Aryadinata YS, Lin Y, Barcellos C, Laurent A, Libourel T. Mining epidemiological dengue fever data from Brazil: a gradual pattern based geographical information system. In: IMPU; 2014. pp. 414\u2013423.","DOI":"10.1007\/978-3-319-08855-6_42"},{"key":"3303_CR13","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/j.egypro.2017.12.658","volume":"143","author":"C Fan","year":"2017","unstructured":"Fan C, Xiao F. Mining gradual patterns in big building operational data for building energy efficiency enhancement. Energy Procedia. 2017;143:119\u201324 (Leveraging Energy Technologies and Policy Options for Low Carbon Cities).","journal-title":"Energy Procedia"},{"key":"3303_CR14","doi-asserted-by":"crossref","unstructured":"H\u00fcllermeier E. Association rules for expressing gradual dependencies. In: Principles of data mining and knowledge discovery, 6th European Conference, PKDD; 2002. pp. 200\u2013211.","DOI":"10.1007\/3-540-45681-3_17"},{"issue":"5","key":"3303_CR15","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1142\/S021848850700487X","volume":"15","author":"F Berzal","year":"2007","unstructured":"Berzal F, Cubero JC, S\u00e1nchez D, Miranda MAV, Serrano J. An alternative approach to discover gradual dependencies. Int J Uncertain Fuzziness Knowl-Based Syst. 2007;15(5):559\u201370.","journal-title":"Int J Uncertain Fuzziness Knowl-Based Syst"},{"key":"3303_CR16","unstructured":"Masseglia F, Laurent A, Teisseire M. Gradual trends in fuzzy sequential patterns. In: In IPMU; 2008. pp. 456\u2013463."},{"key":"3303_CR17","doi-asserted-by":"crossref","unstructured":"Laurent A, N\u00e9grevergne B, Sicard N, Termier A. Pgp-mc: towards a multicore parallel approach for mining gradual patterns. In: DASFAA, Part I; 2010. pp. 78\u201384.","DOI":"10.1007\/978-3-642-12026-8_8"},{"key":"3303_CR18","doi-asserted-by":"crossref","unstructured":"Oudni A, Lesot M, Rifqi M. Processing contradiction in gradual itemset extraction. In: FUZZ-IEEE; 2013. pp. 1\u20138.","DOI":"10.1109\/FUZZ-IEEE.2013.6622516"},{"issue":"3","key":"3303_CR19","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10115-014-0749-8","volume":"43","author":"TDT Do","year":"2015","unstructured":"Do TDT, Termier A, Laurent A, N\u00e9grevergne B, Tehrani BO, Amer-Yahia S. PGLCM: efficient parallel mining of closed frequent gradual itemsets. Knowl Inf Syst. 2015;43(3):497\u2013527.","journal-title":"Knowl Inf Syst"},{"key":"3303_CR20","doi-asserted-by":"crossref","unstructured":"Lonlac J, Miras Y, Beauger A, Mazenod V, Peiry J-L, Mephu E. An approach for extracting frequent (closed) gradual patterns under temporal constraint. In: FUZZ-IEEE; 2018. pp. 878\u2013885.","DOI":"10.1109\/FUZZ-IEEE.2018.8491665"},{"key":"3303_CR21","doi-asserted-by":"crossref","unstructured":"Jabbour S, Lonlac J, Sa\u00efs L. Mining gradual itemsets using sequential pattern mining. In: FUZZ-IEEE; 2019. pp. 1\u20136.","DOI":"10.1109\/FUZZ-IEEE.2019.8858864"},{"key":"3303_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.swevo.2022.101205","volume":"75","author":"DO Owuor","year":"2022","unstructured":"Owuor DO, Runkler TA, Laurent A. A metaheuristic approach for mining gradual patterns. Swarm Evol Comput. 2022;75: 101205.","journal-title":"Swarm Evol Comput"},{"key":"3303_CR23","doi-asserted-by":"crossref","unstructured":"Ayouni S, Laurent A, Yahia SB, Poncelet P. Mining closed gradual patterns. In: ICAISC, Part I; 2010. pp. 267\u2013274.","DOI":"10.1007\/978-3-642-13208-7_34"},{"key":"3303_CR24","doi-asserted-by":"crossref","unstructured":"Jabbour S, Sais L, Salhi Y. The top-k frequent closed itemset mining using top-k SAT problem. In: ECML PKDD; 2013. pp. 403\u2013418.","DOI":"10.1007\/978-3-642-40994-3_26"},{"key":"3303_CR25","doi-asserted-by":"crossref","unstructured":"Dlala IO, Jabbour S, Raddaoui B, Sais L. A parallel sat-based framework for closed frequent itemsets mining. In: CP; 2018. pp. 570\u2013587.","DOI":"10.1007\/978-3-319-98334-9_37"},{"key":"3303_CR26","doi-asserted-by":"crossref","unstructured":"Jabbour S, Mana FE, Dlala IO, Raddaoui B, Sais L. On maximal frequent itemsets mining with constraints. In: CP; 2018. pp. 554\u2013569.","DOI":"10.1007\/978-3-319-98334-9_36"},{"key":"3303_CR27","doi-asserted-by":"crossref","unstructured":"Laurent A, Lesot M, Rifqi M. GRAANK: exploiting rank correlations for extracting gradual itemsets. In: Flexible query answering systems, 8th international conference, FQAS; 2009. pp. 382\u2013393.","DOI":"10.1007\/978-3-642-04957-6_33"},{"key":"3303_CR28","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1214\/aoms\/1177732186","volume":"10","author":"M Kendall","year":"1939","unstructured":"Kendall M, Smith B. The problem of m rankings. Ann Math Stat. 1939;10:275\u201387.","journal-title":"Ann Math Stat"},{"key":"3303_CR29","doi-asserted-by":"crossref","unstructured":"Jabbour S, Lonlac J, Sais L, Salhi Y. Extending modern SAT solvers for models enumeration. In: Proceedings of the 15th IEEE international conference on information reuse and integration, IRI; 2014. pp. 803\u2013810.","DOI":"10.1109\/IRI.2014.7051971"},{"key":"3303_CR30","doi-asserted-by":"crossref","unstructured":"Tseitin GS. On the complexity of derivations in the propositional calculus. In: Slesenko HAO, editors. Structures in constructives mathematics and mathematical logic, Part II; 1968. pp. 115\u2013125.","DOI":"10.1007\/978-1-4899-5327-8_25"},{"key":"3303_CR31","doi-asserted-by":"crossref","unstructured":"Lonlac J, Doniec A, Lujak M, Lecoeuche S. Mining frequent seasonal gradual patterns. In: Big data analytics and knowledge discovery\u201422nd international conference, DaWaK, vol. 12393; 2020. pp. 197\u2013207.","DOI":"10.1007\/978-3-030-59065-9_16"},{"issue":"1\/2","key":"3303_CR32","doi-asserted-by":"publisher","first-page":"81","DOI":"10.2307\/2332226","volume":"30","author":"MG Kendall","year":"1938","unstructured":"Kendall MG. A new measure of rank correlation. Biometrika. 1938;30(1\/2):81\u201393.","journal-title":"Biometrika"},{"key":"3303_CR33","doi-asserted-by":"crossref","unstructured":"Hidouri A, Jabbour S, Lonlac J, Raddaoui B. A constraint-based approach for enumerating gradual itemsets. In: IEEE ICTAI; 2021. pp. 582\u2013589.","DOI":"10.1109\/ICTAI52525.2021.00093"},{"key":"3303_CR34","unstructured":"Rosen KH. Discrete mathematics and its applications; 2011."},{"key":"3303_CR35","doi-asserted-by":"crossref","unstructured":"Sinz C. Towards an optimal cnf encoding of Boolean cardinality constraints. In: 11th International conference on principles and practice of constraint programming\u2014CP 2005; 2005. pp. 827\u2013831.","DOI":"10.1007\/11564751_73"},{"key":"3303_CR36","unstructured":"Jabbour S, Sa\u00efs L, Salhi Y. A pigeon-hole based encoding of cardinality constraints. In: International symposium on artificial intelligence and mathematics, ISAIM 2014."},{"key":"3303_CR37","doi-asserted-by":"crossref","unstructured":"Boudane A, Jabbour S, Raddaoui B, Sais L. Efficient sat-based encodings of conditional cardinality constraints. In: International conference on logic for programming, artificial intelligence and reasoning; 2018. pp. 181\u2013195.","DOI":"10.29007\/kfjb"},{"key":"3303_CR38","doi-asserted-by":"crossref","unstructured":"Bailleux O, Boufkhad Y. Efficient CNF encoding of Boolean cardinality constraints. In: CP; 2003. pp. 108\u2013122.","DOI":"10.1007\/978-3-540-45193-8_8"},{"key":"3303_CR39","doi-asserted-by":"crossref","unstructured":"Sinz C. Towards an optimal CNF encoding of Boolean cardinality constraints. In: CP; 2005. pp. 827\u2013831.","DOI":"10.1007\/11564751_73"},{"issue":"1\u20134","key":"3303_CR40","first-page":"1","volume":"2","author":"N E\u00e9n","year":"2006","unstructured":"E\u00e9n N, S\u00f6rensson N. Translating pseudo-Boolean constraints into SAT. JSAT. 2006;2(1\u20134):1\u201326.","journal-title":"JSAT"},{"issue":"1\u20134","key":"3303_CR41","first-page":"191","volume":"2","author":"O Bailleux","year":"2006","unstructured":"Bailleux O, Boufkhad Y, Roussel O. A translation of pseudo Boolean constraints to SAT. JSAT. 2006;2(1\u20134):191\u2013200.","journal-title":"JSAT"},{"key":"3303_CR42","unstructured":"Crawford J, Ginsberg ML, Luck E, Roy A. Symmetry-breaking predicates for search problems. In: Principles of knowledge representation and reasoning (KR); 1996. pp. 148\u2013159."},{"key":"3303_CR43","doi-asserted-by":"crossref","unstructured":"Moskewicz MW, Madigan CF, Zhao Y, Zhang L, Malik S. Chaff: engineering an efficient SAT solver. In: Proceedings of the 38th design automation conference (DAC); 2001. pp. 530\u2013535.","DOI":"10.1145\/378239.379017"},{"key":"3303_CR44","first-page":"502","volume":"03","author":"N En","year":"2003","unstructured":"En N, S\u00f6rensson N. An extensible SAT-solver. Sat. 2003;03:502\u201318.","journal-title":"Sat"},{"issue":"7","key":"3303_CR45","doi-asserted-by":"publisher","first-page":"394","DOI":"10.1145\/368273.368557","volume":"5","author":"M Davis","year":"1962","unstructured":"Davis M, Logemann G, Loveland DW. A machine program for theorem-proving. Commun ACM. 1962;5(7):394\u20137.","journal-title":"Commun ACM"},{"key":"3303_CR46","unstructured":"Jabbour S, Lonlac J, Sais L, Salhi Y. Revisiting the learned clauses database reduction strategies. 2014. CoRR arXiv:1402.1956"},{"key":"3303_CR47","unstructured":"Zhang L, Madigan CF, Moskewicz MW, Malik S. Efficient conflict driven learning in Boolean satisfiability solver. In: IEEE\/ACM CAD; 2001. pp. 279\u2013285."},{"key":"3303_CR48","unstructured":"Huang J. The effect of restarts on the efficiency of clause learning, pp. 2318\u20132323"},{"key":"3303_CR49","unstructured":"Audemard G, Simon L. Predicting learnt clauses quality in modern sat solvers. In: Proceedings of the 21st international joint conference on artificial intelligence, IJCAI; 2009. pp. 399\u2013404."},{"key":"3303_CR50","first-page":"502","volume":"03","author":"N E\u00e9n","year":"2003","unstructured":"E\u00e9n N, S\u00f6rensson N. An extensible sat-solver. Sat. 2003;03:502\u201318.","journal-title":"Sat"},{"issue":"8","key":"3303_CR51","doi-asserted-by":"publisher","first-page":"1850033","DOI":"10.1142\/S0218213018500331","volume":"27","author":"S Jabbour","year":"2018","unstructured":"Jabbour S, Lonlac J, Sa\u00efs L, Salhi Y. Revisiting the learned clauses database reduction strategies. Int J Artif Intell Tools. 2018;27(8):1850033\u20131185003319.","journal-title":"Int J Artif Intell Tools"},{"issue":"1","key":"3303_CR52","doi-asserted-by":"publisher","first-page":"2350003","DOI":"10.1142\/S0218213023500033","volume":"32","author":"J Lonlac","year":"2023","unstructured":"Lonlac J, Nguifo EM. Top-k learned clauses for modern SAT solvers. Int J Artif Intell Tools. 2023;32(1):2350003\u20131235000341.","journal-title":"Int J Artif Intell Tools"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03303-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-024-03303-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-024-03303-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,9]],"date-time":"2024-10-09T15:17:53Z","timestamp":1728487073000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-024-03303-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,9]]},"references-count":52,"journal-issue":{"issue":"7","published-online":{"date-parts":[[2024,10]]}},"alternative-id":["3303"],"URL":"https:\/\/doi.org\/10.1007\/s42979-024-03303-4","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,10,9]]},"assertion":[{"value":"24 November 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 September 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 October 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors assert that they have no known Conflict of interest or personal relationships that could have appeared to influence the work reported in this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research involving human and\/or animals"}},{"value":"Informed consent was obtained from all individual authors included in the paper.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}],"article-number":"944"}}