Searching for "On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets." – 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.

On the Complexity of Generating Maximal Frequent and Minimal Infrequent Sets
by E. Boros, V. Gurvich, L. Khachiyan, K. Makino — 2002
…On the complexity of generating maximal frequent and minimal infrequent sets ⋆ E. Boros 1 , V…
Cited by 31 (9 self) – Add To MetaCart

On maximal frequent and minimal infrequent sets in binary matrices
by E. Boros, V. Gurvich, L. Khachiyan, K. Makino — 2003 — Annals of Mathematics and Artificial Intelligence
… complexity of generating maximal frequent and minimal infrequent sets. 2. Closed Frequent Sets Following [32…
Cited by 4 (0 self) – Add To MetaCart

Showing 1 through 2.

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