Skip to main content

Argument Based Generalization of MODLEM Rule Induction Algorithm

  • Conference paper
Rough Sets and Current Trends in Computing (RSCTC 2010)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 6086))

Included in the following conference series:

Abstract

Argument based learning allows experts to express their domain, local knowledge about the circumstances of making classification decisions for some learning examples. In this paper we have incorporated this idea in rule induction as a generalization of the MODLEM algorithm. To adjust the algorithm to the redefined task, a new measure for evaluating rule conditions and a new classification strategy with rules had to be introduced. Experimental studies showed that using arguments improved classification accuracy and structure of rules. Moreover the proper argumentation improved recognition of the minority class in imbalanced data without essential decreasing recognition of the majority classes.

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. Flach, P.A.: Invited Tutorial on Rule Induction. Spring School on Intelligent Data Analysis, Palermo (March 2001), http://www.pa.icar.cnr.it/IDAschool

  2. Furnkranz, J.: Separate-and-conquer rule learning. Artificial Intelligence Review 13(1), 3–54 (1999)

    Article  Google Scholar 

  3. Grzymala-Busse, J.W.: Managing uncertainty in machine learning from examples. In: Proc. of the 3rd Intern. Symposium in Intelligent Systems, pp. 70–94 (1994)

    Google Scholar 

  4. Grzymala-Busse, J.W., Stefanowski, J., Wilk, S.z.: A comparison of two approaches to data mining from imbalanced data. Journal of Intelligent Manufacturing 16(6), 565–574 (2005)

    Article  Google Scholar 

  5. Liu, B., Hsu, W.: Domain knowledge to support the discovery process - previously discovered knowledge. In: Klosgen, W., Zytkow, J. (eds.) Handbook of Data Mining and Knowledge Discovery, pp. 461–467. Oxford Press, Oxford (2002)

    Google Scholar 

  6. Mozina, M., Bratko, I.: Argumentation and machine learning. Research Report: Deliverable 2.1 for the ASPIC project (2004)

    Google Scholar 

  7. Mozina, M., Zabkar, J., Bench-Capon, T., Bratko, I.: Argument based machine learning applied to law. Artificial Intelligence and Law 13(1), 53–57 (2005)

    Article  Google Scholar 

  8. Mozina, M., Zabkar, J., Bratko, I.: Argument based machine learning. Aritificial Intelligence Journal 171, 922–937 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Stefanowski, J.: Rough set based rule induction techniques for classification problems. In: Proc. 6th European Congress on Intelligent Techniques and Soft Computing, EUFIT 1998, Aachen, September 7-10, vol. 1, pp. 109–113 (1998)

    Google Scholar 

  10. Stefanowski, J.: Algorithms of rule induction for knowledge discovery. In: Habilitation Thesis published as Series Rozprawy, vol. 361, pp. 18–21. Poznan University of Technology Press (2001) (in Polish)

    Google Scholar 

  11. Stefanowski, J.: On combined classifiers, rule induction and rough sets. In: Peters, J.F., Skowron, A., Düntsch, I., Grzymała-Busse, J.W., Orłowska, E., Polkowski, L. (eds.) Transactions on Rough Sets VI. LNCS, vol. 4374, pp. 329–350. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Napierała, K., Stefanowski, J. (2010). Argument Based Generalization of MODLEM Rule Induction Algorithm. In: Szczuka, M., Kryszkiewicz, M., Ramanna, S., Jensen, R., Hu, Q. (eds) Rough Sets and Current Trends in Computing. RSCTC 2010. Lecture Notes in Computer Science(), vol 6086. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13529-3_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13529-3_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13528-6

  • Online ISBN: 978-3-642-13529-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics