Skip to main content

Monotone Classification by Function Decomposition

  • Conference paper
Book cover Discovery Science (DS 2005)

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

Included in the following conference series:

Abstract

The paper focuses on the problem of classification by function decomposition within the frame of monotone classification. We propose a decomposition method for discrete functions which can be applied to monotone problems in order to generate a monotone classifier based on the extracted concept hierarchy. We formulate and prove a criterion for the existence of a positive extension of the scheme f=g(S 0,h(S 1)) in the context of discrete functions. We also propose a method for finding an assignment for the intermediate concept with a minimal number of values.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bioch, J.C., Popova, V.: Monotone Decision Trees and Noisy Data. In: Blockeel, H., Denecker, M. (eds.) Proceedings of the 14th Belgium-Dutch Conference on Artificial Intelligence (BNAIC 2002), Leuven, pp. 19–26 (2002)

    Google Scholar 

  2. Bioch, J.C., Potharst, R.: Decision Trees for Monotone Classification. In: van Marcke, K., Daelmans, W. (eds.) Proceedings of the Dutch Artificial Conference on Artificial Intelligence (NAIC 1997), pp. 361–369 (1997)

    Google Scholar 

  3. Blake, C.L., Mertz, C.J.: UCI Repository of machine learning databases. University of California. Department of Information and Computer Science, Irvine (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html

  4. Bohanec, M., Rajkovič, V.: DEX: An expert system shell for decision support. Sistemica 1, 145–157 (1990)

    Google Scholar 

  5. Boros, E., Gurvich, V., Hammer, P.L., Ibaraki, T., Kogan, A.: Decomposability of partially defined Boolean functions. Discrete Applied Mathematics 62, 51–75 (1995)

    Article  MathSciNet  MATH  Google Scholar 

  6. Popova, V.: Knowledge Discovery and Monotonicity, PhD Thesis, Erasmus University Rotterdam, The Netherlands (2004)

    Google Scholar 

  7. Potharst, R., Bioch, J.C.: Decision Trees for Ordinal Classification. Intelligent Data Analysis 4, 1–15 (2000)

    Google Scholar 

  8. Samuel, A.L.: Some studies in machine learning using the game of checkers. IBM Journal of Research and Development 3, 221–229 (1959)

    Article  Google Scholar 

  9. Shapiro, A.D.: Structured induction in expert systems. Turing Institute Press in association with Addison-Wesley, Wokingham, UK (1987)

    Google Scholar 

  10. Zupan, B.: Machine learning by function decomposition. PhD Thesis, University of Ljubljana (1997)

    Google Scholar 

  11. Zupan, B., Bohanec, M., Demsar, J., Bratko, I.: Learning by Discovering Concept Hierarchies. Artificial Intelligence 109, 211–242 (1999)

    Article  MathSciNet  MATH  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

Popova, V., Bioch, J.C. (2005). Monotone Classification by Function Decomposition. In: Hoffmann, A., Motoda, H., Scheffer, T. (eds) Discovery Science. DS 2005. Lecture Notes in Computer Science(), vol 3735. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11563983_18

Download citation

  • DOI: https://doi.org/10.1007/11563983_18

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31698-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics