A SAT-Based Approach for Mining Association Rules
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence. Pages 2472-2477.
Abstract
Discovering association rules from transaction databases is one of the most studied data mining task. Many effective techniques have been proposed over the years. All these algorithms share the same two steps methodology: frequent itemsets enumeration followed by effective association rules generation step. In this paper, we propose a new propositional satisfiability based approach to mine association rules in a single step. The task is modeled as a Boolean formula whose models correspond to the rules to be mined. To highlight the flexibility of our proposed framework, we also address two other variants, namely the closed and indirect association rules mining tasks. Experiments on many datasets show that on both closed and indirect association rules mining tasks, our declarative approach achieves better performance than the state-of-the-art specialized techniques.
@inproceedings{ijcai2016p352,
title = {A SAT-Based Approach for Mining Association Rules},
author = {Boudane, Abdelhamid and Jabbour, Said and Sais, Lakhdar and Salhi, Yakoub},
booktitle = {Proceedings of the Twenty-Fifth International Joint Conference on
Artificial Intelligence, {IJCAI-16}},
publisher = {AAAI Press / International Joint Conferences on Artificial Intelligence},
editor = {Subbarao Kambhampati},
pages = {2472--2477},
year = {2016},
month = {7},
url = {https://ijcai.org/proceedings/2016/352},
}
TY - CPAPER TI - A SAT-Based Approach for Mining Association Rules AU - Boudane, Abdelhamid AU - Jabbour, Said AU - Sais, Lakhdar AU - Salhi, Yakoub T2 - Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, IJCAI-16 PB - AAAI Press / International Joint Conferences on Artificial Intelligence PY - 2016 SP - 2472 EP - 2477 UR - https://ijcai.org/proceedings/2016/352 ER -Copied
Machine-readable versions of this paper, for tools and AI agents: