Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/957
Title: Tight upper bounds on the number of candidate patterns
Authors: GEERTS, Floris 
GOETHALS, Bart 
VAN DEN BUSSCHE, Jan 
Issue Date: 2005
Publisher: ACM
Source: ACM Transactions on Database Systems (TODS), 30(2). p. 333-363
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.
Document URI: http://hdl.handle.net/1942/957
Link to publication: http://doi.acm.org/10.1145/1071610.1071611
ISSN: 0362-5915
e-ISSN: 1557-4644
ISI #: 000230623300001
Category: A1
Type: Journal Contribution
Validations: ecoom 2006
Appears in Collections:Research publications

Show full item record

WEB OF SCIENCETM
Citations

13
checked on May 14, 2022

Page view(s)

42
checked on May 16, 2022

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.