Survey: Efficent tree based structure for mining frequent pattern from transactional databases

Hitul Patel Hitul Patel
2013 IOSR Journal of Computer Engineering  
Different types of data structure and algorithm have been proposed to extract frequent pattern from a given databases. Several tree based structure have been devised to represent the data for efficient frequent pattern discovery. One of the fastest and efficient frequent pattern mining algorithm is CATS algorithm which represent the data and allow mining with a single scan of database. CATS tree can be used with incremental update of the database. Transaction can be added or removed without rebuilding of the whole data structure.
doi:10.9790/0661-0957581 fatcat:cz43s6w4ujdflkbnak7odlii2y