Skip to main content

Domains of Competence of Artificial Neural Networks Using Measures of Separability of Classes

  • Conference paper
  • 2115 Accesses

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

Abstract

In this work we want to analyse the behaviour of two classic Artificial Neural Network models respect to a data complexity measures. In particular, we consider a Radial Basis Function Network and a Multi-Layer Perceptron. We examine the metrics of data complexity known as Measures of Separability of Classes over a wide range of data sets built from real data, and try to extract behaviour patterns from the results. We obtain rules that describe both good or bad behaviours of the Artificial Neural Networks mentioned.

With the obtained rules, we try to predict the behaviour of the methods from the data set complexity metrics prior to its application, and therefore establish their domains of competence.

This work has been supported by the Spanish Ministry of Science and Technology under Project TIN2008-06681-C06-01. J. Luengo holds a FPU scholarship from Spanish Ministry of Innovation and Science.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Asuncion, A., Newman, D.J.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA (2007), http://www.ics.uci.edu/~mlearn/MLRepository.html

    Google Scholar 

  2. Baumgartner, R., Somorjai, R.L.: Data complexity assessment in undersampled classification. Pattern Recognition Letters 27, 1383–1389 (2006)

    Article  Google Scholar 

  3. Bernadó-Mansilla, E., Ho, T.K.: Domain of Competence of XCS Classifier System in Complexity Measurement Space. IEEE Transactions on Evolutionary Computation 9(1), 82–104 (2005)

    Article  Google Scholar 

  4. Bezdek, J.C., Kuncheva, L.I.: Nearest prototype classifier designs: An experimental study. International Journal of Intelligent Systems 16(12), 1445–1473 (2001)

    Article  MATH  Google Scholar 

  5. Broomhead, D.S., Lowe, D.: Multivariable Functional Interpolation and Adaptive Networks. Complex Systems 11, 321–355 (1988)

    MathSciNet  MATH  Google Scholar 

  6. Daqi, G., Chunxia, L., Yunfan, Y.: Task decomposition and modular single-hidden-layer perceptron classifiers for multi-class learning problems. Pattern Recognition 40(8), 2226–2236 (2007)

    Article  MATH  Google Scholar 

  7. Dong, M., Kothari, R.: Feature subset selection using a new definition of classificabilty. Pattern Recognition Letters 24, 1215–1225 (2003)

    Article  MATH  Google Scholar 

  8. Ho, T.K., Baird, H.S.: Pattern classification with compact distribution maps. Computer Vision and Image Understanding 70(1), 101–110 (1998)

    Article  Google Scholar 

  9. Ho, T.K., Basu, M.: Complexity Measures of Supervised Classification Problems. IEEE Transactions on Pattern Analysis and Machine Intelligence 24(3), 289–300 (2002)

    Article  Google Scholar 

  10. Basu, M., Ho, T.K. (eds.): Data Complexity in Pattern Recognition. Springer, Heidelberg (2006)

    MATH  Google Scholar 

  11. Li, Y., Dong, M., Kothari, R.: Classifiability-Based Omnivariate Decision Trees. IEEE Transactions on Neural Networks 16(6), 1547–1560 (2005)

    Article  Google Scholar 

  12. Moller, F.: A scaled conjugate gradient algorithm for fast supervised learning. Neural Networks 6, 525–533 (1993)

    Article  Google Scholar 

  13. Mollineda, R.A., Sánchez, J.S., Sotoca, J.M.: Data Characterization for Effective Prototype Selection. In: Marques, J.S., Pérez de la Blanca, N., Pina, P. (eds.) IbPRIA 2005. LNCS, vol. 3523, pp. 27–34. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  14. Renjifo, C., Barsic, D., Carmen, C., Norman, K., Peacock, G.S.: Improving radial basis function kernel classification through incremental learning and automatic parameter selection. Neurocomputing 72(1-3), 3–14 (2008)

    Article  Google Scholar 

  15. Rojas, R., Feldman, J.: Neural Networks: A Systematic Introduction. Springer, Heidelberg (1996)

    Book  MATH  Google Scholar 

  16. Sánchez, J.S., Mollineda, R.A., Sotoca, J.M.: An analysis of how training data complexity affects the nearest neighbor classifiers. Pattern Analysis and Applications 10(3), 189–201 (2007)

    Article  MathSciNet  Google Scholar 

  17. Singh, S.: Multiresolution Estimates of Classification Complexity. IEEE Transactions on Pattern Analysis and Machine Intelligence 25(12), 1534–1539 (2003)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Luengo, J., Herrera, F. (2009). Domains of Competence of Artificial Neural Networks Using Measures of Separability of Classes. In: Cabestany, J., Sandoval, F., Prieto, A., Corchado, J.M. (eds) Bio-Inspired Systems: Computational and Ambient Intelligence. IWANN 2009. Lecture Notes in Computer Science, vol 5517. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-02478-8_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-02478-8_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-02477-1

  • Online ISBN: 978-3-642-02478-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics