www.uhasselt.be
DSpace

Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/704

Title: A Tight Upper Bound on the Number of Candidate Patterns
Authors: GEERTS, Floris
GOETHALS, Bart
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.
URI: http://hdl.handle.net/1942/704
ISI #: 000173158200020
ISBN: 0-7695-1119-8
Category: C1
Type: Proceedings Paper
Validation: ecoom, 2003
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A241.33 kBAdobe PDF

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