Mining Frequent Pattern by Titanic and FP-Tree algorithms

Autor:	Mohamed Fakir, Rachid El Ayachi, Youssef Fakir
Rok vydání:	2020
Předmět:	Tree traversal Computer science 0202 electrical engineering electronic engineering information engineering 020206 networking & telecommunications 020201 artificial intelligence & image processing 02 engineering and technology Data mining computer.software_genre computer
Zdroj:	International Journal of Scientific Research in Computer Science, Engineering and Information Technology. :208-215
ISSN:	2456-3307
DOI:	10.32628/cseit206537
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::a4d84ed4b639bf10f7b799592f7f49e8 https://doi.org/10.32628/cseit206537 Zobrazit plný text záznamu