Enumerating Non-redundant Association Rules Using Satisfiability-Reference-Cited by-同舟云学术

Enumerating Non-redundant Association Rules Using Satisfiability

Published:2017 Issue: Volume: Page:824-836
ISSN:0302-9743
Container-title:Advances in Knowledge Discovery and Data Mining
language:
Short-container-title:

Author:

Boudane Abdelhamid,Jabbour Said,Sais Lakhdar,Salhi Yakoub

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-57454-7_64

Reference18 articles.

1. Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of SIGMOD 1993, pp. 207–216 (1993)

2. Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence);Y Bastide,2000

3. Boudane, A., Jabbour, S., Sais, L., Salhi, Y.: A sat-based approach for mining association rules. In: Proceedings of IJCAI 2016, pp. 2472–2478 (2016)

4. Fournier-Viger, P., Gomaric, A., Gueniche, T., Soltani, A., Wu, C.-W., Tseng, V.S.: SPMF: a java open-source pattern mining library. J. Mach. Learn. Res. 15(1), 3389–3393 (2014)

5. Fournier-Viger, P., Tseng, V.S.: TNS: mining top-k non-redundant sequential rules. In: Proceedings of SAC 2013, pp 164–166 (2013)

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A Machine Learning Method to Reveal Closed Sets of Common Features of Objects Using Constraint Programming;Automation and Remote Control;2022-12

2. Frequent Pattern Discovery as Table Constraint Satisfaction Problem;Proceedings of the Sixth International Scientific Conference “Intelligent Information Technologies for Industry” (IITI’22);2022-10-31

3. Mining Closed High Utility Itemsets based on Propositional Satisfiability;Data & Knowledge Engineering;2021-11

4. STAR;ACM/IMS Transactions on Data Science;2021-01-22

5. An efficient method for pruning redundant negative and positive association rules;Neurocomputing;2020-06