Skip to main content

Part of the book series: Perspectives in Neural Computing ((PERSPECT.NEURAL))

Abstract

Geometric separability is a generalisation of linear separability, familiar to many from Minsky and Papert’s analysis of the Perceptron learning method. The concept forms a novel dimension along which to conceptualise learning methods. The present paper shows how geometric separability can be defined and demonstrates that it accurately predicts the performance of a at least one empirical learning method.

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. Rendell, L. and Seshu, R. (1990). Learning hard concepts through constructive induction. Computational Intelligence, 6 (pp. 247–270 ).

    Google Scholar 

  2. Minsky, M. and Papert, S. (1969). Perceptrons. Cambridge, Mass.: MIT Press.

    MATH  Google Scholar 

  3. Minsky, M. and Papert, S. (1988). Perceptrons: An Introduction to Computational Geometry (expanded edn). Cambridge, Mass.: MIT Press.

    Google Scholar 

  4. Thornton, C. (1996). Parity: the problem that won’t go away. In G. McCalla (Ed.), Proceeding of AI-96 (Toronto, Canada) (pp. 362–374). Springer.

    Google Scholar 

  5. Holte, R. (1993). Very simple classification rules perform well on most commonly used datasets. Machine learning, 3 (pp. 63–91 ).

    Google Scholar 

  6. Fisher, D. and McKusick, K. (1989). An empirical comparison of ID3 and back-propagation. Proceedings of the Eleventh International Joint Conference on Artificial Intelligence (pp. 788–793). Morgan Kaufmann.

    Google Scholar 

  7. Muggleton, S. (Ed.) (1992). Inductive Logic Programming. Academic Press.

    Google Scholar 

  8. Holland, J. (1975). Adaptation in Natural and Artificial Systems. Ann Arbor: University of Michigan Press.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag London Limited

About this paper

Cite this paper

Thornton, C. (1998). Separability is a Learner’s Best Friend. In: Bullinaria, J.A., Glasspool, D.W., Houghton, G. (eds) 4th Neural Computation and Psychology Workshop, London, 9–11 April 1997. Perspectives in Neural Computing. Springer, London. https://doi.org/10.1007/978-1-4471-1546-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-1546-5_4

  • Publisher Name: Springer, London

  • Print ISBN: 978-3-540-76208-9

  • Online ISBN: 978-1-4471-1546-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics