{"type":"ScholarlyArticle","title":"A Symbolic Approach to Computing Disjunctive Association Rules from Data","authors":[{"name":"Said Jabbour","slug":"said-jabbour","given":"Said","family":"Jabbour","affiliation":"CRIL , Université d'Artois & CNRS , France"},{"name":"Badran Raddaoui","slug":"badran-raddaoui","given":"Badran","family":"Raddaoui","affiliation":"SAMOVAR , Télécom SudParis , Institut Polytechnique de Paris , France; Institute for Philosophy II , Ruhr University Bochum , Germany"},{"name":"Lakhdar Sais","slug":"lakhdar-sais","given":"Lakhdar","family":"Sais","affiliation":"CRIL , Université d'Artois & CNRS , France"}],"abstract":"Association rule mining is one of the well-studied and most important knowledge discovery task in data mining. In this paper, we first introduce the k-disjunctive support based itemset, a generalization of the traditional model of itemset by allowing the absence of up to k items in each transaction matching the itemset. Then, to discover more expressive rules from data, we define the concept of (k, k′)-disjunctive support based association rules by considering the antecedent and the consequent of the rule as k-disjunctive and k′-disjunctive support based itemsets, respectively. Second, we provide a polynomial-time reduction of both the problems of mining k-disjunctive support based itemsets and (k, k′)-disjunctive support based association rules to the propositional satisfiability model enumeration task. Finally, we show through an extensive campaign of experiments on several popular real-life datasets the efficiency of our proposed approach","doi":"10.24963/ijcai.2023/237","url":"https://ijcai.org/proceedings/2023/237","pdf":"https://ijcai.org/proceedings/2023/0237.pdf","markdown":"https://ijcai.org/proceedings/2023/237.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/237","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Data Mining","track":"Main Track","number":237,"pages":{"first":2133,"last":2141},"keywords":["Data Mining: DM: Frequent pattern mining","Constraint Satisfaction and Optimization: CSO: Modeling","Constraint Satisfaction and Optimization: CSO: Satisfiabilty"],"videos":[],"references":[{"position":1,"raw":"[Aglin et al., 2020] Gaël Aglin, Siegfried Nijssen, and Pierre Schaus. Learning optimal decision trees using caching branch-and-bound search. In AAAI, pages 3146-3153, 2020.","title":"Learning optimal decision trees using caching branch-and-bound search","authors":"Siegfried Gaël Aglin, Pierre Nijssen, Schaus","year":"2020","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Agrawal and Srikant, 1994] Rakesh Agrawal and Ramakr- ishnan Srikant. Fast algorithms for mining association rules in large databases. In VLDB, pages 487-499, 1994.","title":"Rakesh Agrawal and Ramakrishnan Srikant. Fast algorithms for mining association rules in large databases","authors":"Srikant Agrawal","year":"1994","venue":"VLDB","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Alharbi et al., 2014] Manal Alharbi, Priya Periaswamy, and Sanguthevar Rajasekaran. Disjunctive rules mining from uncertain databases. In IEEE Symposium on Computers and Communications, ISCC, pages 1-6, 2014.","title":"Disjunctive rules mining from uncertain databases","authors":"Manal Alharbi, Priya Periaswamy, Sanguthevar Rajasekaran","year":"2014","venue":"IEEE Symposium on Computers and Communications","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Ali et al., 1997] Kamal Ali, Stefanos Manganaris, and Ra- makrishnan Srikant. Partial classification using associa- tion rules. In KDD, pages 115-118, 1997.","title":"Partial classification using association rules","authors":"Kamal Ali, Stefanos Manganaris, Ramakrishnan Srikant","year":"1997","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Bailleux et al., 2006] Olivier Bailleux, Yacine Boufkhad, and Olivier Roussel. A translation of pseudo boolean con- straints to SAT. JSAT, 2(1-4):191-200, 2006.","title":"A translation of pseudo boolean constraints to SAT","authors":"Bailleux","year":"2006","venue":"JSAT","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Balcázar and Garriga, 2007] José L. Balcázar and Gemma C. Garriga. Horn axiomatizations for sequential data. Theoretical Computer Science, 371(3):247-264, 2007.","title":"Horn axiomatizations for sequential data","authors":"L José, Gemma C Balcázar, Garriga","year":"2007","venue":"Theoretical Computer Science","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Belaid et al., 2019a] Mohamed-Bachir Belaid, Christian Bessiere, and Nadjib Lazaar. Constraint programming for association rules. In SDM, pages 127-135, 2019.","title":"Christian Bessiere, and Nadjib Lazaar. Constraint programming for association rules","authors":"Belaid","year":"2019","venue":"SDM","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Belaid et al., 2019b] Mohamed-Bachir Belaid, Christian Bessiere, and Nadjib Lazaar. Constraint programming for mining borders of frequent itemsets. In IJCAI, pages 1064-1070, 2019.","title":"Nadjib Lazaar. Constraint programming for mining borders of frequent itemsets","authors":"Belaid","year":"2019","venue":"IJCAI","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Bienvenu and Bourgaux, 2022] Meghyn Bienvenu and Camille Bourgaux. Querying inconsistent prioritized data with ORBITS: algorithms, implementation, and experiments. In KR, 2022.","title":"Querying inconsistent prioritized data with ORBITS: algorithms, implementation, and experiments","authors":"Bourgaux Bienvenu, Meghyn Bienvenu, Camille Bourgaux","year":"2022","venue":null,"doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Boudane et al., 2018] Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, and Lakhdar Sais. Efficient sat-based encodings of conditional cardinality constraints. In LPAR, pages 181-195, 2018.","title":"Efficient sat-based encodings of conditional cardinality constraints","authors":"Abdelhamid Boudane, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais","year":"2018","venue":"LPAR","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Dixit, 2019] Akhil A. Dixit. CAvSAT: A system for query answering over inconsistent databases. In SIGMOD, pages 1823-1825, 2019.","title":"CAvSAT: A system for query answering over inconsistent databases","authors":"A Akhil, Dixit","year":"2019","venue":"SIGMOD","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Dlala et al., 2018] Imen Ouled Dlala, Saïd Jabbour, Badran Raddaoui, and Lakhdar Sais. A parallel sat-based frame- work for closed frequent itemsets mining. In CP, pages 570-587, 2018. [Eén and Sörensson, 2006] Niklas Eén and Niklas Sörensson. Translating pseudo-boolean constraints into SAT. JSAT, 2(1-4):1-26, 2006. [Eén and Sörensson, 2002] Niklas Eén and Niklas Sörensson. An extensible sat-solver. In SAT, pages 502-518, 2002.","title":"A parallel sat-based framework for closed frequent itemsets mining","authors":"Imen Ouled Dlala, Saïd Jabbour, Badran Raddaoui, Lakhdar Sais, ; Niklas Eén, Niklas Sörensson","year":"2002","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Fournier-Viger et al., 2017] Philippe Fournier-Viger, Jerry Chun-Wei Lin, Bay Vo, Tin Chi Truong, Ji Zhang, and Hoai Bac Le. A survey of itemset mining. Wiley Interdiscip. Rev. Data Min. Knowl. Discov., 7(4), 2017.","title":"A survey of itemset mining","authors":"Fournier-Viger","year":"2017","venue":"Wiley Interdiscip. Rev. Data Min. Knowl. Discov","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gebser et al., 2016] Martin Gebser, Thomas Guyet, Schaub. Knowledge-based sequence mining with ASP. In IJCAI, pages 1497-1504, 2016.","title":"Knowledge-based sequence mining with ASP","authors":"Martin Gebser, Thomas Guyet, Schaub","year":"2016","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2016/215"},{"position":15,"raw":"[Guns et al., 2017] Thias Guns, Anton Dries, Siegfried Ni- jssen, Guido Tack, and Luc De Raedt. Miningzinc: A declarative framework for constraint-based mining. Artif. Intell., 244:6-29, 2017.","title":"Miningzinc: A declarative framework for constraint-based mining","authors":"Thias Guns, Anton Dries, Siegfried Nijssen, Guido Tack, Luc De, Raedt","year":"2017","venue":"Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Hamrouni et al., 2010a] Tarek Hamrouni, Sadok Ben Yahia, and Engelbert Mephu Nguifo. Generalization of association rules through disjunction. Ann. Math. Artif. Intell., 59(2):201-222, 2010.","title":"Generalization of association rules through disjunction","authors":"Hamrouni","year":"2010","venue":"Ann. Math. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Hamrouni et al., 2010b] Tarek Hamrouni, Sadok Ben Yahia, and Engelbert Mephu Nguifo. Optimized mining of a concise representation for frequent patterns based on disjunctions rather than conjunctions. In FLAIRS, 2010.","title":"Optimized mining of a concise representation for frequent patterns based on disjunctions rather than conjunctions","authors":"Hamrouni","year":"2010","venue":"FLAIRS","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Hidouri et al., 2021] Amel Hidouri, Saïd Jabbour, Imen Ouled Dlala, and Badran Raddaoui. On mini- mal and maximal high utility itemsets mining using propositional satisfiability. In IEEE BigData, pages 622-628, 2021.","title":"On minimal and maximal high utility itemsets mining using propositional satisfiability","authors":"Hidouri","year":"2021","venue":"IEEE BigData","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hidouri et al., 2022] Amel Hidouri, Saïd Jabbour, and Bad- ran Raddaoui. On the enumeration of frequent high utility itemsets: A symbolic AI approach. In CP, pages 27:1- 27:17, 2022.","title":"Amel Hidouri, Saïd Jabbour, and Badran Raddaoui. On the enumeration of frequent high utility itemsets: A symbolic AI approach","authors":"Hidouri","year":"2022","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Hilali et al., 2013] Inès Hilali, Tao-Yuan Jen, Dominique Laurent, Claudia Marinica, and Sadok Ben Yahia. Mining interesting disjunctive association rules from unfrequent items. In ISIP, volume 421, pages 84-99, 2013.","title":"Mining interesting disjunctive association rules from unfrequent items","authors":"Inès Hilali, Tao-Yuan Jen, Dominique Laurent, Claudia Marinica, Sadok Ben, Yahia","year":"2013","venue":"ISIP","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Hilali-Jaghdam et al., 2011] Inès Hilali-Jaghdam, Tao- Yuan Jen, Dominique Laurent, and Sadok Ben Yahia. Mining frequent disjunctive selection queries. In DEXA, pages 90-96, 2011.","title":"Mining frequent disjunctive selection queries","authors":"Inès Hilali-Jaghdam, Tao-Yuan Jen, Dominique Laurent, Sadok Ben, Yahia","year":"2011","venue":"DEXA","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Izza et al., 2020] Yacine Izza, Saïd Jabbour, Badran Rad- daoui, and Abdelhamid Boudane. On the enumeration of association rules: A decomposition-based approach. In IJ- CAI, pages 1265-1271, 2020.","title":"On the enumeration of association rules: A decomposition-based approach","authors":"Yacine Izza, Saïd Jabbour, Badran Raddaoui, Abdelhamid Boudane","year":"2020","venue":"IJ-CAI","doi":null,"url":null,"internal_url":"/proceedings/2020/176"},{"position":23,"raw":"[Jabbour et al., 2013] Saïd Jabbour, Lakhdar Sais, and Yak- oub Salhi. Boolean satisfiability for sequence mining. In CIKM, pages 649-658, 2013.","title":"Boolean satisfiability for sequence mining","authors":"Saïd Jabbour, Lakhdar Sais, Yakoub Salhi","year":"2013","venue":"CIKM","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Jabbour et al., 2014] Saïd Jabbour, Lakhdar Saïs, and Yak- oub Salhi. A pigeon-hole based encoding of cardinality constraints. In ISAIM, 2014.","title":"A pigeon-hole based encoding of cardinality constraints","authors":"Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi","year":"2014","venue":"ISAIM","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Jabbour et al., 2016] Saïd Jabbour, Nizar Mhadhbi, Abde- sattar Mhadhbi, Badran Raddaoui, and Lakhdar Sais. Summarizing big graphs by means of pseudo-boolean con- straints. In IEEE International Conference on Big Data, pages 889-894, 2016.","title":"Summarizing big graphs by means of pseudo-boolean constraints","authors":"Saïd Jabbour, Nizar Mhadhbi, Abdesattar Mhadhbi, Badran Raddaoui, Lakhdar Sais","year":"2016","venue":"IEEE International Conference on Big Data","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Jabbour et al., 2017] Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, and Lakhdar Sais. A sat-based framework for overlapping community detection in networks. In PAKDD, pages 786-798, 2017.","title":"A sat-based framework for overlapping community detection in networks","authors":"Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais","year":"2017","venue":"PAKDD","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Jabbour et al., 2018a] Saïd Jabbour, Fatima Ezzahra Mana, Imen Ouled Dlala, Badran Raddaoui, and Lakhdar Sais. On maximal frequent itemsets mining with constraints. In CP, pages 554-569. Springer, 2018.","title":"On maximal frequent itemsets mining with constraints","authors":"Jabbour","year":"2018","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Jabbour et al., 2018b] Saïd Jabbour, Nizar Mhadhbi, Bad- ran Raddaoui, and Lakhdar Sais. Triangle-driven commu- nity detection in large graphs using propositional satisfia- bility. In IEEE AINA, pages 437-444, 2018.","title":"Triangle-driven community detection in large graphs using propositional satisfiability","authors":"Jabbour","year":"2018","venue":"IEEE AINA","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Jabbour et al., 2020] Said Jabbour, Nizar Mhadhbi, Badran Raddaoui, and Lakhdar Sais. SAT-based models for over- lapping community detection in networks. Computing, 102(5):1275-1299, 2020.","title":"SAT-based models for overlapping community detection in networks","authors":"Said Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais","year":"2020","venue":"Computing","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Jabbour et al., 2022] Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, and Lakhdar Sais. A declarative framework for maximal k-plex enumeration problems. In AAMAS, pages 660-668, 2022.","title":"A declarative framework for maximal k-plex enumeration problems","authors":"Saïd Jabbour, Nizar Mhadhbi, Badran Raddaoui, Lakhdar Sais","year":"2022","venue":"AAMAS","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Lazaar et al., 2016] Nadjib Lazaar, Yahia Lebbah, Samir Loudni, Mehdi Maamar, Valentin Lemière, Christian Bessiere, and Patrice Boizumault. A global constraint for closed frequent pattern mining. In CP, pages 333-349, 2016.","title":"A global constraint for closed frequent pattern mining","authors":"Lazaar","year":"2016","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Nanavati et al., 2001] Amit Anil Nanavati, Krishna Prasad Chitrapura, Sachindra Joshi, and Raghu Krishnapuram. Mining generalised disjunctive association rules. In CIKM, pages 482-489. ACM, 2001.","title":"Mining generalised disjunctive association rules","authors":"Anil Amit, Krishna Nanavati, Sachindra Prasad Chitrapura, Raghu Joshi, Krishnapuram","year":"2001","venue":"CIKM","doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Négrevergne and Guns, 2015] Benjamin Négrevergne and Tias Guns. Constraint-based sequence mining using con- straint programming. In CPAIOR, pages 288-305, 2015.","title":"Benjamin Négrevergne and Tias Guns. Constraint-based sequence mining using constraint programming","authors":"Guns Négrevergne","year":"2015","venue":"CPAIOR","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Ordonez et al., 2006] Carlos Ordonez, Norberto F. Ez- querra, and Cesar A. Santana. Constraining and summa- rizing association rules in medical data. Knowl. Inf. Syst., 9(3):1-2, 2006.","title":"Constraining and summarizing association rules in medical data","authors":"Carlos Ordonez, Norberto F Ezquerra, Cesar A Santana","year":"2006","venue":"Knowl. Inf. Syst","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Raedt et al., 2008] Luc De Raedt, Tias Guns, and Siegfried Nijssen. Constraint programming for itemset mining. In KDD, pages 204-212, 2008.","title":"Constraint programming for itemset mining","authors":"Raedt","year":"2008","venue":"KDD","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Rakesh et al., 1993] Agrawal Rakesh, Imieliński Tomasz, and Swami Arun. Mining association rules between sets of items in large databases. In SIGMOD, pages 207-216, 1993.","title":"Mining association rules between sets of items in large databases","authors":"Agrawal Rakesh, Imieliński Tomasz, Swami Arun","year":"1993","venue":"SIGMOD","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Rijnbeek and Kors, 2010] Peter R. Rijnbeek and Jan A. Kors. Finding a short and accurate decision rule in dis- junctive normal form by exhaustive search. Mach. Learn., 80(1):33-62, 2010.","title":"Finding a short and accurate decision rule in disjunctive normal form by exhaustive search","authors":"Peter R Rijnbeek, Jan A Kors","year":"2010","venue":"Mach. Learn","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Sampaio et al., 2008] Marcus C. Sampaio, Fernando H. B. Cardoso, Gilson P. dos Santos Jr., and Lile Hattori. Mining disjunctive association rules. Technical report, Universi- dade Federal de Campina Grande., 2008.","title":"Mining disjunctive association rules","authors":"C Marcus, Sampaio, H B Fernando, Cardoso, P Gilson, Santos Dos, Lile Hattori","year":"2008","venue":null,"doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Sandvig et al., 2007] Jeff J. Sandvig, Bamshad Mobasher, and Robin D. Burke. Robustness of collaborative recom- mendation based on association rule mining. In RecSys, pages 105-112, 2007.","title":"Robustness of collaborative recommendation based on association rule mining","authors":"Jeff J Sandvig, Bamshad Mobasher, Robin D Burke","year":"2007","venue":"RecSys","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Schaus et al., 2017] Pierre Schaus, John O. R. Aoga, and Tias Guns. Coversize: A global constraint for frequency- based itemset mining. In CP, pages 529-546, 2017.","title":"Coversize: A global constraint for frequencybased itemset mining","authors":"Pierre Schaus, O R John, Tias Aoga, Guns","year":"2017","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Sinz, 2005] Carsten Sinz. Towards an optimal CNF encod- ing of boolean cardinality constraints. In CP, pages 827- 831, 2005.","title":"Towards an optimal CNF encoding of boolean cardinality constraints","authors":"Carsten Sinz, Sinz","year":"2005","venue":"CP","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Viveros et al., 1996] Marisa S. Viveros, John P. Nearhos, and Michael J. Rothman. Applying data mining techniques to a health insurance information system. In VLDB, pages 286-294, 1996.","title":"Applying data mining techniques to a health insurance information system","authors":"Marisa S Viveros, John P Nearhos, Michael J Rothman","year":"1996","venue":"VLDB","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}