Sciweavers

Share
DIS
2007
Springer

On Approximating Minimum Infrequent and Maximum Frequent Sets

12 years 2 months ago
On Approximating Minimum Infrequent and Maximum Frequent Sets
The maximum cardinality of a frequent set as well as the minimum cardinality of an infrequent set are important characteristic numbers in frequent (item) set mining. Gunopulos et al. [10] have shown that finding a maximum frequent set is NP-hard. In this paper I show that the minimization problem is also NP-hard. As a next step I investigate whether these problems can be approximated. While a simple greedy algorithm turns out to approximate a minimum infrequent set within a logarithmic factor one can show that there is no such algorithm for the maximization problem.
Mario Boley
Added 07 Jun 2010
Updated 07 Jun 2010
Type Conference
Year 2007
Where DIS
Authors Mario Boley
Comments (0)
books