Una investigación comparativa entre algoritmos de reglas de asociación

In this paper we propose three algorithms for the data association and presents a description of each with the purpose of showing how it performs the associations that leads to the association rules. Afterwards, a comparison among this is performed to determine its efficiency and effectiveness in the results. To do it, the algorithm complexity is to be found, and the quality of the results and the rules generated  are evaluated. At the same time, different sets of data will be used to test each algorithm. Finally, the conclusions obtained from this research will be presented.