Scrutinizing frequent pattern discovery performance

Proceedings - International Conference on Data Engineering

Volumn , Issue , 2005, Pages 1109-1110

  Zaïane, Osmar R ^a   El Hajj, Mohammad ^a   Li, Yi ^a   Luk, Stella ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

BENCHMARKING TECHNICAL SOLUTIONS; RIGOROUS EVALUATION;

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; DATA MINING; DATABASE SYSTEMS;

PATTERN RECOGNITION;

EID: 28444499666     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2005.127     Document Type: Conference Paper

References (18)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. VLDB, 1994.
2. R. J. Bayardo. Efficiently mining long patterns from databases. ACM SIGMOD, 1998.
3. C. Borgelt. Apriori implementation, http://fuzzy.cs.unimagdeburg.de/ ~borgelt/apriori/apriori.html.
4. C. Bucila, J. Gehrke, D. Kifer, and W. White. Dualminer: A dual-pruning algorithm for itemsets with constraints. ACM SIGKDD, 2002.
5. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. IEEE ICDE, 2001.
6. M. El-Hajj and O. R. Zaïane. Inverted matrix: Efficient discovery of frequent items in large datasets in the context of interactive mining. ACM SIGKDD, 2003.
7. B. Goethals and M. Zaki. Advances in frequent itemset mining implementations. Workshop on Frequent Itemset Mining Implementations, 2003.
8. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. IEEE ICDM, 2001.
9. G. Grahne and J. Zhu. Efficiently using prefix-trees in mining frequent itemsets. FIMI'03, Workshop on Frequent Itemset Mining Implementations, 2003.
10. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. ACM-SIGMOD, 2000.
11. IBM_Almaden. Quest synthetic data generation code. http://www.almaden. ibm.com/cs/quest/syndata.html.
12. R. Ng, L. Lakshmanan, J. Han, and T. Mah. Exploratory mining via constraint frequent set queries. ACM SIGMOD, 1999.
13. J. Pie and J. Han. Can we push more constraints into frequent pattern mining? ACM SIGKDD, 2000.
14. Uci knowledge discovery in databases archive. http://kdd.ics.uci.edu/.
15. J. Wang, J. Han, and J. Pei. Closet+: Searching for the best strategies for mining frequent closed itemsets. ACM SIGKDD, 2003.
16. 1998 world cup web site data. http://ita.ee.lbl.gov/html/contrib/ WorldCup.html.
17. M. Zaki and C.-J. Hsiao. ChARM: An efficient algorithm for closed itemset mining. SIAM SDM, 2002.
18. Z. Zheng, R. Kohavi, and L. Mason. Real world performance of association rule algorithms. ACM SIGKDD, 2001.