Design and Analysis of JIC Algorithm on Big Data

Finding the frequent itemset is one of the most investigated extents of data mining. The Apriori algorithm is the most established algorithm for frequent itemset mining, but it has issues regarding scanning frequent databases and generating a large amount of candidate sets. To solve these issues, an Improved Apriori algorithm was proposed. We examined the data structure, implementation, and algorithmic features that mainly focus on frequent itemset mining. We are representing an Improved Apriori algorithm on Spark in which simple and scalable implementation is done to achieve a faster process with lower support thresholds. We examined the improved Apriori algorithm on Extended Bakery Dataset and Retail Dataset. The results show execution time was reduced by 40% and 57% compared with the original Apriori algorithm.

DEFINITION Let I be a set of binary-valued attributes, called items. A set X ⊆ I is called an itemset. A transaction database D is a multiset of itemsets, where each itemset, called a transaction, has a unique identifier, called a tid. The support of an itemset X in a dataset D, denoted sup(X), is the fraction of transactions in D where X appears as a subset. X is said to be a frequent itemset in D if sup(X) ≥ minsup, where minsup is a user defined minimum support threshold. An (frequent) itemset is called closed if it has no (frequent) superset having the same support. An association rule is an expression A ⇒ B, where A and B are itemsets, and A ∩ B = ∅. The support of the rule is the joint probability of a transaction containing both A and B, given as sup(A ⇒ B) = P (A ∧ B) = sup(A ∪ B). The confidence of a rule is the conditional probability that a transaction contains B, given that it contains A, given as: conf(A ⇒ B) = P (B|A) = P (A∧B) P (A) = sup(A∪B) sup(A) . A rule is frequent if the itemset A∪B is frequent. A rule is confident if conf ≥ minconf , where minconf is a user-specified minimum threshold. The aim of non-redundant association rule mining is to generate a rule basis, a small, non-redundant set of rules, from which all other association rules can be derived.

A provided data from a transactional database, has supported technical development which can automatically find product association or items saved in the database. This finding association rules between saved product in database known as mining association rules. There are so many theories and algorithm developed for conducting mining association rules. One of algorithm developed is Apriori algorithm. This method, has a main goal to find the maximum frequent itemset. Next, this frequent itemset will be generated into associative rules which are not shown before in the database, become valuable information for considering materials in the decision process. Apriori algorithm is a interpretation technique of mining association rules, will be implemented into a web based software. On the software test which use in some different data, it’s concluded that time for mining association rules depends on the presence of every item in every transaction, total of transaction, minimum support and minimum confidence. For smaller value of minimum support and minimum confidence that entered, program will generate more association rules, vice versa.

Tourist attractions are places of interest and visited by tourists because they have certain appeals. These attractions can include natural tourism, cultural tourism, artificial tourism, or agro-tourism. Simalungun Regency offers various interesting tourist spots, ranging from natural beauty such as waterfalls and lakes to rich traditional cultures that reflect local history and customs. However, information about tourist visit patterns remains limited. A deeper understanding of these patterns is crucial, especially for tourism managers in designing effective and sustainable development strategies. Therefore, this study aims to identify associations or relationships between tourist attractions based on tourist visit data. The Apriori algorithm was chosen for its ability to discover high-frequency patterns in large datasets. These patterns are expected to provide valuable insights for tourism managers in designing effective promotional strategies. Apriori is a well-known algorithm in data mining, particularly for finding frequent itemsets using association rule techniques. The algorithm is carried out by determining frequent itemsets, from 1-itemset to multi-itemsets, until the association rules are derived from the pre-selected data. To obtain these frequent itemsets, each selected data must meet the minimum support and minimum confidence requirements so that the resulting association rules are relevant and practically applicable.

The extraction of frequent itemsets and association rules is a fundamental challenge in data mining and holds significant importance within the field. Mining techniques utilising Linear Prefix (LP) growth association rules employ a bottom-up methodology that necessitates a conditional pattern base and a conditional LP-tree for the extraction of frequent itemsets. This research proposes a Linear Prefix tree utilising a Top-Down Approach with Clustering (CLTDLP) method, to address the limitations of the current LP-growth algorithm. The suggested CLTD-LP algorithm employs a top-down methodology; it generates a subheader table to effectively mine common items, rendering the CLTD-LP algorithm more advantageous as it does not create a conditional pattern base or LP-tree. The proposed methodology enhances the algorithm's efficiency regarding execution time and memory utilisation. Overall, across three benchmark datasets, the proposed CLTD-LP algorithm consistently achieves better average reduction in terms of runtime and memory than the existing LP-growth, Ordered Frequent Itemsets Matrix (OFIM) and Simple and Scalable Frequent Itemset Mining(SSFIM) algorithms.

The transaction database contains a very large and irregular dataset that requires another mechanism to read it, even though there is a lot of new knowledge that can be revealed, including associations or relationships between goods or products that are often purchased by customers. The new finding of the relationship between these variables is usually called association rule mining. The algorithm that is developing and often used is frequent pattern-growth (FP-Growth). The problem of very many transaction databases also occurred in Mr. A. So, in this research, we will look for customer patterns using the FP-Growth algorithm. The algorithm aims to find the maximum frequent itemset. The frequent itemset will be generated into associative rules so that it becomes valuable new knowledge. This knowledge can be used as a reference and consideration in making decisions. The FP-Growth algorithm will be implemented using the rapidminer tools on the transaction data of Mr.A's goods sales. The pattern of rules that will be searched for is based on data on sales of goods transactions. The results of the study obtained six association rules with five conclusions being the gift category. So that the suggestion for decision making is to lay out items close to and around the gift category in order to improve marketing and service strategies in order to attract the attention and interest of pointers in making purchases of goods.


 
 
 
 Apriori algorithm is a classical algorithm of association rule mining and widely used for generating frequent item sets. However, the original Apriori algorithm has some limitation such as it needs to scan the dataset many times to discover all frequent itemset and generate huge number of candidate itemset. To overcome these limitations, researchers have made a lot of improvements to the Apriori such as candidate generation, without candidate generation, transaction reduction, partitioning, and sampling. When it comes to mine massive data, these algorithms failed to prove efficiency because limitation of the processing capacity, storage capacity, and main memory constraints. Therefore, parallel and distributed algorithms are developed to perform large-scale computing in ARM on multiple processors. However, the problems with most of the parallel and distributed framework are overheads of managing distributed system, lack of high level parallel programming language, and node failures. Hadoop-MapReduce is an efficient, scalable, and simplified programming model for massive data processing and it also available on cloud environment. Cloud computing offers huge computing resources, and capacities to solve big data challenges. Recently many parallel algorithms have been proposed on Hadoop-MapReduce to enhance the performance of Apriori algorithm but there are some drawbacks: since multiple scan over the dataset is needed to generate candidate itemset, it consume more execution time. The aim of this study is to propose a parallel Transaction Reduction MapReduce Apriori algorithm (TRMR-Apriori) which is reduce unnecessary transaction values and transactions from the dataset in parallel manner to overcome above problems. The experiments show that TRMR-Apriori is able to achieve better execution time to discover frequent itemset those of previous sequential ARM algorithms such as Apriori, AprioriTid, Eclat, and FP-Growth and the previous parallel algorithms such as PApriori, MRApriori, and Modified Apriori with different condition on homogeneous computing environment using Hadoop-MapReduce platform in cloud. Overall, the TRMR-Apriori shows the strength to extract the frequent itemset from massive dataset in cloud.
 
 
 
 

A supermarket must have good business plan in order to meet customer desires. One way that can be done to meet customer desires is to find out the pattern of shopping purchases resulting from processing sales transaction data. Data processing produces information related to the function of the association between items of goods temporarily. Association rules functions in data mining.Association rule is one of the data mining techniques used to find patterns in combination of transaction data. Apriori algorithm can be used to find association rules. Apriori algorithm is used to find frequent itemset candidates who meet the support count. Frequent itemset that meets the support count is then processed using the temporal association rules method. The function of temporal association rules is as a time limitation in displaying the results of frequent itemsets and association rules. This study aims to produce rules from transaction data, apriori algorithm is used to form temporal association rules. The final results of this research are strong rules, they are rules that always appear in 3 years at certain time intervals with limitation on support and confidence, so that the rules can be used for business plan layout recommendations in Maharani Supermarket Demak.

Data Mining is a technique for finding, searching, or extracting new information or knowledge from a very large set of data, by integration or merging with other disciplines such as statistics, artificial intelligence, and machine learning, making Data Mining as one of the tools to analyze data and then produce useful information. Association Rule is a process in Data Mining to determine all associative rules that meet the minimum requirements for support (minsup) and confidence (minconf) in a database. In Association Rule, there are 2 methods that can be used, namely a priori method and FP-Growth method, where FP-Growth method is the development of a priori method where a priori method there are still some shortcomings such as there are many patterns of data combinations that often appear (many frequent patterns), many types of items but low minimum support fulfillment, it takes quite a long time because database scanning is done repeatedly to get the ideal frequent pattern. In this study the method used is a priori algorithm method, a priori algorithm method is one of the alternative ways to find the most frequently appearing data sets (frequent itemset) without using candidate generation that is suitable for analyzing a transaction data. Coffee analysis is a Cafe Shop engaged in the sale of food and beverages that many food and beverage sales transactions. Open on November 7, 2021 coffee analysis penetrates 245 sales transactions and this transaction data continues to grow every day.

The association rule mining can be divided into two steps. The first step is to find out all frequent itemsets, whose occurrences are greater than or equal to the user-specified threshold. The second step is to generate reliable association rules based on all frequent itemsets found in the first step. Identifying all frequent itemsets in a large database dominates the overall performance in the association rule mining. In this paper, we propose an efficient hash-based method, HMFS, for discovering the maximal frequent itemsets. The HMFS method combines the advantages of both the DHP (Direct Hashing and Pruning) and the Pincer-Search algorithms. The combination leads to two advantages. First, the HMFS method, in general, can reduce the number of database scans. Second, the HMFS can filter the infrequent candidate itemsets and can use the filtered itemsets to find the maximal frequent itemsets. These two advantages can reduce the overall computing time of finding the maximal frequent itemsets. In addition, the HMFS method also provides an efficient mechanism to construct the maximal frequent candidate itemsets to reduce the search space. We have implemented the HMFS method along with the DHP and the Pincer-Search algorithms on a Pentium III 800 MHz PC. The experimental results show that the HMFS method has better performance than the DHP and the Pincer-Search algorithms for most of test cases. In particular, our method has significant improvement over the DHP and the Pincer-Search algorithms when the size of a database is large and the length of the longest itemset is relatively long.

Analysis of Transaction Database Using Apriori Algorithm. This study examines the use of the Apriori algorithm for analysing transaction databases. The Apriori algorithm is a fundamental technique in data mining that allows for the efficient discovery of frequent patterns and association rules in large datasets. The Apriori algorithm employs a two-step approach. Initially, it identifies frequent items in the database based on a user-defined minimum support threshold. Subsequently, it generates association rules that describe relationships between these frequent items based on metrics such as confidence and lift. This paper provides an in-depth explanation of the Apriori algorithm, emphasizing its strengths and limitations. Additionally, it presents various applications of the Apriori algorithm in real-world scenarios, such as shopping cart analysis, cross-selling and upselling, and customer segmentation. The significance of this study lies in its comprehensive analysis of the Apriori algorithm and its practical relevance in diverse data mining tasks. It serves as a valuable resource for researchers, practitioners, and anyone seeking to understand the fundamentals and applications of association rule mining. Keywords: Datamining, OLTP, Apriori algorithm, Item sets and Market Basket Analysis

This paper applied association rule mining method in the intelligent question-answering system, dug out the potential rules which user uses to sort the results in the process of browsing the results, and then generated the rule base and optimized the processing of information. Present the steps of mining association rules. Through pre-mining resources and analysis of mining association rules, focus on the improvement of associated Boolean Apriori algorithm and application in the transaction database. Finally, get the algorithm for the strong association rules extracted from the frequent itemsets.

Frequent itemset mining and association rule mining are fundamental problems in data mining. Despite of the intensive and continuous researches on frequent itemset mining, one essential and not completely solved drawback still remains. The drawback is pattern explosion: a huge number of frequent itemsets, or patterns, will be often derived. The association rule mining takes over the same drawback since each association rule consists of two frequent itemsets. One promising solution for alleviating this essential drawback practically as a post-processing is to rank the patterns and rules from various aspects and to identify which one to be examined first. In this paper, we propose to utilize the technology of representation learning to rank frequent itemsets and association rules. More specifically, we develop several evaluation measures for frequent itemsets and association rules by using the vector representations of items, transactions and frequent patterns which are obtained by existing representation learning techniques. By employing vector representations of three kinds of objects, various rankings reflecting different aspects can expect to be obtained.

When it comes to association rule mining, all frequent itemsets are first found, and then the confidence level of association rules is calculated through the support degree of frequent itemsets. As all non-empty subsets in frequent itemsets are still frequent itemsets, all frequent itemsets can be acquired only by finding all maximal frequent itemsets (MFIs), whose supersets are not frequent itemsets. In this study, an algorithm, named right-hand side expanding (RHSE), which can accurately find all MFIs, was proposed. First, an Expanding Operation was designed, which, starting from any given frequent itemset, could add items using certain rules and form some supersets of given frequent itemsets. In addition, these supersets were all MFIs. Next, this operator was used to add items by taking all frequent 1-itemsets as the starting point alternately, and all MFIs were found in the end. Due to the special design of the Expanding Operation, each MFI could be found. Moreover, the path found was unique, which avoided the algorithm redundancy in temporal and spatial complexity. This algorithm, which has a high operating rate, is applicable to the big data of high-dimensional mass transactions as it is capable of avoiding the computing redundancy and finding all MFIs. In the end, a detailed experimental report on 10 open standard transaction sets was given in this study, including the big data calculation results of million-class transactions.

In data mining finding out the frequent itemsets is one of the very essential topics. Data mining helps in identifying the best knowledge for different decision makers. Frequent itemset generation is the precondition and most time-consuming method for association rule mining. In this paper we suggest a new algorithm for frequent itemset detection that works with datasets in distributed manner. The proposed algorithm brings in a new method to find frequent itemset not including the necessitate to create candidate itemsets. The proposed approach could be implemented using horizontal representation for transaction datasets and allocating prime value. It explores all the frequent itemset that is present in the input and according to the support the maximum frequent itemset is identified. It was applied on different transactions database and compared with well-known algorithms: FP-Growth and Parallel Apriori with different support levels. The try out showed that the proposed algorithm attain major time improvement over both algorithms.