WASET
	%0 Journal Article
	%A Moez Ben Hadj Hamida and  Yahya SlimaniI
	%D 2007
	%J International Journal of Computer and Information Engineering
	%B World Academy of Science, Engineering and Technology
	%I Open Science Index 4, 2007
	%T A Patricia-Tree Approach for Frequent Closed Itemsets
	%U https://publications.waset.org/pdf/11709
	%V 4
	%X In this paper, we propose an adaptation of the Patricia-Tree for sparse datasets to generate non redundant rule associations. Using this adaptation, we can generate frequent closed itemsets that are more compact than frequent itemsets used in Apriori approach. This adaptation has been experimented on a set of datasets benchmarks.

	%P 1086 - 1089