An intelligent feature selection approach with systolic tree structures for efficient association rules in big data environment

Abstract

Frequent Pattern Mining (FPM) is regularly used in data mining applications for identifying objects of interest that frequent transactional databases. Traditional ARM algorithms work on minimum levels of support and confidence metrics which have to be defined and are subjective. This work attempts to solve this issue by proposing techniques for the automatic determination of these metrics. The Kernel Possibilistic Fuzzy Local Information C-Means (KPFLICM) Clustering and K-means Clustering-based Feature Selection algorithm for Association Rules (KCFSAR) is used where FPMs are based on Systolic Tree Structures (STS). These structures aim to achieve better accuracy by mimicking internal memory structures of the Frequent Pattern Growths (FPG) algorithm. Moreover, Chaotic Butterfly Optimization Method (CBOAs) is used to obtain the optimal support value and CBOA subsequently discovers global optimal solutions. This work's suggested scheme demonstrates its efficacy and superiority in experimental findings when compared to other approaches in terms of feature subset sizes, accuracies, execution times, and memory consumptions.