A Recursive Algorithm for Mining Association Rules
From MaRDI portal
Publication:132441
DOI10.48550/ARXIV.2011.14195arXiv2011.14195MaRDI QIDQ132441
Louis Raimbault, Mariane Pelletier, Abdelkader Mokkadem
Publication date: 28 November 2020
Abstract: Mining frequent itemsets and association rules is an essential task within data mining and data analysis. In this paper, we introduce PrefRec, a recursive algorithm for finding frequent itemsets and association rules. Its main advantage is its recursiveness with respect to the items. It is particularly efficient for updating the mining process when new items are added to the database or when some are excluded. We present in a complete way the logic of the algorithm, and give some of its applications. After that, we carry out an experimental study on the effectiveness of PrefRec. We first compare the execution times with some very popular frequent itemset mining algorithms. Then, we do experiments to test the updating capabilities of our algorithm.
Related Items (1)
This page was built for publication: A Recursive Algorithm for Mining Association Rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q132441)
