Sciweavers

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

129

DMKD
2004
ACM

139views Data Mining» more DMKD 2004»

COFI approach for mining frequent itemsets revisited

15 years 8 months ago

COFI approach for mining frequent itemsets revisited

Download webdocs.cs.ualberta.ca

Mohammad El-Hajj, Osmar R. Zaïane

Real-time Traffic

Data Mining | DMKD 2004 |

claim paper

Related Content

» COFItree Mining A New Approach to Pattern Growth with Reduced Candidacy Generation

» Frequent regular itemset mining

» MINI Mining Informative Nonredundant Itemsets

» Probabilistic frequent itemset mining in uncertain databases

» PartitionBased Approach to Processing Batches of Frequent Itemset Queries

» An Efficient Algorithm for Maintaining Frequent Closed Itemsets over Data Stream

» A Treebased Approach for Efficiently Mining Approximate Frequent Itemsets

» Algorithms for Discovery of Frequent Superset Rather than Frequent Subset

» Mining MultiLevel Frequent Itemsets under Constraints

Post Info
More Details (n/a)

Added	30 Jun 2010
Updated	30 Jun 2010
Type	Conference
Year	2004
Where	DMKD
Authors	Mohammad El-Hajj, Osmar R. Zaïane

Comments (0)