- Abstract:
-
In the context of mining for frequent patterns using the standard levelwise 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 tight upper bounds, derived from a combinatorial result from the sixties by Kruskal and Katona. Our result is useful to secure existing algorithms from a combinatorial explosion of the number of candidate patterns.
- Links To Paper
- 1st Link
- Bibtex format
- @Article{EDI-INF-RR-0805,
- author = {
Floris Geerts
and Bart Goethals
and Jan Van den Bussche
},
- title = {Tight Upper Bounds on the Number of Candidate Patterns},
- journal = {ACM Transactions on Database Systems (TODS)},
- publisher = {ACM},
- year = 2005,
- month = {Jun},
- volume = {30(2)},
- pages = {333-363},
- doi = {10.1145/1071610.1071611},
- url = {http://doi.acm.org/10.1145/1071610.1071611},
- }
|
