Informatics Report Series



Related Pages

Report (by Number) Index
Report (by Date) Index
Author Index
Institute Index

Title:Tight Upper Bounds on the Number of Candidate Patterns
Authors: Floris Geerts ; Bart Goethals ; Jan Van den Bussche
Date:Jun 2005
Publication Title:ACM Transactions on Database Systems (TODS)
Publication Type:Journal Article Publication Status:Published
Volume No:30(2) Page Nos:333-363
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
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 = {},

Home : Publications : Report 

Please mail <> with any changes or corrections.
Unless explicitly stated otherwise, all material is copyright The University of Edinburgh