Title :
A tight upper bound on the number of candidate patterns
Author :
Geerts, Floris ; Goethals, Bart ; Van den Bussche, Jan
Author_Institution :
Limburgs Universitair Centrum, Belgium
Abstract :
In the context of mining for frequent patterns using the standard level-wise algorithm, the following question arises: given the current level and the current set of frequent patterns, what is the maximal number of candidate patterns that can be generated on the next level? We answer this question by providing a tight upper bound, derived from a combinatorial result by J. Kruskal (1963) and G. Katona (1968). Our result is useful for reducing the number of database scans
Keywords :
combinatorial mathematics; data mining; database theory; pattern recognition; combinatorial mathematics; database scans; frequent pattern mining; level-wise algorithm; maximal candidate pattern number; tight upper bound; Costs; Heart; Transaction databases; Upper bound;
Conference_Titel :
Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on
Conference_Location :
San Jose, CA
Print_ISBN :
0-7695-1119-8
DOI :
10.1109/ICDM.2001.989513
