Sciweavers

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

95

Voted

ICDT
1999
ACM

93views Database» more ICDT 1999»

Discovering Frequent Closed Itemsets for Association Rules

15 years 7 months ago

Discovering Frequent Closed Itemsets for Association Rules

Download www.dmi.unict.it

Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotf

Real-time Traffic

Database | ICDT 1999 |

claim paper

Related Content

» CFIStream mining closed frequent itemsets in data streams

» A new method for finding generalized frequent itemsets in generalized association rule min...

» Fast Frequent Itemset Mining using Compressed Data Representation

» Mining Closed Itemsets in Data Stream Using Formal Concept Analysis

» Generalized Closed Itemsets for Association Rule Mining

» Direct Candidates Generation A Novel Algorithm for Discovering Complete ShareFrequent Item...

» Generating nonredundant association rules

» Efficient Frequent Itemsets Mining by Sampling

» Further Pruning for Efficient Association Rule Discovery

Post Info
More Details (n/a)

Added	04 Aug 2010
Updated	04 Aug 2010
Type	Conference
Year	1999
Where	ICDT
Authors	Nicolas Pasquier, Yves Bastide, Rafik Taouil, Lotfi Lakhal

Comments (0)