A Tight Upper Bound on the Number of Candidate Patterns

Details A Tight Upper Bound on the Number of Candidate Patterns A Tight Upper Bound on the Number of Candidate Patterns

2001-12-07

arxiv.org/abs/cs/0112007v2

Computer Science

Databases

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

A Tight Upper Bound on the Number of Candidate Patterns does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A Tight Upper Bound on the Number of Candidate Patterns, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Tight Upper Bound on the Number of Candidate Patterns will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-325971