Mining Frequent Pattern by Titanic and FP-Tree algorithms

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 w...

Full description

Saved in:
Bibliographic Details
Published inInternational Journal of Scientific Research in Computer Science, Engineering and Information Technology pp. 208 - 215
Main Authors FAKIR, Youssef, El AYACHI, Rachid, FAKIR, Mohamed
Format Journal Article
LanguageEnglish
Published 15.10.2020
Online AccessGet full text

Cover

More Information
Summary: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.
ISSN:2456-3307
2456-3307
DOI:10.32628/CSEIT206537