Mining N-most interesting itemsets without support threshold by the COFI-tree

International Journal of Business Intelligence and Data Mining

Volumn 1, Issue 1, 2005, Pages 88-106

  Ngan, Sze Chung ^a   Lam, Tsang ^a   Wong, Raymond Chi Wing ^a   Fu, Ada Wai Chee ^a  

^a CHINESE UNIVERSITY OF HONG KONG   (Hong Kong)

Author keywords

Association rules; COFI tree; Data mining; FP tree; Knowledge discovery; N most interesting itemsets

Indexed keywords

EID: 33744459519     PISSN: 17438187     EISSN: 17438195     Source Type: Journal    
DOI: 10.1504/IJBIDM.2005.007320     Document Type: Article

References (6)

1. Agrawal, R., Imilienski, T. and Swami (1993) 'Mining association rules between sets of items in large databases', Proceedings of the ACM SIGMOD, pp.207-216.
2. Agrawal, R., and Srikant, R. (1994) 'Fast algorithms for mining association rules', Proceedings of the 20th VLDB Conference, pp.487-499.
3. Cheung, Y.L. and Fu, A.W-C. (2004) 'Mining association rules without support threshold: with and without item constraints', IEEE Transactions on Knowledge and Data Engineering, (TKDE), Vol. 16, No. 9, September, pp.1052-1069.
4. El-Hajj, M. and Zaïane, O.R. (2003) 'COFI-tree mining: a new approach to pattern growth with reduced candidacy generation', Workshop on Frequent Itemset Mining Implementations (FIMI'03) in conjunction with IEEE-ICDM.
5. El-Hajj, M. and Zaïane, O. R. (2003), 'COFI Tree Mining: A New Approach to Pattern Growth with Reduced Candidacy Generation', Workshop on Frequent Itemset Mining Implementations (FIMI'03) in conjunction with IEEE-ICDM 2003.
6. Han, J., Pei, J. and Yin, Y. (2000) 'Mining frequent patterns without candidate generations', Proceeding of the ACM SIGMOD, pp.1-12.