Académique Documents
Professionnel Documents
Culture Documents
ABSTRACT
Data mining is the process of extracting useful information from the huge amount of data stored in the database. Data mining
tools and techniques help to predict business trends those can occur in near future. Data mining is the procedure of mining
knowledge from data. The information or knowledge extracted can be used for any of the following applications such as Market
analysis, Fraud detection, Customer retention, Production control, Science exploration. Database mining deals with the data
stored in database management systems. Association rule mining is an important technique to discover hidden relationships
among items in the transaction. The aim of this paper is to experimentally evaluate an association rule mining approaches, the
partition and the border algorithm. The partition algorithm is divided into two phases. In the first phase, the database is divided
into number of non overlapping partitions and then the frequent itemsets local to partition are generated for each partition. The
database is scanned completely for the first time. Then in the second phase, local frequent itemsets from each partition are
combined to generate global candidate itemsets. Again the database is scanned second time to generate global frequent itemsets.
The border algorithm maintains support counters for all frequent sets and all border sets. And then get a promoted border (more
precisely, when a border set is promoted to a frequent set), an additional pass over the database is made. If there is no promoted
border, then the algorithm does not require even a single pass over the whole database. The partition algorithm produces
frequent itemset whereas the border algorithm produces promoted border itemsets. The dataset used in this work is the
vegetable dataset. The results of both algorithms are compared and analysed that in the border algorithm, the infrequent itemset
becomes frequent itemset.
Keyword: - association rule mining, database, frequent itemset, partition