Document Server@UHasselt >
Research publications >
Please use this identifier to cite or link to this item:
|Title: ||A Tight Upper Bound on the Number of Candidate Patterns|
|Authors: ||GEERTS, Floris|
VAN DEN BUSSCHE, Jan
|Issue Date: ||2001|
|Publisher: ||IEEE Computer Society|
|Citation: ||Cercone, N. (Ed.) IEEE INTERNATIONAL CONFERENCE ON DATA MINING. PROCEEDINGS. p. 155-162.|
|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 a tight upper bound, derived from a combinatorial result from the sixties by Kruskal and Katona.
Our result is useful to reduce the number of database scans.|
|ISI #: ||000173158200020|
|Type: ||Proceedings Paper|
|Validation: ||ecoom, 2003|
|Appears in Collections: ||Research publications|
Files in This Item:
|N/A||241.33 kB||Adobe PDF|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.