Mining Frequent Pattern by Titanic and FP-Tree algorithms
Youssef Fakir, Rachid El Ayachi, Mohamed Fakir · International Journal of Scientific Research in Computer Science Engineering and Information Technology · 2020
Extraction of itemset frequent is an important theme in Datamining. Several algorithm have been developed based on Apriori algorithm during the last decades. This paper deals with the FP- tree and Titanic algorithms. FP-Tree is an improvement to the Apriori method witch generate frequents itemsets without generating candidate. The Titanic algorithm traverses the level search space by focusing on the determination of the minimum generators (or key Item sets). In addition, this paper studies the differences between these two algorithms and shows advantages and disadvantages of each one.