BitTableFI: An efficient mining frequent itemsets algorithm

Knowledge-Based Systems

Volumn 20, Issue 4, 2007, Pages 329-335

  Dong, Jie ^a   Han, Min ^a  

^a DALIAN UNIVERSITY OF TECHNOLOGY   (China)

Author keywords

BitTable; Data mining; Database compressing; Frequent itemsets

Indexed keywords

ALGORITHMS; DATA COMPRESSION; DATABASE SYSTEMS; TIME SERIES ANALYSIS;

BITTABLE; CANDIDATE ITEMSETS; DATABASE COMPRESSING; FREQUENT ITEMSETS;

DATA MINING;

EID: 34047267825     PISSN: 09507051     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.knosys.2006.08.005     Document Type: Article

References (16)

1. R. Agrawal, T. Imilienski, A. Swami, Mining association rules between sets of items in large databases, in: Proceedings of the ACM SIGMOD International Conference on Management of Data, Washington, DC, 1993, pp. 207-216.
2. R. Agrawal, R. Srikant, Fast algorithm for mining association rules in large databases, in: Proceedings of 1994 International Conference on VLDB, 1994, pp. 487-499.
3. M.Z. Ashrafi, D. Taniar, K. Smith, A compress-based association mining algorithm for large dataset, in: Proceedings of International Conference on Computational Science 2003, Lecture notes in computer science, vol. 2660, Springer, Berlin, 2003, pp. 978-987.
4. Bonchi F., Giannotti F., Mazzanti A., and Pedreschi D. Efficient breadth-first mining of frequent pattern with monotone constraints. Knowledge and Information Systems 8 2 (2005) 131-153
5. Burdick D., Calimlim M., Flannick J., Gehrke J., and Yiu T.M. MAFIA: a maximal frequent itemset algorithm. IEEE Transactions on Knowledge and Data Engineering 17 11 (2005) 1490-1504
6. Gouda K., and Zaki M.J. GenMax: an efficient algorithm for mining maximal frequent itemsets. Data Mining and Knowledge Discovery 11 3 (2005) 223-242
7. Goulbourne G., Coenen F., and Leng P. Algorithms for computing association rules using a partial-support tree. Knowledge-Based Systems 13 2-3 (2000) 141-149
8. Grahne G., and Zhu J.F. Fast algorithms for frequent itemset mining using FP-trees. IEEE Transactions on Knowledge and Data Engineering 17 10 (2005) 1347-1362
9. Han J.W., Pei J., Yin Y.W., and Mao R.Y. Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Mining and Knowledge Discovery 8 1 (2004) 53-87
10. Holt J.D., and Chung S.M. Mining association rules using inverted hashing and pruning. Information Processing Letters 83 4 (2002) 211-220
11. Li Y.J., Ning P., Wang X.S., and Jajodia S. Discovering calendar-based temporal association rules. Data and Knowledge Engineering 44 2 (2003) 193-218
12. McGarry K. A survey of interestingness measures for knowledge discovery. Knowledge Engineering Review 20 1 (2005) 39-61
13. Park J.S., Chen M.S., and Yu P.S. Using a hash-based method with transaction trimming for mining association rules. IEEE Transactions on Knowledge and Data Engineering 9 5 (1997) 813-825
14. Tsay Y.J., and Chiang J.Y. CBAR: an efficient method for mining association rules. Knowledge-Based Systems 18 2-3 (2005) 99-105
15. Zaki M.J. Scalable algorithms for association mining. IEEE Transactions on Knowledge and Data Engineering 12 3 (2000) 372-390
16. Zaki M.J. Mining non-redundant association rules. Data Mining and Knowledge Discovery 9 3 (2004) 223-248