Sec Minimum Support Time (sec) Minimum Support (%) maximal-kosarak ibe mafia eclat_borgelt fpmax*...  Home/Search
Context
Related
| rpi.edu/~zaki/./PS/FIMI03.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rpi.edu/~zaki/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: this report. We refer the reader to the FIMI repository for a more detailed experimental study. The study done by us was also somewhat limited, since we performed only timing and memory usage experiments for given datasets. Ideally, we would have liked to do a more detailed study of the scale-up of the algorithms, and for a variety of di#erent parameters; our preliminary studies show that none of the algorithms is able to gracefully scale-up to very large datasets, with millions of... (Update)
Active bibliography (related documents): More All
1.4: Advances in Frequent Itemset Mining Implementations: Report.. - Goethals, Zaki (2003) (Correct)
1.4: Maximal-Kosarak - Ibe Mafia Eclat (Correct)
1.4: FIMI'03: Workshop on Frequent Itemset Mining Implementations - Goethals, Zaki (2003) (Correct)
Similar documents based on text:
0.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ support-unknown,
author = "Sec Minimum Support",
title = "Unknown",
url = "citeseer.ist.psu.edu/751037.html" }
Citations (may not include all citations):921 Mining association rules between sets of items in large data.. - Agrawal, Imielinski et al. - 1993
910 Fast algorithms for mining association rules - Agrawal, Srikant - 1994
400 Fast discovery of association rules (context) - Agrawal, Mannila et al. - 1996
249 Mining frequent patterns without candidate generation - Han, Pei et al. - 2000
242 Dynamic itemset counting and implication rules for market ba.. - Brin, Motwani et al. - 1997
54 MAFIA: a maximal frequent itemset algorithm for transactiona.. (context) - Burdick, Calimlim et al. - 2001
53 ciently mining long patterns from databases (context) - Bayardo - 1998
45 Set-oriented mining of association rules in relational datab.. (context) - Houtsma, Swami - 1995
37 Discovering all the most specific sentences by randomized al.. - Gunopulos, Mannila et al. - 1997
25 Depth First Generation of Long Patterns (context) - Agrawal, Aggarwal et al. - 2000
23 Mining frequent patterns with counting inference - Bastide, Taouil et al. - 2000
21 Using association rules for product assortment decisions: A .. - Brijs, Swinnen et al. - 1999
20 ciently mining maximal frequent itemsets (context) - Gouda, Zaki - 2001
9 Galois connection and data mining - Cristofor, Cristofor et al. - 2000
6 A fast apriori implementation - Bodon - 2003
5 High performance mining of maximal frequent itemsets (context) - Grahne, Zhu - 2003
5 cient Frequent Pattern Mining (context) - Goethals - 2002
4 Towards long pattern generation in dense databases (context) - Aggarwal - 2001
4 Profiling high frequency accident locations using associatio.. - Geurts, Wets et al. - 2003
Documents on the same site (http://www.cs.rpi.edu/~zaki/papers.html): More
Parallel Classification for Data Mining on Shared-Memory.. - Zaki (1998) (Correct)
Efficient Enumeration of Frequent Sequences - Zaki (1998) (Correct)
PlanMine: Predicting Plan Failures using Sequence Mining - Zaki, Lesh, Ogihara (1999) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC