Skip to main content
Springer Nature Link
Log in

Efficient Constructive Techniques for Training Switching Neural Networks

  • Chapter
Constructive Neural Networks

Part of the book series: Studies in Computational Intelligence ((SCI,volume 258))

  • 1302 Accesses

Abstract

In this paper a general constructive approach for training neural networks in classification problems is presented. This approach is used to construct a particular connectionist model, named Switching Neural Network (SNN), based on the conversion of the original problem in a Boolean lattice domain. The training of an SNN can be performed through a constructive algorithm, called Switch Programming (SP), based on the solution of a proper linear programming problem. Since the execution of SP may require excessive computational time, an approximate version of it, named Approximate Switch Programming (ASP) has been developed. Simulation results obtained on the StatLog benchmark show the good quality of the SNNs trained with SP and ASP.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Boros, E., Hammer, P.L., Ibaraki, T., Kogan, A., Mayoraz, E., Muchnik, I.: An implementation of Logical Analysis of Data. IEEE Trans. Knowledge and Data Eng. 9, 292–306 (2004)

    Google Scholar 

  2. Devroye, L., Györfi, L., Lugosi, G.: A probabilistic theory of Pattern Recognition. Springer, Heidelberg

    Google Scholar 

  3. Ferrari, E., Muselli, M.: A constructive technique based on linear programming for training switching neural networks. In: Kůrková, V., Neruda, R., Koutník, J. (eds.) ICANN 2008, Part II. LNCS, vol. 5164, pp. 744–753. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  4. Hong, S.J.: R-MINI: An iterative approach for generating minimal rules from examples. IEEE Trans. Knowledge and Data Eng. 9, 709–717 (1997)

    Article  Google Scholar 

  5. Kerber, R.: ChiMerge: Discretization of numeric attributes. In: Proc. 9th Int’l. Conf. on Art. Intell., pp. 123–128 (1992)

    Google Scholar 

  6. Kohavi, R., Sahami, M.: Error-based and Entropy based discretization of continuous features. In: Proc. 2nd Int. Conf. Knowledge Discovery and Data Mining, pp. 114–119 (1996)

    Google Scholar 

  7. Liu, H., Setiono, R.: Feature selection via discretization. IEEE Trans. on Knowledge and Data Eng. 9, 642–645 (1997)

    Article  Google Scholar 

  8. Makhorin, A.: GNU Linear Programming Kit - Reference Manual (2008), http://www.gnu.org/software/glpk/

  9. Michie, D., Spiegelhalter, D., Taylor, C.: Machine Learning, Neural and Statistical Classification. Ellis-Horwood, London (1994)

    MATH  Google Scholar 

  10. Muselli, M.: Sequential Constructive Techniques. In: Leondes, C. (ed.) Optimization Techniques, Neural Netw. Systems Techniques and Applications, pp. 81–144. Academic Press, San Diego (1998)

    Google Scholar 

  11. Muselli, M.: Approximation properties of positive boolean functions. In: Apolloni, B., Marinaro, M., Nicosia, G., Tagliaferri, R. (eds.) WIRN 2005 and NAIS 2005. LNCS, vol. 3931, pp. 18–22. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  12. Muselli, M.: Switching neural networks: A new connectionist model for classification. In: Apolloni, B., Marinaro, M., Nicosia, G., Tagliaferri, R. (eds.) WIRN/NAIS 2005. LNCS, vol. 3931, pp. 23–30. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Muselli, M., Liberati, D.: Binary rule generation via Hamming Clustering. IEEE Trans. Knowledge and Data Eng. 14, 1258–1268 (2002)

    Article  Google Scholar 

  14. Muselli, M., Quarati, A.: Reconstructing positive Boolean functions with Shadow Clustering. In: Proc. 17th European Conf. Circuit Theory and Design, pp. 377–380 (2005)

    Google Scholar 

  15. Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann, San Francisco (1994)

    Google Scholar 

  16. Reed, R.: Pruning Algorithm–A Survey. IEEE Trans. on Neural Netw. 4, 740–747 (1993)

    Article  Google Scholar 

  17. Rumelhart, D.E., Hinton, G.E., Williams, R.J.: Learning representations by backpropagating errors. Nature 323, 533–536 (1988)

    Article  Google Scholar 

  18. Vapnik, V.N.: Statistical learning theory. John Wiley & Sons, New York (1998)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Electronics, Computer and Telecommunication Engineering, Italian National Research Council, Via De Marini, 6, 16149, Genoa, Italy

    Enrico Ferrari & Marco Muselli

Authors
  1. Enrico Ferrari
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Marco Muselli
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Science, University of Malaga , Campus de Teatinos S/N, 29071, Málaga, Spain

    Leonardo Franco  & José M. Jerez  & 

  2. Centre for Computational Intelligence, School of Computing, De Montfort University, The Gateway , LE1 9BH, Leicester, UK

    David A. Elizondo

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Ferrari, E., Muselli, M. (2009). Efficient Constructive Techniques for Training Switching Neural Networks. In: Franco, L., Elizondo, D.A., Jerez, J.M. (eds) Constructive Neural Networks. Studies in Computational Intelligence, vol 258. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04512-7_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04512-7_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04511-0

  • Online ISBN: 978-3-642-04512-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics