Please use this identifier to cite or link to this item: http://ktisis.cut.ac.cy/handle/10488/4019
Title: Improving the performance of resource allocation networks through hierarchical clustering of high-dimensional data
Authors: Tsapatsoulis, Nicolas 
Wallace, Manolis 
Kasderidis, Stathis 
Keywords: Intelligent systems
Resource Allocating Network
Issue Date: 2003
Publisher: Springer Berlin Heidelberg
Source: Joint International Conference on Artificial Neural Networks and International Conference on Neural Information Processing, 2003, Istanbul, Turkey, 26–29 June
Abstract: To non-stationary contexts is a very important property for intelligent systems in general, as well as to a variety of applications of knowledge based systems in era of “ambient intelligence”. In this paper we present a modified Resource Allocating Network architecture that allows for online adaptation and knowledge modelling through its adaptive structure. As in any neural network system proper parameter initialization reduces training time and effort. However, in RAN architectures, proper parameter initialization also leads to compact modelling (less hidden nodes) of the process under examination, and consequently to better generalization. In the cases of high-dimensional data parameter initialization is both difficult and time consuming. In the proposed scheme a high – dimensional, unsupervised clustering method is used to properly initialize the RAN architecture. Clusters correspond to the initial nodes of RAN, while output layer weights are also extracted from the clustering procedure. The efficiency of the proposed method has been tested on several classes of publicly available data (iris, ionosphere, etc.)
URI: http://ktisis.cut.ac.cy/jspui/handle/10488/4019
DOI: 10.1007/3-540-44989-2_103
Rights: Springer-Verlag Berlin Heidelberg
Appears in Collections:Δημοσιεύσεις σε συνέδρια/Conference papers

Show full item record

Page view(s)

6
Last Week
0
Last month
1
checked on Jun 26, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.