Skip to main content Accessibility help
×
Home

Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery

  • Mohammed Khabzaoui (a1), Clarisse Dhaenens (a1) and El-Ghazali Talbi (a1)

Abstract

An important task of knowledge discovery deals with discovering association rules. This very general model has been widely studied and efficient algorithms have been proposed. But most of the time, only frequent rules are seeked. Here we propose to consider this problem as a multi-objective combinatorial optimization problem in order to be able to also find non frequent but interesting rules. As the search space may be very large, a discussion about different approaches is proposed and a hybrid approach that combines a metaheuristic and an exact operator is presented.

    • Send article to Kindle

      To send this article to your Kindle, first ensure no-reply@cambridge.org is added to your Approved Personal Document E-mail List under your Personal Document Settings on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part of your Kindle email address below. Find out more about sending to your Kindle. Find out more about sending to your Kindle.

      Note you can select to send to either the @free.kindle.com or @kindle.com variations. ‘@free.kindle.com’ emails are free but can only be sent to your device when it is connected to wi-fi. ‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.

      Find out more about the Kindle Personal Document Service.

      Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery
      Available formats
      ×

      Send article to Dropbox

      To send this article to your Dropbox account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Dropbox.

      Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery
      Available formats
      ×

      Send article to Google Drive

      To send this article to your Google Drive account, please select one or more formats and confirm that you agree to abide by our usage policies. If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your <service> account. Find out more about sending content to Google Drive.

      Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery
      Available formats
      ×

Copyright

References

Hide All
[1] R. Agrawal and R. Srikant, Fast algorithms for mining association rules, in Proc. 20th Int. Conf. Very Large Data Bases, VLDB, edited by J.B. Bocca, M. Jarke, and C. Zaniolo, Morgan Kaufmann 12 (1994) 487–499
[2] D.L.A. Araujo, H.S. Lopes and A.A. Freitas, A Parallel Genetic Algorithm for Rule Discovery in Large Databases, in Proc. 1999 IEEE Systems, Man and Cybernetics Conf., Vol. III (1999) 940–945, Tokyo, Japan.
[3] M. Basseur, F. Seynhaeve and E-G. Talbi, Adaptive mechanisms for multi-objective evolutionary algorithms. IMACS multiconference, Computational Engineering in Systems Applications (CESA'03), IEEE Service Center, Piscataway, New Jersey, S3-R-00-222:100–107 (2003).
[4] C. Borgelt, Efficient implementations of apriori and eclat, in Workshop Frequent Item Set Mining Implementations (FIMI 2003, Melbourne, FL, USA) 90 (2003).
[5] C.A. Coello, D.A. Van Veldhuizen and G.B. Lamont, Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers (2002).
[6] Cotta, C. and Troya, J.M., Embedding branch and bound within evolutionary algorithms. Appl. Intell. 18 (2003) 137153
[7] Fonseca, C.M. and Fleming, P.J., An overview of evolutionary algorithms in multiobjective optimization. Evolutionary Comput. 3 (1995) 116.
[8] Freitas, A., On rule interestingness measures. Knowledge-Based Syst. J. 12 (1999) 309315.
[9] R. Hilderman and H. Hamilton, Knowledge discovery and interestingness measures: A survey, technical report cs 99-04. Technical report, Department of Computer Science, University of Regina, October (1999).
[10] Hong, T.P., Wang, H. and Chen, W., Simultaneously applying multiple mutation operators in genetic algorithms. J. Heuristics 6 (2000) 439455.
[11] A. Jaszkiewicz, On the performance of multiple objective genetic local search on the 0/1 knapsack problem. a comparative experiment. Technical Report RA-002/2000, Institute of Computing Science, Poznan University of Technology, Poznan, Poland (2000).
[12] M. Khabzaoui, C. Dhaenens, A. N'Guessan and E.-G. Talbi, Etude exploratoire des critères de qualité des règles d'association en datamining, in Journées Françaises de Statistique (2003) 583–587.
[13] M. Khabzaoui, C. Dhaenens and E.-G. Talbi, Association rules discovery for DNA microarray data. Bioinformatics Workshop of SIAM International Conference on Data Mining (2004) 63–71.
[14] M. Khabzaoui, C. Dhaenens and E.-G. Talbi, A Multicriteria Genetic Algorithm to analyze DNA microarray data, in Congress on Evolutionary Computation (CEC), Vol. II, pp. 1874–1881, Portland, USA (2004). IEEE Service center.
[15] J.D. Knowles, D.W. Corne and M.J. Oates, On the assessment of multiobjective approaches to the adaptive distributed database management problem. In Proceedings of the Sixth International Conference on Parallel Problem Solving from Nature (PPSN VI) (2000) 869–878
[16] J. Puchinger and G.R. Raidl, Combining metaheuristics and exact algorithms in combinatorial optimization: A survey and classification, in First international Work-Conference on the Interplay between Natural and Artificial Computation (IWINAC) 3562 (2005) 41–53.
[17] P. Smyth and R.M. Goodman, Knowledge Discovery in Databases, Chapter Rule Induction Using Information Theory, G. Piatetsky-Shapiro and J. Frawley (1991) 159–176.
[18] Talbi, E.-G., A taxonomy of hybrid metaheuristics. Journal of Heuristics 8 (2002) 541564.
[19] P-N. Tan, V. Kumar and J. Srivastava, Selecting the right interestingness measure for association patterns, in Proceedings of the Eight ACM SIGKDD conference, Edmonton, Canada (2002).
[20] D.A.Van Veldhuizen and G.B. Lamont, On measuring multiobjective evolutionary algorithm performance, in In 2000 Congress on Evolutionary Computation. Piscataway, New Jersey, Vol. 1, 204–211 (2000).
[21] K. Wang, S.H.W. Tay and B. Liu, Interestingness-based interval merger for numeric association rules, in edited by Proc. 4th Int. Conf. Knowledge Discovery and Data Mining, KDD, R. Agrawal, P. E. Stolorz, and G. Piatetsky-Shapiro, pp. 121–128. AAAI Press, (1998) 27–31. New York, USA.
[22] Zaki, M.J., Parallel sequence mining on shared-memory machines. J. Parallel and Distrib. Comput. 61 (2001) 401426.
[23] Zitzler, E. and Thiele, L., Multiobjective evolutionary algorithms: A comparative case study and the strength pareto approach. IEEE Trans. Evol. Comput. 3 (1999) 257271.

Keywords

Combining evolutionary algorithms and exact approaches for multi-objective knowledge discovery

  • Mohammed Khabzaoui (a1), Clarisse Dhaenens (a1) and El-Ghazali Talbi (a1)

Metrics

Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed