Skip to main content

CPL Criterion Functions and Learning Algorithms Linked to the Linear Separability Concept

  • Conference paper
Engineering Applications of Neural Networks (EANN 2013)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 383))

  • 1728 Accesses

Abstract

Linear separabilty of learning sets is a basic concept of neural networks theory. Exploration of the linear separability can be based on the minimization of the perceptron criterion function. Modification of the perceptron criterion function have been proposed recently aimed at feature selection problem. The modified criterion functions allows, among others, for discovering minimal feature subset that assure linear separability. Learning algorithm linked to the modified function is formulated in the paper.

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. Rosenblatt, F.: Principles of neurodynamics. Spartan Books, Washington (1962)

    Google Scholar 

  2. Minsky, M.L., Papert, S.A.: Perceptrons - Expanded Edition. An Introduction to Computational Geometry. The MIT Press, Cambridge (1987)

    Google Scholar 

  3. Duda, O.R., Hart, P.E., Stork, D.G.: Pattern classification. J. Wiley, New York (2001)

    MATH  Google Scholar 

  4. Bishop, C.M.: Neural Networks for Pattern Recognition. Oxford University Press, New York (1953); Rosenblatt F.: Principles of neurodynamics. Spartan Books, Washington (1962)

    Google Scholar 

  5. Bobrowski, L.: Eksploracja danych oparta na wypukłych i odcinkowo-liniowych funkcjach kryterialnych (Data mining based on convex and piecewise linear (CPL) criterion functions). Technical University Białystok (2005) (in Polish)

    Google Scholar 

  6. Bobrowski, L., Łukaszuk, T.: Relaxed Linear Separability (RLS) Approach to Feature (Gene) Subset Selection. In: Xia, X. (ed.) Selected Works in Bioinformatics, pp. 103–118. Intech (2011)

    Google Scholar 

  7. Bobrowski, L.: Design of piecewise linear classifiers from formal neurons by some basis exchange technique. Pattern Recognition 24(9), 863–870 (1991)

    Article  Google Scholar 

  8. Kushner, H.J., Clark, D.S.: Stochastic Approximation for Constrained and Unconstrained Systems. Springer, Berlin (1978)

    Book  Google Scholar 

  9. Wu, T.T., Chen, Y.F., Hastie, T., Sobel, E., Lange, K.: Genome-wide association analysis by lasso penalized logistic regression. Bioinformatics 25(6), 714–721 (2009)

    Article  Google Scholar 

  10. Vapnik, V.N.: Statistical Learning Theory. J. Wiley, New York (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Bobrowski, L. (2013). CPL Criterion Functions and Learning Algorithms Linked to the Linear Separability Concept. In: Iliadis, L., Papadopoulos, H., Jayne, C. (eds) Engineering Applications of Neural Networks. EANN 2013. Communications in Computer and Information Science, vol 383. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-41013-0_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-41013-0_47

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-41012-3

  • Online ISBN: 978-3-642-41013-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics