ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Neural Networks
Volume 4, Issue 3, 1991, Pages 337-347
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Purchase PDF (1092 K)

Article Toolbox
 
 
 
Related Articles in ScienceDirect
View More Related Articles
 
View Record in Scopus
 
doi:10.1016/0893-6080(91)90070-L    
How to Cite or Link Using DOI (Opens New Window)

Copyright © 1991 Published by Elsevier Ltd.

Original contribution

Correlations in high dimensional or asymmetric data sets: Hebbian neuronal processingstar, open

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

William R. SoftkyCorresponding Author Contact Information, a and Daniel M. Kammen1, a

aCalifornia Institute of Technology USA


Received 7 May 1990; 
accepted 30 October 1990. 
Available online 6 March 2003.

Abstract

The Hebbian neural learning algorithm that implements Principal Component Analysis (PCA) can be extended for the analysis of more realistic forms of neural data by including higher than two-channel correlations and non-Euclidean 1p metrics. Maximizing a dth rank tensor form which correlates d channels is equivalent to raising the exponential order of variance correlation from 2 to d in the algorithm that implements PCA. Simulations suggest that a generalized version of Oja's PCA neuron can detect such a dth order principal component. Arguments from biology and pattern recognition suggest that neural data in general is not symmetric about its mean; performing PCA with an implicit 1l metric rather than the Euclidean metric weights exponentially distributed vectors according to their probability, as does a highly nonlinear Hebb rule. The correlation order d and the 1p metric exponent p were each roughly constant for each of several Hebb rules simulated. High-order correlation analysis may prove increasingly useful as data from large networks of cells engaged in information processing becomes available.

Keywords: Principal component analysis; Hebbian learning; Self-organization; Correlation functions; Multidimensional analysis; Non-Euclidean metrics; Information theory; Asymmetric coding

star, openThis work was supported by grants to C. Koch from James S. McDonnell Foundation, the Air Force Office of Scientific Research, and a NSF Presidential Young Investigator Award.


Corresponding Author Contact InformationRequests for reprints should be sent to William R. Softky, Divisions of Physics and Computation and Neural Systems, 216-76 California Institute of Technology, Pasadena, CA 91125.
1 D. M. K. is supported by a Weizmann Postdoctoral Fellowship from the Division of Biological Sciences.

Neural Networks
Volume 4, Issue 3, 1991, Pages 337-347
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.