Corresponding Authors:

Nombre Claude Issa¹, Brou Konan Marcellin², Kimou Kouadio Prosper³, ¹Polytechnic Doctoral School, ²National Polytechnic Institute Houphouet Boigny – Yamoussoukro, ³Research Laboratory of Computer Science and Technology

Abstract

Since the reference algorithm APRIORI [AGR97], other algorithms for optimizing the extraction of association rules have been developed. But no method is generally better than the others. This article deals with the optimization of closed itemsets in the context of highly correlated data. The work in this article responds to one of the perspectives of our article entitled "A new approach to optimizing the extraction of frequent 2-itemsets". In this previous article, we had obtained interesting optimization results from the 2-itemsets on a context of extraction of scattered data (weakly correlated data). The present article allowed us to obtain interesting results of the 2-itemsets on dense data (strongly correlated).

Keywords

Precise and concise number of association rules, dense data, margin of error, itemset