Skip to main content

On the Complexity of Rules for the Classification of Patterns

  • Conference paper
  • First Online:
Computer Aided Systems Theory – EUROCAST 2015 (EUROCAST 2015)

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

Included in the following conference series:

  • 1505 Accesses

Abstract

The paper introduces a Pattern Classification problem in an archeological scenario. Basic assumptions to work with this class of problem are addressed: close-worlds, feature extraction, generation of classification rules, non-monotonic reasoning. A Chaitin-Kolmogorov type of complexity measure for the classification rules is introduced and compared with a handling complexity based on the usage of the rules.

Work leading to this paper was partially supported by the Foundation for the Advance of Soft Computing, Mieres, Asturias, Spain.

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 EPUB and 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

References

  1. Brewka, G.: Nonmonotonic Reasoning: Logical Foundations of Commonsense. Cambridge University Press, Cambridge (1991)

    MATH  Google Scholar 

  2. Chaitin, G.J.: Algorithmic Information Theory. Cambridge University Press, Cambridge (1987)

    Book  MATH  Google Scholar 

  3. Fu, K.S.: Syntactical Pattern Recognition, Applications. Communications and Cybernetic, vol. 14. Springer, Heidelberg (1977)

    Book  Google Scholar 

  4. Galdar. http://www.spain-grancanaria.com/uk/places/galdar.html

  5. Giakoumakis, E., Papaconstantinou, G., Skordalakis, E.: Rule-based systems and pattern recognition. Pattern Recogn. Lett. 5(4), 267–272 (1987)

    Article  Google Scholar 

  6. Jain, A.K., Duin, R.P.W., Mao, J.: Statistical pattern recognition: a review. IEEE Trans. Pattern Anal. Mach. Intell. 22(1), 4–37 (2000)

    Article  Google Scholar 

  7. Kuncheva, L.: Combining Pattern Classifiers: Methods and Algorithms. Wiley, New York (2004)

    Book  MATH  Google Scholar 

  8. Reiter, R.: On closed world data bases. In: Gallaire, H., Minker, J. (eds.) Logic and Data Bases, pp. 119–140. Plenum Press, New York (1978)

    Google Scholar 

  9. Rodríguez-Fernández, J.L.: Ockham’s Razor. Endeavour 23(3), 121–125 (1999)

    Article  MathSciNet  Google Scholar 

  10. Sierpinski. http://de.wikipedia.org/wiki/Sierpinski-Dreieck

  11. Tassili. http://www.cvsanten.net/ (Select Tassili from the panel Pictorial Accounts)

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Claudio Moraga .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Moraga, C. (2015). On the Complexity of Rules for the Classification of Patterns. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds) Computer Aided Systems Theory – EUROCAST 2015. EUROCAST 2015. Lecture Notes in Computer Science(), vol 9520. Springer, Cham. https://doi.org/10.1007/978-3-319-27340-2_77

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27340-2_77

  • Published:

  • Publisher Name: Springer, Cham

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

  • Online ISBN: 978-3-319-27340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics