On the discovery of association rules by means of evolutionary algorithms

Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery (Impact Factor: 1.59). 09/2011; 1(5):397-415. DOI: 10.1002/widm.18
Source: DBLP


Association rule learning is a data mining task that tries to discover interesting relations between variables in large databases. A review of association rule learning is presented that focuses on the use of evolutionary algorithms not only applied to Boolean variables but also to categorical and quantitative ones. The use of fuzzy rules in the evolutionary algorithms for association rule learning is also described. Finally, the main applications of association rule evolutionary learning covered by the specialized bibliography are reviewed. © 2011 John Wiley & Sons, Inc. WIREs Data Mining Knowl Discov 2011 1 397–415 DOI: 10.1002/widm.18

19 Reads
  • Source
    • "Evolutionary algorithms (EA), and particularly genetic algorithms (GA), have been extensively used for the optimization and adjustment of models in data mining tasks. They are global search algorithms that have been used successfully in many complex and difficult optimization problems due to their flexibility and robust behavior [23]. "
    [Show abstract] [Hide abstract]
    ABSTRACT: Association rule mining is a well-known methodology to discover significant and apparently hidden relations among attributes in a subspace of instances from datasets. Genetic algorithms have been extensively used to find interesting association rules. However, the rule-matching task of such techniques usually requires high computational and memory requirements. The use of efficient computational techniques has become a task of the utmost importance due to the high volume of generated data nowadays. Hence, this paper aims at improving the scalability of quantitative association rule mining techniques based on genetic algorithms to handle large-scale datasets without quality loss in the results obtained. For this purpose, a new representation of the individuals, new genetic operators and a windowing-based learning scheme are proposed to achieve successfully such challenging task. Specifically, the proposed techniques are integrated into the multi-objective evolutionary algorithm named QARGA-M to assess their performances. Both the standard version and the enhanced one of QARGA-M have been tested in several datasets that present different number of attributes and instances. Furthermore, the proposed methodologies have been integrated into other existing techniques based in genetic algorithms to discover quantitative association rules. The comparative analysis performed shows significant improvements of QARGA-M and other existing genetic algorithms in terms of computational costs without losing quality in the results when the proposed techniques are applied.
    Full-text · Article · Feb 2015 · Integrated Computer Aided Engineering
  • Source
    • "Therefore, it would be beneficial if one could generate the association rules in a direct way, skipping the frequent itemset generation step. For this purpose, evolutionary algorithms have been used widely for generating association rules by maximizing the support/confidence of the rules [99]. However, the goodness of an association rule cannot only be represented by its support or confidence. "
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper is the second part of a two-part paper, which is a survey of multiobjective evolutionary algorithms for data mining problems. In Part I , multiobjective evolutionary algorithms used for feature selection and classification have been reviewed. In this part, different multiobjective evolutionary algorithms used for clustering, association rule mining, and other data mining tasks are surveyed. Moreover, a general discussion is provided along with scopes for future research in the domain of multiobjective evolutionary algorithms for data mining.
    Full-text · Article · Feb 2014 · IEEE Transactions on Evolutionary Computation
  • Source
    • "From all of them, support and confidence highlight although lift, gain, certainty factor or leverage are also indicators that provide useful information about the extracted rules. A review on AR learning based on the use of EA applied to boolean, categorical, quantitative and fuzzy variables has been described in [16]. However, as this work is focused on quantitative variables only the works using this kind of data are reviewed in this section. "
    [Show abstract] [Hide abstract]
    ABSTRACT: The majority of the existing techniques to mine association rules typically use the support and the confidence to evaluate the quality of the rules obtained. However, these two measures may not be sufficient to properly assess their quality due to some inherent drawbacks they present. A review of the literature reveals that there exist many measures to evaluate the quality of the rules, but that the simultaneous optimization of all measures is complex and might lead to poor results. In this work, a principal components analysis is applied to a set of measures that evaluate quantitative association rules' quality. From this analysis, a reduced subset of measures has been selected to be included in the fitness function in order to obtain better values for the whole set of quality measures, and not only for those included in the fitness function. This is a general-purpose methodology and can, therefore, be applied to the fitness function of any algorithm. To validate if better results are obtained when using the function fitness composed of the subset of measures proposed here, the existing QARGA algorithm has been applied to a wide variety of datasets. Finally, a comparative analysis of the results obtained by means of the application of QARGA with the original fitness function is provided, showing a remarkable improvement when the new one is used.
    Full-text · Article · Feb 2014 · Neurocomputing
Show more