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.