Mining Frequent Pattern by Titanic and FP-Tree algorithms-Reference-Cited by-同舟云学术

Mining Frequent Pattern by Titanic and FP-Tree algorithms

Published:2020-10-02 Issue: Volume: Page:208-215
ISSN:2456-3307
Container-title:International Journal of Scientific Research in Computer Science, Engineering and Information Technology
language:en
Short-container-title:IJSRCSEIT

Author:

FAKIR Youssef¹,El AYACHI Rachid¹,FAKIR Mohamed

Affiliation:

1. Laboratory of Information Processing and Decision Support, Faculty of Sciences and Technics, Sultan Moulay Slimane Unversity, Morocco

Abstract

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.

Publisher

Technoscience Academy

Subject

General Medicine

Reference12 articles.

1. Hamrouni, T. Extraction of generic informative bases of rules without calculation of closings. Retrieved from memoireonline: https://www.memoireonline.com/03/10/3241/m_Extraction-des-bases-generiques- informatives-de-regles-sans-calcul-de-fermetures9.html

2. Jiawei Han et al, Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree Approach, Data Mining and Knowledge Discovery, 8, 53–87, 200 4

3. Gerd Stumme et al, “Computing iceberg concept lattices with TITANIC”, Knowledge Engineering 42 (2002) 189–222

4. Wang, Y. He, D. Cheung, Y. Chin, “Mining confident rules without support requirement”, in: Proceedings of ACM International Conference on Information and Knowledge Management, CIKM, 2001, pp. 89-96.

5. Xiong, P. Tan, V. Kumar, “Mining strong affinity association patterns in data sets with skewed support distribution”, in: Proceedings of the Third IEEE International Conference on Data Mining, ICDM, 2003, pp. 387-394.

Cited by 1 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Mining Frequents Itemset and Association Rules in Diabetic Dataset;Business Intelligence;2022