首页 | 本学科首页   官方微博 | 高级检索  
   检索      


Non-linear data structure extraction using simple hebbian networks
Authors:Colin Fyfe  Roland Baddeley
Institution:(1) Department of Computer Science, University of Strathclyde, UK, GB;(2) Department of Experimental Psychology, University of Oxford, South Parks Rd, Oxford OX1 3UD, UK, GB
Abstract:. We present a class a neural networks algorithms based on simple hebbian learning which allow the finding of higher order structure in data. The neural networks use negative feedback of activation to self-organise; such networks have previously been shown to be capable of performing principal component analysis (PCA). In this paper, this is extended to exploratory projection pursuit (EPP), which is a statistical method for investigating structure in high-dimensional data sets. As opposed to previous proposals for networks which learn using hebbian learning, no explicit weight normalisation, decay or weight clipping is required. The results are extended to multiple units and related to both the statistical literature on EPP and the neural network literature on non-linear PCA. Received: 30 May 1994/Accepted in revised form: 18 November 1994
Keywords:
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号