AN IMPROVED APRIORI ALGORITHM FOR MARKET BASKET ANALYSIS

Abstract

Data mining is an essential process to discover an interesting pattern from the given data. It is an influential algorithm to find out frequent item set. We propose an improved Apriori algorithm which find out the frequent item set in an efficient and less time .In order to prove the correctness of proposed approach an example has being explained which shows that an efficient apriori can be achieved by pruning the item set from the initial database whose support count is less than minimum support count.