Free-Sets: A Condensed Representation of Boolean Data for the Approximation of Frequency Queries

323 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Optimal constraint-based decision tree induction from itemset lattices (2010, background): “Well-known exact condensed representations are the closed itemsets (Pasquier et al. 1999) and free itemsets (Boulicaut et al. 2000).”
Association mining (2006, background): “…Counting Inference MinEx Boulicant et al. 2001 A priori d-free sets HLinEx Bykowski & Rigotti 2001 A priori Disjunction free sets VLinEx Bykowski & Rigotti 2001 Depth Project Disjunction free sets CHARM Zaki & Hsiao 2002 Eclat Closed Set NDI Calders & Goethals 2002 Apriori…”
Mining optimal decision trees from itemset lattices (2007, background): “Algorithmically, the tree-relevancy constraint is closely related to the condensed representation of δ-free itemsets [5].”
Survey on Frequent Pattern Mining (2003, background): “transaction database such that, if necessary, the support of a frequent itemset not in that representation can be efficiently computed or estimated without accessing the database [24, 31, 12, 14, 15].”
Constraint-based Data Mining (2005, methodology): “Interestingly, an algorithm like AcMiner (Boulicaut et al ., 2000; Boulicaut et al ., 2003) which can compute frequent closed sets (closeness is not an anti-monotonic constraint) via the frequent free sets exploits these pruning possibilities.”