|International Conference and workshop on Advanced Computing 2013
|Foundation of Computer Science USA
|ICWAC - Number 3
|Authors: Anil Vasoya, Rekha Sharma
Anil Vasoya, Rekha Sharma . Mining of frequent Itemset using PAFI and Transaction Reduction Method. International Conference and workshop on Advanced Computing 2013. ICWAC, 3 (June 2013), 0-0.
Now a day, Mining of Association rules in large database is the challenging task. An Apriori algorithm is widely used to find out the frequent item sets from large database. But it has some limitations. It produces overfull candidates while finding the frequent item sets from transactions, i. e. the algorithm needs to scan database repetitively while finding frequent item sets. It will be inefficient in large database and also it requires more I/O load while accessing the database frequently. To solve the bottleneck of the Apriori algorithm, PAFI and Matrix based method used in proposed system.