SCRS Conference Proceedings on Intelligent Systems
CONCISE: An Algorithm for Mining Positive and Negative Non-Redundant Association Rules
Authors: Bemarisika Parfait and Totohasina André
Publishing Date: 21-09-2021
ISBN: 978-93-91842-08-6
Abstract
One challenge problem in association rules mining is the huge size of the extracted rule set many of which are uninteresting and redundant. In this paper, we propose an efficient algorithm CONCISE for generating all non-redundant positive and negative association rules. We introduce GC2M algorithm for enumerating simultaneously all frequent generator itemsets, frequent closed itemsets, frequent maximal itemsets, and infrequent minimal itemsets. We then define four new bases representing non-redundant association rules. We prove that these bases significantly reduce the number of extracted rules. We show the efficiency of our algorithm by computational experiments compared with existing algorithms.
Keywords
Association rules; Interesting rules; Non-Redundant rules
Cite as
Bemarisika Parfait and Totohasina André, "CONCISE: An Algorithm for Mining Positive and Negative Non-Redundant Association Rules", In: Raju Pal and Praveen Kumar Shukla (eds), SCRS Conference Proceedings on Intelligent Systems, SCRS, India, 2021, pp. 13-34. https://doi.org/10.52458/978-93-91842-08-6-2