Searching for "A Tight Upper Bound on the Number of Candidate Patterns" – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

A Tight Upper Bound on the Number of Candidate Patterns
by Floris Geerts, Bart Goethals, Jan Van Den Bussche, Limburgs Universitair Centrum, Contact Bart Goethals — 2001
…A tight upper bound on the number of candidate patterns Floris Geerts, Bart Goethals, Jan Van den…
Cited by 4 (1 self) – Add To MetaCart

Feasible Itemset Distributions in Data Mining:
by Theory And Application, Ganesh Ramesh
… addressed. In a seminal work on applying bounds, Goethals et. al. [8] gave a tight upper bound on the number…
Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB