Mining Frequent Itemsets over Uncertain Database using Matrix

Abstract

In the area of data mining for finding frequent itemset from huge database, there exist a lot of algorithms, out of all Apriori algorithm is the base of all algorithms. In Uapriori algorithm each items existential probability is examined with a given support count, if it is greater or equal then these items are known as frequent items, otherwise these are known as infrequent itemsets. In this paper matrix technology has been introduced over Uapriori algorithm which reduces execution time and computational complexity for finding frequent itemset from uncertain transactional database. In the modern era, volume of data is increasing exponentially and highly optimized algorithm is needed for processing such a large amount of data in less time. The proposed algorithm can be used in the field of data mining for retrieving frequent itemset from a large volume of database by taking very less computation complexity.