7
Views
0
CrossRef citations to date
0
Altmetric
Original Article

Theoretical and practical studies of a competitive learning process

, &
Pages 285-301 | Received 18 Jan 1991, Published online: 09 Jul 2009

References

  • Alon N. Eigenvalues and expanders. Combinatorica 1986; 6: 83–96
  • Biggs N L. Algebraic Graph Theory. Cambridge University Press, Cambridge 1974
  • Bollobás B. Random Graphs. Academic, London 1985
  • Garey M R, Johnson D S. Computers and Intractability. Freeman, San Francisco 1979
  • Grossberg S. Adaptive pattern classification and universal recoding: Part I. Parallel development and coding of neural feature detectors. Biol. Cybern. 1976; 23: 121–34
  • Lubotzky A, Phillips R, Sarnak P. Ramanujan graphs. Combinatorica 1988; 8: 261–77
  • McKay B D. The expected eigenvalue distribution of a large regular graph. Linear Algebra Appl. 1981; 40: 203–16
  • Rumelhart D E, Zipser D. Feature discovery competitive learning. Parallel Distributed Processing. MIT Press, Cambridge, MA 1986; 151–93
  • von der Malsburg C. Self-organizing of orientation sensitive cells in the striate cortex. Kybernetik 1973; 14: 85–100

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.