Skip to main content
SpringerLink
Log in

Feature construction for back-propagation

  • Neural Networks
  • Conference paper
  • First Online:
Parallel Problem Solving from Nature (PPSN 1990)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 496))

Included in the following conference series:

  • 243 Accesses

I would like to thank Gunnar Blix, Christopher Matheus, and Larry Rendell for their assistance in providing me with CITRE and the example data set.

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.

References

  1. Becker, S., and Y. Le Cun, “Improving the Convergence of Back-Propagation Learning with Second-Order Methods,” Proceedings of the 1988 Connectionist Models Summer School, Pittsburgh, 1988.

    Google Scholar 

  2. Fahlman, S. E., “Faster-Learning Variations on Back-Propagation: An Empirical Study,” Proceedings of the 1988 Connectionist Models Summer School, Pittsburgh, 1988.

    Google Scholar 

  3. Langley, P., H. A. Simon, G. L. Bradshaw, and J. M. Zytkow, Scientific Discovery: Computational Explorations of the Creative Process, MIT Press, Cambridge, 1987.

    Google Scholar 

  4. Matheus, C. J., Feature Construction: An Analytic Framework and An Application to Decision Trees, PhD Thesis, Department of Computer Science, University of Illinois at Urbana-Champaign, December 1989.

    Google Scholar 

  5. Matheus, C. J., “Feature Construction in CITRE,” Submitted to the 1990 Machine Learning Conference.

    Google Scholar 

  6. Muggleton, S., “Duce: An Oracle Based Approach to Constructive Induction,” in Proceedings of the Tenth International Joint Conference on Artificial Intelligence, 1987, pp. 287–292.

    Google Scholar 

  7. Pagallo, G., and D. Haussler, “Two Algorithms that Learn DNF by Discovering Relevant Features,” in Proceedings of the Sixth International Workshop on Machine Learning, June, 1989, Morgan Kauffman, pp. 119–123.

    Google Scholar 

  8. Quinlan, J. R., “Induction of Decision Trees,” Machine Learning, 1, 1, 1986, pp. 81–106.

    Google Scholar 

  9. Shannon, C. E., “A Mathematical Theory of Communication,” Bell Systems Technological Journal, 27, July 1948, pp. 379–423.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Beckman Institute, University of Illinois, 61801, Urbana, IL

    Selwyn Piramuthu

Authors
  1. Selwyn Piramuthu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hans-Paul Schwefel Reinhard Männer

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Piramuthu, S. (1991). Feature construction for back-propagation. In: Schwefel, HP., Männer, R. (eds) Parallel Problem Solving from Nature. PPSN 1990. Lecture Notes in Computer Science, vol 496. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029762

Download citation

  • DOI: https://doi.org/10.1007/BFb0029762

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54148-6

  • Online ISBN: 978-3-540-70652-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation