An integrated cuckoo search-genetic algorithm for mining frequent itemsets

Abstract

Mining frequent itemsets is a contemporary research topic in the data-mining domain. Identifying frequent itemsets has acquired its significance due to recognized objectives in the field of association mining. The frequent itemset mining problem focuses on identifying frequent patterns and correspondence between the itemsets in the transactional database. Frequent itemset mining problems are time consuming when dealing with huge amounts of data and extracting the maximum number of the frequent itemsets from a large search space is a challenging process. Since the transactional database size is enormous, a stochastic method is applied to find optimal solutions. In this article, an integrated approach to extract frequent itemsets is proposed based on the cuckoo search and genetic algorithm. This integrated methodology is performed by merging the reproduction process of cuckoo species with the operators such as crossover and mutation in GA. First, a strategy to diversify the population and to discover maximum frequent patterns in the search process, Second, a neighborhood exploration strategy is applied for recurrent solutions to improve the accuracy. Finally, the proposed integrated approach is validated with respect to the solution quality and convergence rate. The integrated approach is verified using standard data instances. The ICSGA approach efficiently discovers the frequent patterns. The comparison results of the integrated approach are eminently productive than the other approaches in the literature.