Article

On the discovery of association rules by means of evolutionary algorithms.

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

ABSTRACT 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

1 Bookmark
 · 
105 Views
  • [Show abstract] [Hide abstract]
    ABSTRACT: In the domain of association rules mining (ARM) discovering the rules for numerical attributes is still a challenging issue. Most of the popular approaches for numerical ARM require a priori data discretization to handle the numerical attributes. Moreover, in the process of discovering relations among data, often more than one objective (quality measure) is required, and in most cases, such objectives include conflicting measures. In such a situation, it is recommended to obtain the optimal trade-off between objectives. This paper deals with the numerical ARM problem using a multi-objective perspective by proposing a multi-objective particle swarm optimization algorithm (i.e., MOPAR) for numerical ARM that discovers numerical association rules (ARs) in only one single step. To identify more efficient ARs, several objectives are defined in the proposed multi-objective optimization approach, including confidence, comprehensibility, and interestingness. Finally, by using the Pareto optimality the best ARs are extracted. To deal with numerical attributes, we use rough values containing lower and upper bounds to show the intervals of attributes. In the experimental section of the paper, we analyze the effect of operators used in this study, compare our method to the most popular evolutionary-based proposals for ARM and present an analysis of the mined ARs. The results show that MOPAR extracts reliable (with confidence values close to 95%), comprehensible, and interesting numerical ARs when attaining the optimal trade-off between confidence, comprehensibility and interestingness.
    Expert Systems with Applications 07/2014; 41(9):4259–4273. · 1.97 Impact Factor
  • Source
    [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.
    Neurocomputing 02/2014; 126:3-14. · 2.01 Impact Factor
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: This paper reports on an approach that contributes towards the problem of discovering fuzzy association rules that exhibit a temporal pattern. The novel application of the 2-tuple linguistic representation identifies fuzzy association rules in a temporal context, whilst maintaining the interpretability of linguistic terms. Iterative Rule Learning (IRL) with a Genetic Algorithm (GA) simultaneously induces rules and tunes the membership functions. The discovered rules were compared with those from a traditional method of discovering fuzzy association rules and results demonstrate how the traditional method can loose information because rules occur at the intersection of membership function boundaries. New information can be mined from the proposed approach by improving upon rules discovered with the traditional method and by discovering new rules.
    Fuzzy Systems (FUZZ-IEEE), 2012 IEEE International Conference on; 01/2012