Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

DIS
2007
Springer

favoriteEmaildiscussreport

102views Theoretical Computer Science» more DIS 2007»

On Approximating Minimum Infrequent and Maximum Frequent Sets

13 years 10 months ago

On Approximating Minimum Infrequent and Maximum Frequent Sets

Download www-kd.iai.uni-bonn.de

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 ﬁnding 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

Real-time Traffic

DIS 2007 | Frequent Set | Infrequent Set | Maximum Frequent Set |

claim paper

Related Content

» Approximate mining of frequent patterns on streams

» Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs

» Discriminative Frequent Pattern Analysis for Effective Classification

» Minimum Dominating Set Approximation in Graphs of Bounded Arboricity

» Mixture Models and Frequent Sets Combining Global and Local Methods for 01 Data

» Approximating minimum size weaklyconnected dominating sets for clustering mobile ad hoc ne...

» Distributed Approximation Algorithms for Weighted Problems in MinorClosed Families

» A parallel distributed algorithm for relational frequent pattern discovery from very large...

» A Treebased Approach for Efficiently Mining Approximate Frequent Itemsets

Post Info
More Details (n/a)

Added	07 Jun 2010
Updated	07 Jun 2010
Type	Conference
Year	2007
Where	DIS
Authors	Mario Boley

Comments (0)