FPGA/GPU-based Acceleration for Frequent Itemsets Mining: A Comprehensive Review

In data mining, Frequent Itemsets Mining is a technique used in several domains with notable results. However, the large volume of data in modern datasets increases the processing time of Frequent Itemset Mining algorithms, making them unsuitable for many real-world applications. Accordingly, proposing new methods for Frequent Itemset Mining to obtain frequent itemsets in a realistic amount of time is still an open problem. A successful alternative is to employ hardware acceleration using Graphics Processing Units (GPU) and Field Programmable Gates Arrays (FPGA). In this article, a comprehensive review of the state of the art of Frequent Itemsets Mining hardware acceleration is presented. Several approaches (FPGA and GPU based) were contrasted to show their weaknesses and strengths. This survey gathers the most relevant and the latest research efforts for improving the performance of Frequent Itemsets Mining regarding algorithms advances and modern development platforms. Furthermore, this survey organizes the current research on Frequent Itemsets Mining from the hardware perspective considering the source of the data, the development platform, and the baseline algorithm.

A Seasonal and Multilevel Association Based Approach for Market Basket Analysis in Retail Supermarket

Market Basket Analysis is an observational data mining methodology to investigate the consumer buying behavior patterns in retail Supermarket. It analyzes customer baskets and explores the relationship among products that helps retailers to design store layouts, make various strategic plans and other merchandising decisions that have a big impact on retail marketing and sales. Frequent itemsets mining is the first step for market basket analysis. The association rules mining uncovers the relationship among products by looking what products the customers frequently purchase together. In retail marketing, the transactional database consists of many itemsets that are frequent only in a particular season however not taken into consideration as frequent in general. In some cases, association rules mining at lower data level with uniform support doesn't reflect any significant pattern however there is valuable information hiding behind it. To overcome those problems, we propose a methodology for mining seasonally frequent patterns and association rules with multilevel data environments. Our main contribution is to discover the hidden seasonal itemsets and extract the seasonal associations among products in additionally with the traditional strong regular rules in transactional database that shows the superiority for making season based merchandising decisions. The dataset has been generated from the transaction slips in large supermarket of Bangladesh that discover 442 more seasonal patterns as well as 1032 seasonal association rules in additionally with the regular rules for 0.1% minimum support and 50% minimum confidence.

A novel consumer preference mining method based on improved weclat algorithm

Purpose Conventional frequent itemsets mining ignores the fact that the relative benefits or significance of “transactions” belonging to different customers are different in most of the relevant applied studies, which leads to failure to obtain some association rules with lower support but from higher-value consumers. Because not all customers are financially attractive to firms, it is necessary that their values be determined and that transactions be weighted. The purpose of this study is to propose a novel consumer preference mining method based on conventional frequent itemsets mining, which can discover more rules from the high-value consumers. Design/methodology/approach In this study, the authors extend the conventional association rule problem by associating the “annual purchase amount” – “price preference” (AP) weight with a consumer to reflect the consumer’s contribution to a market. Furthermore, a novel consumer preference mining method, the AP-weclat algorithm, is proposed by introducing the AP weight into the weclat algorithm for discovering frequent itemsets with higher values. Findings The experimental results from the survey data revealed that compared with the weclat algorithm, the AP-weclat algorithm can make some association rules with low support but a large contribution to a market pass the screening by assigning different weights to consumers in the process of frequent itemsets generation. In addition, some valuable preference combinations can be provided for related practitioners to refer to. Originality/value This study is the first to introduce the AP-weclat algorithm for discovering frequent itemsets from transactions through considering AP weight. Moreover, the AP-weclat algorithm can be considered for application in other markets.

A Comprehensive Survey of Frequent Itemsets Mining on Transactional Database with Weighted Items

In 1993, Agrawal et al. proposed the first algorithm for mining traditional frequent itemset on binarytransactional database with unweighted items - This algorithmis essential in finding hindden relationships among items inyour data. Until 1998, with the development of various typesof transactional database - some researchers have proposed afrequent itemsets mining algorithms on transactional databasewith weighted items (the importance/meaning/value of itemsis different) - It provides more pieces of knowledge thantraditional frequent itemsets mining. In this article, the authors present a survey of frequent itemsets mining algorithmson transactional database with weighted items over the pasttwenty years. This research helps researchers to choose theright technical solution when it comes to scale up in big datamining. Finally, the authors give their recommendations anddirections for their future research.

Closed frequent itemsets mining based on It-Tree

In the last decade, the amount of collected data, in various computer science applications, has grown considerably. These large volumes of data need to be analysed in order to extract useful hidden knowledge. This work focuses on association rule extraction. This technique is one of the most popular in data mining. Nevertheless, the number of extracted association rules is often very high, and many of them are redundant. In this paper, we propose an algorithm, for mining closed itemsets, with the construction of an it-tree. This algorithm is compared with the DCI (direct counting & intersect) algorithm based on min support and computing time. CHARM is not memery-efficient. It needs to store all closed itemsets in the memory. The lower min-sup is, the more frequent closed itemsets there are so that the amounts of memory used by CHARM are increasing.

A Novel Approach of Frequent Itemsets Mining for Coronavirus Disease (COVID-19)

The global pandemic of new coronaviruses (COVID-19) has infected many people around the world and became a worldwide concern since this disease caused illness and deaths. The vaccine and drugs are not scientifically established, but patients are recovering with antibiotic drugs, antiviral medicine, chloroquine, and vitamin C. Now it is obvious to the world that a quicker and faster solution is needed for monitoring and combating the further spread of COVID-19 worldwide, using non-clinical techniques, for example, data mining tools, enhanced intelligence, and other artificial intelligence technologies. In this paper, association rule mining is developing for the frequent itemsets discovery in COVID-19 datasets, and the extraction of effective association relations between them. This is done by demonstrates the analysis of the Coronavirus dataset by using the Apriori_Association_Rules algorithm. It involves a scheme for classification and prediction by recognizing the associated rules relating to Coronavirus. The major contribution of this study employment determines the effectiveness of the Apriori_Association_Rules algorithm towards a classification of medical reports. The experimental results provide evidence of the Apriori_Association_Rules algorithm regarding the execution time, memory consumption, and several associated rules that reflect its potential applications to different contexts. Therefore, the Apriori_Association_Rules algorithm will be very useful in healthcare fields to demonstrate the latest developments in medical studies fighting COVID-19.