COFI approach for mining frequent itemsets revisited

Proceedings of the ACM SIGMOD International Conference on Management of Data

Volumn , Issue , 2004, Pages 70-75

  El Hajj, Mohammad ^a   Zaïane, Osmar R ^a  

^a UNIVERSITY OF ALBERTA   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EFFICIENT ALGORITHM; FREQUENT ITEMSETS; LARGE DATASETS; MAXIMAL ITEMSETS; MINING FREQUENT ITEMSETS; NOVEL ALGORITHM; ORDER OF MAGNITUDE; REAL DATA SETS; STATE-OF-THE-ART ALGORITHMS; SYNTHETIC DATA; TRANSACTIONAL DATABASE;

ALGORITHMS; DATA MINING; DATA STRUCTURES;

TREES (MATHEMATICS);

EID: 33745603141     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1008694.1008706     Document Type: Conference Paper

References (15)

1. R. Agrawal, T. Imielinski, and A. Swami. Mining association rules between sets of items in large databases. In Proc. 1993 ACM-SIGMOD Int. Conf. Management of Data, pages 207-216, Washington, D.C., May 1993.
2. R. Agrawal and R. Srikant. Fast algorithms for mining association rules. In Proc. 1994 Int. Conf. Very Large Data Bases, pages 487-499, Santiago, Chile, September 1994.
3. R. J. Bayardo. Efficiently mining long patterns from databases. In ACM SIGMOD, 1998.
4. F. Beil, M. Ester, and X. Xu. Frequent term-based text clustering. In Proc. 8th Int. Conf. on Knowledge Discovery and Data Mining (KDD '2002), Edmonton, Alberta, Canada, 2002.
5. D. Burdick, M. Calimlim, and J. Gehrke. Mafia: A maximal frequent itemset algorithm for transactional databases. In ICDE, pages 443-452, 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. In In Proc. 2003 Int'l Conf. on Data Mining and Knowledge Discovery (ACM SIGKDD), pages 109-118, August 2003.
7. M. El-Hajj and O. R. Zaïane. Non recursive generation of frequent k-itemsets from frequent pattern tree representations. In In Proc. of 5th International Conference on Data Warehousing and Knowledge Discovery (DaWak'2003), pages 371-380, September 2003.
8. B. Goethals. Frequent pattern mining implementations. http://www.cs.helsinki.fi/u/goethals/software/index.html.
9. B. Goethals and M. Zaki. Advances in frequent itemset mining implementations: Introduction to fimi03. In Workshop on Frequent Itemset Mining Implementations (FIMI'03) in conjunction with IEEE-ICDM, 2003.
10. K. Gouda and M. J. Zaki. Efficiently mining maximal frequent itemsets. In ICDM, pages 163-170, 2001.
11. J. Han, J. Pei, and Y. Yin. Mining frequent patterns without candidate generation. In ACM-SIGMOD, Dallas, 2000.
12. IBM-Almaden. Quest synthetic data generation code. http://www.almaden. ibm.com/cs/quest/syndata.html.
13. H. Mannila. Inductive databases and condensed representations for data mining. In International Logic Programming Symposium, 1997.
14. A. Rungsawang, A. Tangpong, P. Laohawee, and T. Khampachua. Novel query expansion technique using apriori algorithm. In TREC, Gaithersburg, Maryland, 1999.
15. M. J. Zaki. Scalable algorithms for association mining. Knowledge and Data Engineering, 12(2):372-390, 2000.