Cascade correlation algorithm

Cascade correlation algorithm

Cascade-Correlation is an architecture and supervised learning algorithm for artificial neural networks developed by Scott Fahlman.Instead of just adjusting the weights in a network of fixed topology, Cascade-Correlation begins with aminimal network, then automatically trains and adds new hidden units one by one, creating a multi-layerstructure. Once a new hidden unit has been added to the network, its input-side weights are frozen. This unitthen becomes a permanent feature-detector in the network, available for producing outputs or for creatingother, more complex feature detectors. The Cascade-Correlation architecture has several advantages overexisting algorithms: it learns very quickly, the network determines its own size and topology, it retains thestructures it has built even if the training set changes, and it requires no backpropagation of error signalsthrough the connections of the network.

External links

* [http://www.cs.iastate.edu/~honavar/fahlman.pdf The Cascade-Correlation Learning Architecture] Scott E. Fahlman and Christian Lebiere, August 29, 1991. Article created for National Science Foundation under Contract Number EET-8716324 and Defense Advanced Research Projects Agency (DOD), ARPA Order No. 4976 under Contract F33615-87-C-1499.


Wikimedia Foundation. 2010.

Игры ⚽ Поможем написать курсовую

Look at other dictionaries:

  • Correlation attack — In cryptography, correlation attacks are a class of known plaintext attacks for breaking stream ciphers whose keystream is generated by combining the output of several linear feedback shift registers (called LFSRs for the rest of this article)… …   Wikipedia

  • Correlation immunity — In mathematics, the correlation immunity of a Boolean function is a measure of the degree to which its outputs are uncorrelated with some subset of its inputs. Specifically, a Boolean function is said to be correlation immune of order m if every… …   Wikipedia

  • Rprop — Rprop, short for resilient backpropagation, is a learning heuristics for supervised learning in artificial neural networks. Similarly to the Manhattan update rule, Rprop takes into account only the sign of the partial derivative over all patterns …   Wikipedia

  • Artificial neural network — An artificial neural network (ANN), usually called neural network (NN), is a mathematical model or computational model that is inspired by the structure and/or functional aspects of biological neural networks. A neural network consists of an… …   Wikipedia

  • Molecule mining — This page describes mining for molecules. Since molecules may be represented by molecular graphs this is strongly related to graph mining and structured data mining. The main problem is how to represent molecules while discriminating the data… …   Wikipedia

  • ACT-R — (pronounced act ARE : Adaptive Control of Thought Rational) is a cognitive architecture mainly developed by John Robert Anderson at Carnegie Mellon University. Like any cognitive architecture, ACT R aims to define the basic and irreducible… …   Wikipedia

  • List of mathematics articles (C) — NOTOC C C closed subgroup C minimal theory C normal subgroup C number C semiring C space C symmetry C* algebra C0 semigroup CA group Cabal (set theory) Cabibbo Kobayashi Maskawa matrix Cabinet projection Cable knot Cabri Geometry Cabtaxi number… …   Wikipedia

  • List of mathematics articles (M) — NOTOC M M estimator M group M matrix M separation M set M. C. Escher s legacy M. Riesz extension theorem M/M/1 model Maass wave form Mac Lane s planarity criterion Macaulay brackets Macbeath surface MacCormack method Macdonald polynomial Machin… …   Wikipedia

  • Earth Sciences — ▪ 2009 Introduction Geology and Geochemistry       The theme of the 33rd International Geological Congress, which was held in Norway in August 2008, was “Earth System Science: Foundation for Sustainable Development.” It was attended by nearly… …   Universalium

  • Krohn–Rhodes theory — In mathematics and computer science, Krohn Rhodes theory is an approach to the study of finite semigroups and automata that seeks to decompose them in terms of elementary components. These turn out to correspond to finite aperiodic semigroups and …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”