Skip to main content

Optimization of Decision Rules Relative to Coverage—Comparison of Greedy and Modified Dynamic Programming Approaches

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 391))

Abstract

In the paper, a modification of a dynamic programming algorithm for optimization of decision rules relative to coverage is proposed. Experimental results with decision tables from UCI Machine Learning Repository are presented.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.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

Learn about institutional subscriptions

References

  1. Alkhalid, A., Amin, T., Chikalov, I., Hussain, S., Moshkov, M., Zielosko, B.: Dagger: A tool for analysis and optimization of decision trees and rules. In: Computational Informatics. Social Factors and New Information Technologies: Hypermedia Perspectives and Avant-Garde Experiences in the Era of Communicability Expansion, pp. 29–39. Blue Herons, Bergamo (2011)

    Google Scholar 

  2. Amin, T., Chikalov, I., Moshkov, M., Zielosko, B.: Dynamic programming approach to optimization of approximate decision rules. Inf. Sci. 221, 403–418 (2013)

    Article  MathSciNet  MATH  Google Scholar 

  3. Asuncion, A., Newman, D.J.: UCI Machine Learning Repository (2007). http://www.ics.uci.edu/~mlearn/

  4. Błaszczyński, J., Słowiński, R.: Szela̧g, M.: Sequential covering rule induction algorithm for variable consistency rough set approaches. Inf. Sci. 181(5), 987–1002 (2011)

    Google Scholar 

  5. Dembczyński, K., Kotłowski, W., Słowiński, R.: ENDER: a statistical framework for boosting decision rules. Data Min. Knowl. Disc. 21(1), 52–90 (2010)

    Article  Google Scholar 

  6. Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2000)

    Google Scholar 

  7. Moshkov, M., Piliszczuk, M., Zielosko, B.: Partial Covers, Reducts and Decision Rules in Rough Sets - Theory and Applications, SCI, vol. 145. Springer-Verlag, Berlin Heidelberg, Germany (2008)

    Google Scholar 

  8. Moshkov, M., Zielosko, B.: Combinatorial Machine Learning - A Rough Set Approach, SCI, vol. 360. Springer, Berlin Heidelberg, Germany (2011)

    Book  Google Scholar 

  9. Nguyen, H.S.: Approximate boolean reasoning: foundations and applications in data mining. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets V, LNCS, vol. 4100, pp. 334–506. Springer, Berlin Heidelberg, Germany (2006)

    Google Scholar 

  10. Nowak, A., Zielosko, B.: Clustering of partial decision rules. In: Cyran, K.A., Kozielski, S., Peters, J.F., Stańczyk, U., Wakulicz-Deja, A. (eds.) Man-Machine Interactions, AISC, vol. 59, pp. 183–190. Springer, Berlin Heidelberg, Germany (2009)

    Chapter  Google Scholar 

  11. Pawlak, Z., Skowron, A.: Rough sets and Boolean reasoning. Inf. Sci. 177(1), 41–73 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  12. Sikora, M., Wróbel, Ł.: Data-driven adaptive selection of rule quality measures for improving rule induction and filtration algorithms. Int J. Gen. Syst. 42(6), 594–613 (2013)

    Article  Google Scholar 

  13. Stańczyk, U.: Decision rule length as a basis for evaluation of attribute relevance. J. Intell. Fuzzy Syst. 24(3), 429–445 (2013)

    Google Scholar 

  14. Stefanowski, J., Vanderpooten, D.: Induction of decision rules in classification and discovery-oriented perspectives. Int. J. Intell. Syst. 16(1), 13–27 (2001)

    Article  MATH  Google Scholar 

  15. Zielosko, B.: Optimization of approximate decision rules relative to coverage. In: Kozielski, S., Mrózek, D., Kasprowski, P., Małysiak-Mrózek, B., Kostrzewa, D. (eds.) Beyond Databases, Architectures, and Structures, CCIS, vol. 424, pp. 170–179. Springer, Switzerland (2014)

    Chapter  Google Scholar 

  16. Zielosko, B.: Optimization of decision rules relative to coverage - comparative study. In: Kryszkiewicz, M., Cornelis, C., Ciucci, D., Medina-Moreno, J., Motoda, H., Raś, Z.W. (eds.) Rough Sets and Intelligent Systems Paradigms, LNCS, vol. 8537, pp. 237–247. Springer, Switzerland (2014)

    Google Scholar 

  17. Zielosko, B., Chikalov, I., Moshkov, M., Amin, T.: Optimization of decision rules based on dynamic programming approach. In: Faucher, C., Jain, L.C. (eds.) Innovations in Intelligent Machines-4–Recent Advances in Knowledge Engineering, SCI, vol. 514, pp. 369–392. Springer, Switzerland (2014)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Beata Zielosko .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Zielosko, B. (2016). Optimization of Decision Rules Relative to Coverage—Comparison of Greedy and Modified Dynamic Programming Approaches. In: Gruca, A., Brachman, A., Kozielski, S., Czachórski, T. (eds) Man–Machine Interactions 4. Advances in Intelligent Systems and Computing, vol 391. Springer, Cham. https://doi.org/10.1007/978-3-319-23437-3_55

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-23437-3_55

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-23436-6

  • Online ISBN: 978-3-319-23437-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics