Skip to main content

Developments on a Multi-objective Metaheuristic (MOMH) Algorithm for Finding Interesting Sets of Classification Rules

  • Conference paper
Evolutionary Multi-Criterion Optimization (EMO 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3410))

Included in the following conference series:

Abstract

In this paper, we experiment with a combination of innovative approaches to rule induction to encourage the production of interesting sets of classification rules. These include multi-objective metaheuristics to induce the rules; measures of rule dissimilarity to encourage the production of dissimilar rules; and rule clustering algorithms to evaluate the results obtained.

Our previous implementation of NSGA-II for rule induction produces a set of cc-optimal rules (coverage-confidence optimal rules). Among the set of rules produced there may be rules that are very similar. We explore the concept of rule similarity and experiment with a number of modifications of the crowding distance to increasing the diversity of the partial classification rules produced by the multi-objective algorithm.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ali, S., Manganaris, K., Srikant, R.: Partial classification using association rules. In: Heckerman, D., Mannila, H., Pregibon, D., Uthurusamy, R. (eds.) Proceedings of the Third Int. Conf. on Knowledge Discovery and Data Mining, pp. 115–118. AAAI Press, Menlo Park (1997)

    Google Scholar 

  2. Bayardo, R., Agrawal, R.: Constraint based rule mining in large, dense databases. Data Mining and Knowledge Discovery Journal 4, 217–240 (2000)

    Article  Google Scholar 

  3. Bayardo, R., Agrawal, R.: Mining the most interesting rules. In: Proceedings of the 5th International Conference on Knowledge Discovery and Data Mining (KDD 1999), pp. 145–152. AAAI Press, Menlo Park (1999)

    Chapter  Google Scholar 

  4. Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and regression trees. Wadsworth, Pacific Grove (1984)

    MATH  Google Scholar 

  5. Clark, P., Niblett, T.: The CN2 induction algorithm. Machine Learning 3, 261–284 (1989)

    Google Scholar 

  6. Cohen, W.: Fast effective rule induction. In: Proceedings of Twelfth International Conference on Machine Learning (ICML-1995), pp. 115–123. Morgan Kaufman, San Francisco (1995)

    Google Scholar 

  7. de la Iglesia, B., Richards, G., Philpott, M.S., Smith, V.J.R.: The application and effectiveness of a multi-objective metaheuristic algorithm for partial classification. European Journal of Operational Research (2004)( to appear)

    Google Scholar 

  8. Deb, K., Agrawal, S., Pratab, A., Meyarivan, T.: A Fast Elitist Non-Dominated Sorting Genetic Algorithm for Multi-Objective Optimization: NSGA-II. In: Deb, K., Rudolph, G., Lutton, E., Merelo, J.J., Schoenauer, M., Schwefel, H.-P., Yao, X. (eds.) PPSN 2000. LNCS, vol. 1917, pp. 849–858. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  9. Freitas, A.A.: On objective measures of rule surprisingness. In: Żytkow, J.M. (ed.) PKDD 1998. LNCS, vol. 1510, Springer, Heidelberg (1998)

    Google Scholar 

  10. Freitas, A.A.: On rule interestingness measures. Knowledge-Based Systems Journal 12(5-6), 209–315 (1999)

    Google Scholar 

  11. Jaccard, P.: Étude comparative de la distribution florale dans une portion des Alpes et des Jura. Bulletin de la Société Vaudoise de la Sciences Naturelles 37, 547–579 (1901)

    Google Scholar 

  12. Kaufman, L., Rousseuw, P.J.: Finding Groups in Data: An introduction to Cluster Analisys. Wiley Series in probability and mathematical statistics. John Wiley and Sons Inc., Chichester (1990)

    Book  Google Scholar 

  13. Merz, C.J., Murphy, P.M.: UCI repository of machine learning databases. Univ. California, Irvine (1998)

    Google Scholar 

  14. Piatetsky-Shapiro, G.: Discovery, Analysis, and Presentation of Strong Rules, ch. 13, pp. 229–248. AAAI/MIT Press (1991)

    Google Scholar 

  15. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo (1993)

    Google Scholar 

  16. Reynolds, A.P., Richards, G., de la Iglesia, B., Smith, V.J.R.: Nugget clustering: A comparison of partitioning and hierarchical clustering algorithms. TBA (In preparation 2004)

    Google Scholar 

  17. Reynolds, A.P., Richards, G., Rayward-Smith, V.J.: The Application of K-medoids and PAM to the Clustering of Rules. In: Yang, Z.R., Yin, H., Everson, R.M. (eds.) IDEAL 2004. LNCS, vol. 3177, pp. 173–178. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  18. Richards, G., Rayward-Smith, V.J.: The discovery of association rules from tabular databases comprising nominal and ordinal attributes. Intelligent Data Analysis 9(3) (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de la Iglesia, B., Reynolds, A., Rayward-Smith, V.J. (2005). Developments on a Multi-objective Metaheuristic (MOMH) Algorithm for Finding Interesting Sets of Classification Rules. In: Coello Coello, C.A., Hernández Aguirre, A., Zitzler, E. (eds) Evolutionary Multi-Criterion Optimization. EMO 2005. Lecture Notes in Computer Science, vol 3410. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31880-4_57

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31880-4_57

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-24983-2

  • Online ISBN: 978-3-540-31880-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics