We analyze algorithms that, under the right circumstances, permit efficient mining for frequent itemsets in data with tall peaks (large frequent itemsets). We develop a family of level-by-level peak-jumping algorithms, and study them using a simple probability model. The analysis clarifies why the jumping idea sometimes works well, and which properties the data needs to have for this to be the case. The link with Max-Miner arises in a natural way and the analysis makes clear the role and importance of each major idea used in this algorithm. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Dexters, N., Purdom, P. W., & Van Gucht, D. (2006). Peak-jumping frequent itemset mining algorithms. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4213 LNAI, pp. 487–494). Springer Verlag. https://doi.org/10.1007/11871637_47
Mendeley helps you to discover research relevant for your work.