A Tight Upper Bound on the Number of Candidate Patterns

Simple item page
dc.creatorGeerts, Floris
dc.creatorGoethals, Bart
dc.creatorBussche, Jan Van den
dc.date2001-12-07
dc.date2002-11-30
dc.date.accessioned2026-07-25T23:59:47Z
dc.descriptionIn 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.
dc.identifierhttps://arxiv.org/abs/cs/0112007
dc.identifierhttp://arxiv.org/abs/cs/0112007
dc.identifier.urihttps://dspace.dare.co.zw/handle/123456789/103253
dc.subjectDatabases
dc.subjectArtificial Intelligence
dc.subjectH.2.8
dc.titleA Tight Upper Bound on the Number of Candidate Patterns
dc.typetext

Files

Collections

Artificial intelligence