An efficient algorithm for mining frequent maximal and closed itemsets

Article type: Research Article

Authors: Gharib, Tarek F.

Affiliations: Faculty of Computer and Information Sciences, Ain Shams University, Cairo, Egypt. E-mail: tgharib@eun.eg

Abstract: The mining of frequent patterns is a basic problem in data mining applications. Frequent maximal and closed itemsets mining has become an important alternative of association rule mining. In this paper we present an effective algorithm which based on the blanket approach for mining all frequent maximal & closed itemsets. The performance of the proposed algorithm had been compared with recently developed algorithms. The results show how the proposed algorithm gives better performance. This is achieved by examining the performance and functionality of the proposed technique.

Keywords: Mining-frequent itemsets, blanket, maximal and closed itemsets

DOI: 10.3233/HIS-2009-0091

Journal: International Journal of Hybrid Intelligent Systems, vol. 6, no. 3, pp. 147-153, 2009