Unsupervised learning in neural computation
β Scribed by Erkki Oja
- Book ID
- 104325412
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 247 KB
- Volume
- 287
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
In this article, we consider unsupervised learning from the point of view of applying neural computation on signal and data analysis problems. The article is an introductory survey, concentrating on the main principles and categories of unsupervised learning. In neural computation, there are two classical categories for unsupervised learning methods and models: ΓΏrst, extensions of principal component analysis and factor analysis, and second, learning vector coding or clustering methods that are based on competitive learning. These are covered in this article. The more recent trend in unsupervised learning is to consider this problem in the framework of probabilistic generative models. If it is possible to build and estimate a model that explains the data in terms of some latent variables, key insights may be obtained into the true nature and structure of the data. This approach is also brie y reviewed.
π SIMILAR VOLUMES
How could synapse number and position on a dendrite affect neuronal behavior with respect to the decoding of firing rate and temporal pattern? We developed a model of a neuron with a passive dendrite and found that dendritic length and the particular synapse positions directly determine the behavior
The requirement of input vector normalisation in unsupervised neural nets results in a loss of information about the intensity of the signal contained in the input datastream. We show through a simple algebraic analysis that the introduction of an additional input channel encoding the root-mean-squa